{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:32:10Z","timestamp":1766442730609,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","funder":[{"name":"Israel Science Foundation","award":["2439\/20"],"award-info":[{"award-number":["2439\/20"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1774\/20"],"award-info":[{"award-number":["1774\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Research Commission","award":["101043243"],"award-info":[{"award-number":["101043243"]}]},{"name":"ERC","award":["101162665"],"award-info":[{"award-number":["101162665"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765159","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:42:02Z","timestamp":1763854922000},"page":"4692-4706","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["MegaBlocks: Breaking the Logarithmic I\/O-Overhead Barrier for 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"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2403-7244","authenticated-orcid":false,"given":"Eliran","family":"Eiluz","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6012-7124","authenticated-orcid":false,"given":"Wei-Kai","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_2_1","first-page":"772","article-title":"Oblivious Computation with Data Locality","volume":"2017","author":"Asharov Gilad","year":"2017","unstructured":"Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2017. Oblivious Computation with Data Locality. IACR Cryptology ePrint Archive, Vol. 2017 (2017), 772.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_3_1","first-page":"8","volume-title":"Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA 2020","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2020a. Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. SIAM, 8-14."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Eliran Eiluz Ilan Komargodski and Wei-Kai Lin. 2025. MegaBlocks: Breaking the Logarithmic I\/O-Overhead Barrier for Oblivious RAM. Cryptology ePrint Archive Paper 2025\/1592. https:\/\/eprint.iacr.org\/2025\/1592","DOI":"10.1145\/3719027.3765159"},{"key":"e_1_3_2_1_5_1","article-title":"OptORAMa","volume":"70","author":"Asharov Gilad","year":"2023","unstructured":"Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, and Elaine Shi. 2023c. OptORAMa: Optimal Oblivious RAM. J. ACM, Vol. 70, 1 (2023), 4:1-4:70.","journal-title":"Optimal Oblivious RAM. J. ACM"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09447-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2020.11"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623125"},{"key":"e_1_3_2_1_10_1","first-page":"837","article-title":"Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward","author":"Bindschaedler Vincent","year":"2015","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 ACM CCS. 837-849.","journal-title":"ACM CCS."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Kai-Min Chung and Rafael Pass. 2015. Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. In CRYPTO.","DOI":"10.1007\/978-3-662-48000-7_36"},{"key":"e_1_3_2_1_12_1","first-page":"175","article-title":"Oblivious Parallel RAM and Applications. In Theory of Cryptography - 13th International Conference","author":"Boyle Elette","year":"2016","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.","journal-title":"TCC."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840761"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9216-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_23"},{"key":"e_1_3_2_1_16_1","first-page":"2201","article-title":"Cache-Oblivious and Data-Oblivious Sorting and Applications","author":"Hubert Chan T.-H.","year":"2018","unstructured":"T.-H. Hubert Chan, Yue Guo, Wei-Kai Lin, and Elaine Shi. 2018. Cache-Oblivious and Data-Oblivious Sorting and Applications. In SODA. 2201-2220.","journal-title":"SODA."},{"key":"e_1_3_2_1_17_1","first-page":"72","article-title":"Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography - 15th International Conference","author":"Hubert Chan T.-H.","year":"2017","unstructured":"T.-H. Hubert Chan and Elaine Shi. 2017. Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography - 15th International Conference, TCC. 72-107.","journal-title":"TCC."},{"key":"e_1_3_2_1_18_1","first-page":"144","article-title":"Perfectly Secure Oblivious RAM without Random Oracles. In Theory of Cryptography - 8th Theory of Cryptography Conference","author":"Damg\u00e5rd Ivan","year":"2011","unstructured":"Ivan Damg\u00e5rd, Sigurd Meldgaard, and Jesper Buus Nielsen. 2011. Perfectly Secure Oblivious RAM without Random Oracles. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC. 144-163.","journal-title":"TCC."},{"key":"e_1_3_2_1_19_1","first-page":"145","article-title":"Onion ORAM","author":"Devadas Srinivas","year":"2016","unstructured":"Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, and Daniel Wichs. 2016. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. In Theory of Cryptography - TCC. 145-174.","journal-title":"A Constant Bandwidth Blowup Oblivious RAM. In Theory of Cryptography - TCC."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_13"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133967"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382536.2382540"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694353"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28166-7_9"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.50"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989555"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.141"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_20"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Kasper Green Larsen and Jesper Buus Nielsen. 2018. Yes There is an Oblivious RAM Lower Bound!. In CRYPTO.","DOI":"10.1007\/978-3-319-96881-0_18"},{"key":"e_1_3_2_1_35_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_36_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 IEEE S&P."},{"key":"e_1_3_2_1_37_1","first-page":"377","article-title":"Distributed oblivious RAM for secure two-party computation","author":"Lu Steve","year":"2013","unstructured":"Steve Lu and Rafail Ostrovsky. 2013. Distributed oblivious RAM for secure two-party computation. In TCC. 377-396.","journal-title":"TCC."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"volume-title":"Accessed","year":"2025","key":"e_1_3_2_1_39_1","unstructured":"AArch64 memory management Guide. 2025. Translation granule. https:\/\/developer.arm.com\/documentation\/101811\/0104\/Translation-granule. Accessed April, 2025."},{"key":"e_1_3_2_1_40_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_41_1","volume-title":"MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. In IACR Conference on Information-Theoretic Cryptography (ITC).","author":"Noble Daniel","year":"2025","unstructured":"Daniel Noble, Brett Hemenway Falk, and Rafail Ostrovsky. 2025. MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. In IACR Conference on Information-Theoretic Cryptography (ITC)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Rafail Ostrovsky and Victor Shoup. 1997. Private Information Storage (Extended Abstract). In STOC.","DOI":"10.1145\/258533.258606"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00087"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.161"},{"key":"e_1_3_2_1_46_1","volume-title":"24th USENIX Security Symposium, USENIX Security. 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 24th USENIX Security Symposium, USENIX Security. 415-430."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2017.2687463"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485971"},{"key":"e_1_3_2_1_49_1","volume-title":"Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In 2020 IEEE Symposium on Security and Privacy, SP. 842-858","author":"Shi Elaine","year":"2020","unstructured":"Elaine Shi. 2020. Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In 2020 IEEE Symposium on Security and Privacy, SP. 842-858."},{"key":"e_1_3_2_1_50_1","first-page":"197","article-title":"Oblivious RAM with O(log N)3)l Worst-Case Cost","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, and Mingfei Li. 2011. Oblivious RAM with O(log N)3)l Worst-Case Cost. In Advances in Cryptology - ASIACRYPT. 197-214.","journal-title":"Advances in Cryptology - ASIACRYPT."},{"key":"e_1_3_2_1_51_1","unstructured":"Signal. 2022. Technology Deep Dive: Building a Faster ORAM Layer for Enclaves. https:\/\/signal.org\/blog\/building-faster-oram. Accessed: 2025-04-03."},{"key":"e_1_3_2_1_52_1","first-page":"253","article-title":"Oblivistore: High performance oblivious cloud storage","author":"Stefanov Emil","year":"2013","unstructured":"Emil Stefanov and Elaine Shi. 2013a. Oblivistore: High performance oblivious cloud storage. In IEEE S&P. 253-267.","journal-title":"IEEE S&P."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_54_1","volume-title":"Towards Practical Oblivious RAM. In 19th Annual Network and Distributed System Security Symposium, NDSS.","author":"Stefanov Emil","year":"2012","unstructured":"Emil Stefanov, Elaine Shi, and Dawn Xiaodong Song. 2012. Towards Practical Oblivious RAM. In 19th Annual Network and Distributed System Security Symposium, NDSS."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.26"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898362"},{"key":"e_1_3_2_1_58_1","first-page":"191","article-title":"SCORAM","author":"Wang Xiao Shaun","year":"2014","unstructured":"Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, and Elaine Shi. 2014. SCORAM: Oblivious RAM for Secure Computation. In ACM CCS. 191-202.","journal-title":"Oblivious RAM for Secure Computation. In ACM CCS."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Peter Williams Radu Sion and Alin Tomescu. 2012. PrivateFS: A Parallel Oblivious File System. In ACM CCS.","DOI":"10.1145\/2382196.2382299"},{"key":"e_1_3_2_1_60_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 IEEE S&P. 218-234."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:28:52Z","timestamp":1766442532000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":60,"alternative-id":["10.1145\/3719027.3765159","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765159","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}