{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:34:07Z","timestamp":1784874847240,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"BSF-NSF","award":["2020643"],"award-info":[{"award-number":["2020643"]}]},{"name":"ISRAEL SCIENCE FOUNDATION","award":["2439\/20,1774\/20"],"award-info":[{"award-number":["2439\/20,1774\/20"]}]},{"name":"European Union?s Horizon 2020 research and innovation programme","award":["891234"],"award-info":[{"award-number":["891234"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623125","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"3313-3327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0846-9773","authenticated-orcid":false,"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[{"name":"Hebrew University & NTT Research, Jerusalem, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8924-1896","authenticated-orcid":false,"given":"Yehuda","family":"Michelson","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai J\u00e1nos Koml\u00f3s and Endre Szemer\u00e9 di. 1983. An O(n log n) Sorting Network. In STOC. 1--9.","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_2_1","volume-title":"Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2020. Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA 2020. SIAM, 8--14."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3566049"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2022. Optimal Oblivious Parallel RAM. In SODA. 2459--2521.","DOI":"10.1137\/1.9781611977073.98"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Ilan Komargodski Wei-Kai Lin and Elaine Shi. 2021. Oblivious RAM with Worst-Case Logarithmic Overhead. In Advances in Cryptology - CRYPTO. 610--640.","DOI":"10.1007\/978-3-030-84259-8_21"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Vincent Bindschaedler Muhammad Naveed Xiaorui Pan XiaoFeng Wang and Yan Huang. 2015. Practicing oblivious access on cloud storage: the gap the fallacy and the new way forward. In CCS. 837--849.","DOI":"10.1145\/2810103.2813649"},{"key":"e_1_3_2_1_7_1","volume-title":"Theory of Cryptography - 13th International Conference, TCC. 175--204.","author":"Boyle Elette","unstructured":"Elette Boyle, Kai-Min Chung, and Rafael Pass. 2016. Oblivious Parallel RAM and Applications. In Theory of Cryptography - 13th International Conference, TCC. 175--204."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"David Cash Paul Grubbs Jason Perry and Thomas Ristenpart. 2015. Leakage-Abuse Attacks Against Searchable Encryption. In CCS. 668--679.","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","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 ASIACRYPT. 660--690.","DOI":"10.1007\/978-3-319-70694-8_23"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"T.-H. Hubert Chan and Elaine Shi. 2017. Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In TCC. 72--107.","DOI":"10.1007\/978-3-319-70503-3_3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Samuel Dittmer and Rafail Ostrovsky. 2020. Oblivious Tight Compaction In O(n) Time with Smaller Constant. In SCN. 253--274.","DOI":"10.1007\/978-3-030-57990-6_13"},{"key":"e_1_3_2_1_12_1","volume-title":"Scaling ORAM for Secure Computation. In ACM SIGSAC Conference on Computer and Communications Security, CCS. 523--535","author":"Doerner Jack","year":"2017","unstructured":"Jack Doerner and Abhi Shelat. 2017. Scaling ORAM for Secure Computation. In ACM SIGSAC Conference on Computer and Communications Security, CCS. 523--535."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Christopher W Fletcher Marten van Dijk and Srinivas Devadas. 2012. A secure processor architecture for encrypted computation on untrusted programs. In STC. 3--8.","DOI":"10.1145\/2382536.2382540"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Christopher W. Fletcher Ling Ren Albert Kwon Marten van Dijk and Srinivas Devadas. 2015. Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM. In ASPLOS. 103--116.","DOI":"10.1145\/2694344.2694353"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Shai Halevi Charanjit Jutla and Mariana Raykova. 2015. Private database access with he-over-oram architecture. In CANS. 172--191.","DOI":"10.1007\/978-3-319-28166-7_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 1987. Towards a Theory of Software Protection and Simulation by Oblivious RAMs. In STOC. 182--194.","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_18_1","volume-title":"Goodrich and Michael Mitzenmacher","author":"Michael","year":"2011","unstructured":"Michael T. Goodrich and Michael Mitzenmacher. 2011. Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. In ICALP. 576--587."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Paul Grubbs Richard McPherson Muhammad Naveed Thomas Ristenpart and Vitaly Shmatikov. 2016. Breaking Web Applications Built On Top of Encrypted Data. In CCS. 1353--1364.","DOI":"10.1145\/2976749.2978351"},{"key":"e_1_3_2_1_21_1","unstructured":"Mohammad Saiful Islam Mehmet Kuzu and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification Attack and Mitigation. In NDSS."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1957995.1958011"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz Steve Lu and Rafail Ostrovsky. 2012. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In SODA. 143--156.","DOI":"10.1137\/1.9781611973099.13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Kasper Green Larsen and Jesper Buus Nielsen. 2018. Yes There is an Oblivious RAM Lower Bound!. In CRYPTO. 523--542.","DOI":"10.1007\/978-3-319-96881-0_18"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/215399.215429"},{"key":"e_1_3_2_1_26_1","unstructured":"Wei-Kai Lin Elaine Shi and Tiancheng Xie. 2019. Can We Overcome the n log n Barrier for Oblivious Sorting?. In SODA."},{"key":"e_1_3_2_1_27_1","volume-title":"Martin Maas, Michael W. Hicks, Mohit Tiwari, and Elaine Shi.","author":"Liu Chang","year":"2015","unstructured":"Chang Liu, Austin Harris, Martin Maas, Michael W. Hicks, Mohit Tiwari, and Elaine Shi. 2015a. GhostRider: A Hardware-Software System for Memory Trace Oblivious Computation. In ASPLOS. 87--101."},{"key":"e_1_3_2_1_28_1","volume-title":"Kartik Nayak, Yan Huang, and Elaine Shi.","author":"Liu Chang","year":"2015","unstructured":"Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, and Elaine Shi. 2015b. ObliVM: A Programming Framework for Secure Computation. In S&P. 359--376."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Increase Your 100's Storage with 128K from Compuserve","volume":"100","author":"Louden Bill","year":"1983","unstructured":"Bill Louden. 1983. Increase Your 100's Storage with 128K from Compuserve. Portable, Vol. 100, 1 (1983), 1.","journal-title":"Portable"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Steve Lu and Rafail Ostrovsky. 2013. Distributed oblivious RAM for secure two-party computation. In TCC. 377--396.","DOI":"10.1007\/978-3-642-36594-2_22"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Martin Maas Eric Love Emil Stefanov Mohit Tiwari Elaine Shi Krste Asanovic John Kubiatowicz and Dawn Song. 2013a. PHANTOM: practical oblivious computation in a secure processor. In CCS. 311--324.","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Martin Maas Eric Love Emil Stefanov Mohit Tiwari Elaine Shi Krste Asanovic John Kubiatowicz and Dawn Song. 2013b. PHANTOM: practical oblivious computation in a secure processor. In CCS. 311--324.","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_3_2_1_33_1","volume-title":"HOP: Hardware makes Obfuscation Practical. In NDSS.","author":"Nayak Kartik","year":"2017","unstructured":"Kartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran, Satya V. Lokam, Elaine Shi, and Vipul Goyal. 2017. HOP: Hardware makes Obfuscation Practical. In NDSS."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Rafail Ostrovsky and Victor Shoup. 1997. Private Information Storage. In STOC. 294--303.","DOI":"10.1145\/258533.258606"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Sarvar Patel Giuseppe Persiano Mariana Raykova and Kevin Yeo. 2018. PanORAMa: Oblivious RAM with Logarithmic Overhead. In FOCS. 871--882.","DOI":"10.1109\/FOCS.2018.00087"},{"key":"e_1_3_2_1_36_1","volume-title":"USENIX Security Symposium. 415--430","author":"Ren Ling","year":"2015","unstructured":"Ling Ren, Christopher W. Fletcher, Albert Kwon, Emil Stefanov, Elaine Shi, Marten van Dijk, and Srinivas Devadas. 2015. Constants Count: Practical Improvements to Oblivious RAM. In USENIX Security Symposium. 415--430."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2017.2687463"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Ling Ren Xiangyao Yu Christopher W. Fletcher Marten van Dijk and Srinivas Devadas. 2013. Design space exploration and optimization of path oblivious RAM in secure processors. In ISCA. 571--582.","DOI":"10.1145\/2485922.2485971"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with O((log N)3) Worst-Case Cost. In ASIACRYPT. 197--214.","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_3_2_1_40_1","unstructured":"Signal. 2022. Technology Deep Dive: Building a Faster ORAM Layer for Enclaves. https:\/\/signal.org\/blog\/building-faster-oram. Accessed: 2023-03-30 14."},{"key":"e_1_3_2_1_41_1","volume-title":"Oblivistore: High performance oblivious cloud storage. In S&P. 253--267.","author":"Stefanov Emil","year":"2013","unstructured":"Emil Stefanov and Elaine Shi. 2013. Oblivistore: High performance oblivious cloud storage. In S&P. 253--267."},{"key":"e_1_3_2_1_42_1","unstructured":"Emil Stefanov Elaine Shi and Dawn Xiaodong Song. 2012. Towards Practical Oblivious RAM. In NDSS."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Emil Stefanov Marten van Dijk Elaine Shi Christopher W. Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas. 2013. Path ORAM: an extremely simple oblivious RAM protocol. In CCS. 299--310.","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang T.-H. Hubert Chan and Elaine Shi. 2015. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. In CCS. 850--861.","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Peter Williams Radu Sion and Alin Tomescu. 2012. PrivateFS: A Parallel Oblivious File System. In CCS. 977--988.","DOI":"10.1145\/2382196.2382299"},{"key":"e_1_3_2_1_47_1","unstructured":"Samee Zahur and David Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. IACR Cryptol. ePrint Arch. (2015) 1153."},{"key":"e_1_3_2_1_48_1","volume-title":"Mariana Raykova, Adria Gasc\u00f3n, Jack Doerner, David Evans, and Jonathan Katz.","author":"Zahur Samee","year":"2016","unstructured":"Samee Zahur, Xiao Shaun Wang, Mariana Raykova, Adria Gasc\u00f3n, Jack Doerner, David Evans, and Jonathan Katz. 2016. Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation. In S&P. 218--234."},{"key":"e_1_3_2_1_49_1","unstructured":"Yupeng Zhang Jonathan Katz and Charalampos Papamanthou. 2016. All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption. In USENIX. 707--720."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:56:43Z","timestamp":1755741403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":49,"alternative-id":["10.1145\/3576915.3623125","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623125","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}