{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T15:46:02Z","timestamp":1749311162803,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Third Xinjiang Scientific Expedition Program","award":["2021XJKK1300"],"award-info":[{"award-number":["2021XJKK1300"]}]},{"DOI":"10.13039\/501100018538","name":"National Ten Thousand Talent Program","doi-asserted-by":"publisher","award":["2021R52007"],"award-info":[{"award-number":["2021R52007"]}],"id":[{"id":"10.13039\/501100018538","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Innovation 2030-Major Project","award":["2021ZD0114300"],"award-info":[{"award-number":["2021ZD0114300"]}]},{"name":"Joint Research Project of Zhejiang Lab","award":["K2022DA0AM01"],"award-info":[{"award-number":["K2022DA0AM01"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB4500405"],"award-info":[{"award-number":["2022YFB4500405"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chinese Academy of Sciences President\u2019 International Fellowship Initiative","award":["2023DT0003"],"award-info":[{"award-number":["2023DT0003"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61821003","61832020"],"award-info":[{"award-number":["61821003","61832020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tdsc.2023.3241184","type":"journal-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T19:22:11Z","timestamp":1675192931000},"page":"5143-5155","source":"Crossref","is-referenced-by-count":3,"title":["Tianji: Securing a Practical Asynchronous Multi-User ORAM"],"prefix":"10.1109","volume":"20","author":[{"given":"Wen","family":"Cheng","sequence":"first","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Dazou","family":"Sang","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3130-3015","authenticated-orcid":false,"given":"Lingfang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Zhejiang Laboratory, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9438-6060","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China"}]},{"given":"Andr\u00e9","family":"Brinkmann","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg-University Mainz, Mainz, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_27"},{"key":"ref2","first-page":"1","article-title":"Access pattern disclosure on searchable encryption:\n                        Ramification, attack and mitigation","volume-title":"Proc. 19th Annu. Netw. Distrib. Syst. Secur. Symp.","author":"Islam"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref6","first-page":"1","article-title":"Towards practical oblivious\n                    RAM","volume-title":"Proc. 19th Annu. Netw. Distrib. Syst.\n                        Secur. Symp.","author":"Stefanov"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2786763.2694353"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830787"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.28"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/fi9040057"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23320"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354226"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304045"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840761"},{"key":"ref19","first-page":"491","article-title":"S3ORAM: A computation-efficient and\n                        constant client bandwidth blowup ORAM with shamir secret\n                        sharing","volume-title":"Proc. ACM SIGSAC Conf. Comput.\n                        Commun. Secur.","author":"Hoang"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080232"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813649"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.20"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36413-7_24"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.23"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.14"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2015.7208292"},{"key":"ref32","first-page":"749","article-title":"Burst ORAM: Minimizing ORAM response times for bursty\n                        access patterns","volume-title":"Proc. 23rd USENIX Secur.\n                        Symp.","author":"Dautrich"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00087"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2989062"},{"issue":"2","key":"ref35","first-page":"169","article-title":"ObliDB: Oblivious query processing for secure\n                        databases","volume-title":"Proc. VLDB Endowment","volume":"13","author":"Eskandarian"},{"key":"ref36","article-title":"KT-ORAM: A bandwidth-efficient ORAM built on k-ary\n                        tree of PIR nodes","volume-title":"Cryptol. ePrint Arch.\n                        Rep. 2014\/624","volume":"2014","author":"Zhang","year":"2014"},{"key":"ref37","first-page":"415","article-title":"Constants count: Practical improvements to\n                        oblivious RAM","volume-title":"Proc. 24th USENIX Secur.\n                        Symp.","author":"Ren"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_8"},{"article-title":"Genomic data privacy and security protection\n                        competition","year":"2017","author":"Asharov","key":"ref39"},{"year":"2019","key":"ref40","article-title":"ZreoMQ: An open-source universal messaging\n                        library"},{"article-title":"NTL: A library for doing number\n                        theory","year":"2019","author":"Shoup","key":"ref41"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10314839\/10032622.pdf?arnumber=10032622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:07:09Z","timestamp":1725905229000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10032622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":41,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2023.3241184","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}