{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:23Z","timestamp":1750309223080,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3656290","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"1644-1659","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Round-trip Hierarchical ORAM via Succinct Indices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6661-8258","authenticated-orcid":false,"given":"William","family":"Holland","sequence":"first","affiliation":[{"name":"CSIRO's data61, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9735-0538","authenticated-orcid":false,"given":"Olga","family":"Ohrimenko","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-6704","authenticated-orcid":false,"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[{"name":"the University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"EUROCRYPT 2020","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi. 2020. OptORAMa: Optimal oblivious RAM. EUROCRYPT 2020 (2020), 403."},{"key":"e_1_3_2_1_2_1","volume-title":"Oblivious RAM with Worst-Case Logarithmic Overhead. In Annual International Cryptology Conference. Springer, 610--640","author":"Asharov Gilad","year":"2021","unstructured":"Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, and Elaine Shi. 2021. Oblivious RAM with Worst-Case Logarithmic Overhead. In Annual International Cryptology Conference. Springer, 610--640."},{"key":"e_1_3_2_1_3_1","unstructured":"Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote oblivious storage: Making oblivious RAM practical. (2011)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1969.6899"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00012"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security. Springer, 660--690","author":"Hubert Chan T-H","year":"2017","unstructured":"T-H Hubert Chan, Yue Guo, Wei-Kai Lin, and Elaine Shi. 2017. Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 660--690."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994528"},{"key":"e_1_3_2_1_9_1","volume-title":"23rd USENIX Security Symposium (USENIX Security 14)","author":"Dautrich Jonathan","year":"2014","unstructured":"Jonathan Dautrich, Emil Stefanov, and Elaine Shi. 2014. Burst {ORAM}: Minimizing {ORAM} Response Times for Bursty Access Patterns. In 23rd USENIX Security Symposium (USENIX Security 14). 749--764."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_3_2_1_11_1","first-page":"1065","article-title":"Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM","volume":"2015","author":"Fletcher Christopher W","year":"2015","unstructured":"Christopher W Fletcher, Muhammad Naveed, Ling Ren, Elaine Shi, and Emil Stefanov. 2015. Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM. IACR Cryptol. ePrint Arch. 2015 (2015), 1065.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/355609.362340"},{"key":"e_1_3_2_1_13_1","volume-title":"Annual International Cryptology Conference. Springer, 563--592","author":"Garg Sanjam","year":"2016","unstructured":"Sanjam Garg, Payman Mohassel, and Charalampos Papamanthou. 2016. TWORAM: efficient oblivious RAM in two rounds with applications to searchable encryption. In Annual International Cryptology Conference. Springer, 563--592."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Goodrich Michael T","key":"e_1_3_2_1_15_1","unstructured":"Michael T Goodrich and Michael Mitzenmacher. 2011. Privacy-preserving access of outsourced data via oblivious RAM simulation. In International Colloquium on Automata, Languages, and Programming. Springer, 576--587."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 157--167","author":"Goodrich Michael T","year":"2012","unstructured":"Michael T Goodrich, Michael Mitzenmacher, Olga Ohrimenko, and Roberto Tamassia. 2012. Privacy-preserving group data access via stateless oblivious RAM simulation. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 157--167."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Brett Hemenway Falk Daniel Noble and Rafail Ostrovsky. 2021. Alibi: A flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution. In Advances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer 338--369.","DOI":"10.1007\/978-3-030-77883-5_12"},{"key":"e_1_3_2_1_18_1","volume-title":"AsiaCCS","author":"Holland William L","year":"2022","unstructured":"William L Holland, Olga Ohrimenko, and Anthony Wirth. 2022. Efficient Oblivious Permutation on the Waksman Network. In AsiaCCS 2022."},{"key":"e_1_3_2_1_19_1","volume-title":"Recency Queries with Succinct Representation. In 31st International Symposium on Algorithms and Computation (ISAAC","author":"Holland William L","year":"2020","unstructured":"William L Holland, Anthony Wirth, and Justin Zobel. 2020. Recency Queries with Succinct Representation. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_20_1","volume-title":"Ndss","volume":"20","author":"Islam Mohammad Saiful","year":"2012","unstructured":"Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access pattern disclosure on searchable encryption: ramification, attack and mitigation.. In Ndss, Vol. 20. Citeseer, 12."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978386"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_18"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_22"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 659--671","author":"Nagarajan Chandrasekhar","year":"2019","unstructured":"Chandrasekhar Nagarajan, Ali Shafiee, Rajeev Balasubramonian, and Mohit Tiwari. 2019. \u03c1: Relaxed hierarchical ORAM. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 659--671."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.07.004"},{"key":"e_1_3_2_1_27_1","volume-title":"CPSY2018-14","author":"Oe K","year":"2018","unstructured":"K Oe, K Ogihara, and T Honda. 2018. Analysis of commercial cloud workload and study on how to apply cache methods. IEICE CPSY, Kumamoto, Japan (SWoPP 2018), CPSY2018-14 (2018), 7--12."},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Ohrimenko Olga","key":"e_1_3_2_1_28_1","unstructured":"Olga Ohrimenko, Michael T Goodrich, Roberto Tamassia, and Eli Upfal. 2014. The Melbourne shuffle: Improving oblivious storage in the cloud. In International Colloquium on Automata, Languages, and Programming. Springer, 556--567."},{"key":"e_1_3_2_1_29_1","volume-title":"USENIX Security Symposium","author":"Oprea Alina","year":"2007","unstructured":"Alina Oprea and Michael K Reiter. 2007. Integrity Checking in Cryptographic File Systems with Constant Trusted Storage.. In USENIX Security Symposium. Boston, MA;, 183--198."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00087"},{"key":"e_1_3_2_1_31_1","volume-title":"Cacheshuffle: An oblivious shuffle algorithm using caches. arXiv preprint","author":"Patel Sarvar","year":"2017","unstructured":"Sarvar Patel, Giuseppe Persiano, and Kevin Yeo. 2017. Cacheshuffle: An oblivious shuffle algorithm using caches. arXiv preprint (2017)."},{"volume-title":"Annual cryptology conference","author":"Pinkas Benny","key":"e_1_3_2_1_32_1","unstructured":"Benny Pinkas and Tzachy Reinman. 2010. Oblivious RAM revisited. In Annual cryptology conference. Springer, 502--519."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_34_1","volume-title":"AB-ORAM: Constructing Adjustable Buckets for Space Reduction in Ring ORAM. In 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 361--373","author":"Raoufi Mehrnoosh","year":"2023","unstructured":"Mehrnoosh Raoufi, Jun Yang, Xulong Tang, and Youtao Zhang. 2023. AB-ORAM: Constructing Adjustable Buckets for Space Reduction in Ring ORAM. In 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 361--373."},{"key":"e_1_3_2_1_35_1","first-page":"997","article-title":"Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM","volume":"2014","author":"Ren Ling","year":"2014","unstructured":"Ling Ren, Christopher W Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, and Srinivas Devadas. 2014. Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM. IACR Cryptol. ePrint Arch. 2014 (2014), 997.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_36_1","volume-title":"Emil Stefanov, and Mingfei Li.","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi, T-H Hubert Chan, Emil Stefanov, and Mingfei Li. 2011. Oblivious RAM with O ((logN) 3) Worst-Case Cost.. In Asiacrypt, Vol. 7073. Springer, 197--214."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897885"},{"key":"e_1_3_2_1_38_1","volume-title":"FastPRP: Fast pseudo-random permutations for small domains. Cryptology ePrint Archive","author":"Stefanov Emil","year":"2012","unstructured":"Emil Stefanov and Elaine Shi. 2012. FastPRP: Fast pseudo-random permutations for small domains. Cryptology ePrint Archive (2012)."},{"key":"e_1_3_2_1_39_1","volume-title":"Towards practical oblivious RAM. NDSS","author":"Stefanov Emil","year":"2012","unstructured":"Emil Stefanov, Elaine Shi, and Dawn Song. 2012. Towards practical oblivious RAM. NDSS (2012)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"e_1_3_2_1_41_1","volume-title":"ACM SIGSAC","author":"Wang Wenhao","year":"2017","unstructured":"Wenhao Wang, Guoxing Chen, Xiaorui Pan, Yinqian Zhang, XiaoFeng Wang, Vincent Bindschaedler, Haixu Tang, and Carl A Gunter. 2017. Leaky cauldron on the dark land: Understanding memory side-channel hazards in SGX. In ACM SIGSAC 2017. 2421--2434."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382229"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.45"},{"key":"e_1_3_2_1_44_1","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Zhang Yu","year":"2020","unstructured":"Yu Zhang, Ping Huang, Ke Zhou, Hua Wang, Jianying Hu, Yongguang Ji, and Bin Cheng. 2020. {OSCA}: An {Online-Model} Based Cache Allocation Scheme in Cloud Block Storage Systems. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 785--798."}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Singapore Singapore","acronym":"ASIA CCS '24"},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3656290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:07Z","timestamp":1750290247000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3656290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":44,"alternative-id":["10.1145\/3634737.3656290","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3656290","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}