{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:22:43Z","timestamp":1785954163988,"version":"3.56.0"},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/sp.2016.21","type":"proceedings-article","created":{"date-parts":[[2016,8,18]],"date-time":"2016-08-18T20:34:03Z","timestamp":1471552443000},"page":"218-234","source":"Crossref","is-referenced-by-count":81,"title":["Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation"],"prefix":"10.1109","author":[{"given":"Samee","family":"Zahur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adria","family":"Gascon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Doerner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Evans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.40"},{"key":"ref38","article-title":"How to Generate and Exchange Secrets (Extended Abstract)","author":"yao","year":"1986","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"ref32","article-title":"Path ORAM: An Extremely Simple Oblivious RAM Protocol","author":"emil","year":"2013","journal-title":"ACM Conference on Computer and Communications Security"},{"key":"ref31","article-title":"Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits","author":"songhori","year":"2015","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382229"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"ref35","article-title":"Secure Computation of MIPS Machine Code","author":"wang","year":"2015","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28166-7_9"},{"key":"ref40","article-title":"Obliv-C: A Lightweight Compiler for Data-Oblivious Computation","author":"zahur","year":"2015","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref11","article-title":"How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority","author":"goldreich","year":"1987","journal-title":"ACM Symposium on the Theory of Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"ref16","article-title":"Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?","author":"huang","year":"2012","journal-title":"Symposium on Network and Distributed System Security"},{"key":"ref17","article-title":"Faster Secure Two-Party Computation using Garbled Circuits","author":"huang","year":"2011","journal-title":"USENIX Security Symposium"},{"key":"ref18","article-title":"Efficient, Oblivious Data Structures for MPC","author":"marcel","year":"2014","journal-title":"ASIACRYPT"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","article-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","author":"kolesnikov","year":"2009","journal-title":"Cryptology and Network Security"},{"key":"ref28","article-title":"Oblivious RAM Revisited","author":"benny","year":"2010","journal-title":"CRYPTO 2010"},{"key":"ref4","article-title":"Practicing Oblivious Access on Cloud Storage: the Gap, the Fallacy, and the New Way Forward","author":"bindschaedler","year":"2015","journal-title":"ACM Conference on Computer and Communications Security"},{"key":"ref27","article-title":"Stronger key derivation via sequential memory-hard functions","author":"colin","year":"2009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"ref29","article-title":"Secure Two-Party Computation Is Practical","author":"benny","year":"2009","journal-title":"ASIACRYPT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/2312726"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_16"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref9","article-title":"Optimizing ORAM and Using it Efficiently for Secure Computation","author":"craig","year":"2013","journal-title":"Privacy Enhancing Technologies"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_27"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-70583-3_40","article-title":"Improved Garbled Circuit: Free XOR Gates and Applications","author":"kolesnikov","year":"2008","journal-title":"Automata Languages and Programming"},{"key":"ref22","year":"2015","journal-title":"Litecoin Project"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.13"},{"key":"ref24","article-title":"ObliVM: A Programming Framework for Secure Computation","author":"liu","year":"2015","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"ref41","article-title":"Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates","author":"zahur","year":"2015","journal-title":"Eurocrypt"},{"key":"ref23","article-title":"Automating Efficient RA M-Model Secure Computation","author":"liu","year":"2014","journal-title":"IEEE Symposium on Security and Privacy"},{"key":"ref26","article-title":"Fairplay - a Secure Two-Party Computation System","author":"malkhi","year":"2004","journal-title":"USENIX Security Symposium"},{"key":"ref25","article-title":"Distributed Oblivious RAM for Secure Two-Party Computation","author":"steve","year":"2013","journal-title":"Theory of Cryptography Conference"}],"event":{"name":"2016 IEEE Symposium on Security and Privacy (SP)","location":"San Jose, CA","start":{"date-parts":[[2016,5,22]]},"end":{"date-parts":[[2016,5,26]]}},"container-title":["2016 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/7528194\/7546461\/07546504.pdf?arnumber=7546504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T17:54:27Z","timestamp":1568310867000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/7546504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":41,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/sp.2016.21","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}