{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:13:54Z","timestamp":1775470434260,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF\/CNS-1664445"],"award-info":[{"award-number":["NSF\/CNS-1664445"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3133967","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"523-535","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":137,"title":["Scaling ORAM for Secure Computation"],"prefix":"10.1145","author":[{"given":"Jack","family":"Doerner","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Christopher W. Fletcher Kartik Nayak Benny Pinkas and Ling Ren. 2017. Asymptotically Tight Bounds for Composing ORAM with PIR PKC.","DOI":"10.1007\/978-3-662-54365-8_5"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","unstructured":"Donald Beaver Silvio Micali and Phillip Rogaway. 1990. The Round Complexity of Secure Protocols. In ACM STOC. 10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Marina Blanton Aaron Steele and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing ACM Asia CCS.","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_2_6_1","unstructured":"Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote Oblivious Storage: Making Oblivious RAM practical. http:\/\/dspace.mit.edu\/bitstream\/handle\/1721.1\/62006\/MIT-CSAIL-TR-2011-018.pdf. (2011)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Joan Boyar and Ren\u00e9 Peralta 2010. A New Combinational Logic Minimization Technique with Applications to Cryptology Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-13193-6_16"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Joan Boyar and Ren\u00e9 Peralta 2012. A Small Depth-16 Circuit for the AES S-Box.","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Elette Boyle Kai-Min Chung and Rafael Pass. 2016. Oblivious Parallel RAM and Applications. In TCC. 10.1007\/978-3-662-49099-0_7","DOI":"10.1007\/978-3-662-49099-0_7"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai 2015. Function Secret Sharing. In EUROCRYPT. 10.1007\/978-3-662-46803-6_12","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai 2016. Function Secret Sharing: Improvements and Extensions ACM CCS.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_2_12_1","volume-title":"Statistically-secure ORAM with $tildeO(\u0142g2 n) Overhead. arXiv preprint arXiv:1307.3699","author":"Chung Kai-Min","year":"2013","unstructured":"Kai-Min Chung, Zhenming Liu, and Rafael Pass 2013. Statistically-secure ORAM with $tildeO(\u0142g2 n) Overhead. arXiv preprint arXiv:1307.3699 (2013)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Sigurd Meldgaard and Jesper Buus Nielsen. 2011. Perfectly Secure Oblivious RAM without Random Oracles TCC.","DOI":"10.1007\/978-3-642-19571-6_10"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","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 TCC.","DOI":"10.1007\/978-3-662-49099-0_6"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner David Evans and abhi shelat. 2016. Secure Stable Matching at Scale. In ACM CCS.","DOI":"10.1145\/2976749.2978373"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Niv Gilboa and Yuval Ishai 2014. Distributed Point Functions and Their Applications.","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs ACM STOC.","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_2_19_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 ICALP."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich Michael Mitzenmacher Olga Ohrimenko and Roberto Tamassia 2011. Oblivious RAM Simulation with Efficient Worst-Case Access Overhead ACM CCSW.","DOI":"10.1145\/2046660.2046680"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich Michael Mitzenmacher Olga Ohrimenko and Roberto Tamassia 2012. Privacy-preserving group data access via stateless oblivious RAM simulation ACM-SIAM SODA.","DOI":"10.1137\/1.9781611973099.14"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","unstructured":"Dov Gordon Jonathan Katz Vladimir Kolesnikov Fernando Krell Tal Malkin Mariana Raykova and Yevgeniy Vahlis 2012. Secure Two-party Computation in Sublinear (Amortized) Time ACM CCS. 10.1145\/2382196.2382251","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_2_23_1","volume-title":"Faster Secure Two-party Computation Using Garbled Circuits USENIX Security Symposium.","author":"Huang Yan","year":"2011","unstructured":"Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster Secure Two-party Computation Using Garbled Circuits USENIX Security Symposium."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Zahra Jafargholi and Daniel Wichs 2016. Adaptive Security of Yao's Garbled Circuits.","DOI":"10.1007\/978-3-662-53641-4_17"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller and Peter Scholl 2014. Efficient Oblivious Data Structures for MPC.","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"e_1_3_2_2_27_1","unstructured":"Vladimir Kolesnikov and Thomas Schneider 2008. Improved Garbled Circuit: Free XOR Gates and Applications ICALP."},{"key":"e_1_3_2_2_28_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 ACM-SIAM SODA.","DOI":"10.1137\/1.9781611973099.13"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_2_30_1","unstructured":"Steve Lu and Rafail Ostrovsky 2013. Distributed Oblivious RAM for Secure Two-Party Computation."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Valeria Nikolaenko Udi Weinsberg Stratis Ioannidis Marc Joye Dan Boneh and Nina Taft. 2013. Privacy-Preserving Ridge Regression on Hundreds of Millions of Records IEEE S&P.","DOI":"10.1109\/SP.2013.30"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","unstructured":"Rafail Ostrovsky. 1990. Efficient computation on oblivious RAMs. In ACM STOC. 10.1145\/100216.100289","DOI":"10.1145\/100216.100289"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","unstructured":"Rafail Ostrovsky and Victor Shoup 1997. Private Information Storage (Extended Abstract). ACM STOC. 10.1145\/258533.258606","DOI":"10.1145\/258533.258606"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","unstructured":"Benny Pinkas and Tzachy Reinman 2010. Oblivious RAM revisited. In CRYPTO. 10.1007\/978-3-642-14623-7_27","DOI":"10.1007\/978-3-642-14623-7_27"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_37_1","unstructured":"Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with $O((\u0142g N)3) Worst-Case Cost ASIACRYPT."},{"key":"e_1_3_2_2_38_1","volume-title":"Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas","author":"Stefanov Emil","year":"2013","unstructured":"Emil Stefanov, Marten Van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas 2013. Path ORAM: an Extremely Simple Oblivious RAM Protocol ACM CCS."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Emil Stefanov Marten van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas 2013. Path ORAM: an Extremely Simple Oblivious RAM Protocol ACM CCS.","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Hubert Chan and Elaine Shi 2015. Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound ACM CCS.","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Yan Huang Hubert Chan Abhi Shelat and Elaine Shi 2014. SCORAM: Oblivious RAM for Secure Computation. In ACM CCS.","DOI":"10.1145\/2660267.2660365"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Yan Huang Yongan Zhao Haixu Tang XiaoFeng Wang and Diyue Bu. 2015. Efficient Genome-Wide Privacy-Preserving Similar Patient Query Based on Private Edit Distance ACM CCS.","DOI":"10.1145\/2810103.2813725"},{"key":"e_1_3_2_2_44_1","unstructured":"Peter Williams and Radu Sion 2008. Usable PIR NDSS."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Peter Williams and Radu Sion 2012. Round-Optimal Access Privacy on Outsourced Storage ACM CCS.","DOI":"10.1145\/2382196.2382229"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Peter Williams Radu Sion and Bogdan Carbunar. 2008. Building castles out of mud: Practical access pattern privacy and correctness on untrusted storage. In ACM CCS.","DOI":"10.1145\/1455770.1455790"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1984.10027"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45760-7_6"},{"key":"e_1_3_2_2_49_1","volume-title":"A Geometric Approach to Information-Theoretic Private Information Retrieval Proceedings of the 20th Annual IEEE Conference on Computational Complexity","author":"Woodruff David","unstructured":"David Woodruff and Sergey Yekhanin 2005. A Geometric Approach to Information-Theoretic Private Information Retrieval Proceedings of the 20th Annual IEEE Conference on Computational Complexity."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"e_1_3_2_2_51_1","volume-title":"How to Generate and Exchange Secrets","author":"Chi-Chih Yao Andrew","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract) IEEE FOCS."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates EUROCRYPT.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_2_54_1","unstructured":"Samee Zahur Xiaokern 0.16667emWang Marianakern 0.16667emRaykova Adri\u00e0kern 0.16667emGasc\u00f3n Jack Doerner David Evans and Jonathan Katz 2016. Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation IEEE S&P."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133967","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:26Z","timestamp":1750212806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":52,"alternative-id":["10.1145\/3133956.3133967","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3133967","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}