{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:59Z","timestamp":1778128199459,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,16]]},"DOI":"10.1145\/2382196.2382251","type":"proceedings-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T17:13:12Z","timestamp":1350321192000},"page":"513-524","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":123,"title":["Secure two-party computation in sublinear (amortized) time"],"prefix":"10.1145","author":[{"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[{"name":"Applied Communication Sciences, Piscataway, USA"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[{"name":"Bell Labs, New Jersey, NJ, USA"}]},{"given":"Fernando","family":"Krell","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Yevgeniy","family":"Vahlis","sequence":"additional","affiliation":[{"name":"AT&T, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology -- Crypto '95","author":"Beaver D.","year":"1995","unstructured":"D. Beaver . Precomputing oblivious transfer . In Advances in Cryptology -- Crypto '95 , volume 963 of LNCS , pages 97 -- 109 . Springer , 1995 . D. Beaver. Precomputing oblivious transfer. In Advances in Cryptology -- Crypto '95, volume 963 of LNCS, pages 97--109. Springer, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987274"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography. Volume I: Basic Tools","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . Foundations of Cryptography. Volume I: Basic Tools . Cambridge University Press , 2001 . O. Goldreich. Foundations of Cryptography. Volume I: Basic Tools. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"38th Intl. Colloquium on Automata, Languages, and Programming (ICALP), Part II","author":"Goodrich M. T.","year":"2011","unstructured":"M. T. Goodrich and M. Mitzenmacher . Privacy-preserving access of outsourced data via oblivious RAM simulation . In 38th Intl. Colloquium on Automata, Languages, and Programming (ICALP), Part II , volume 6756 of LNCS , pages 576 -- 587 . Springer , 2011 . M. T. Goodrich and M. Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation. In 38th Intl. Colloquium on Automata, Languages, and Programming (ICALP), Part II, volume 6756 of LNCS, pages 576--587. Springer, 2011."},{"key":"e_1_3_2_1_9_1","first-page":"157","volume-title":"22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Goodrich M. T.","year":"2011","unstructured":"M. T. Goodrich , M. Mitzenmacher , O. Ohrimenko , and R. Tamassia . Privacy-preserving group data access via stateless oblivious RAM simulation . In 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 157 -- 167 . ACM-SIAM, 2011 . M. T. Goodrich, M. Mitzenmacher, O. Ohrimenko, and R. Tamassia. Privacy-preserving group data access via stateless oblivious RAM simulation. In 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 157--167. ACM-SIAM, 2011."},{"key":"e_1_3_2_1_10_1","volume-title":"20th USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , D. Evans , J. Katz , and L. Malka . Faster secure two-party computation using garbled circuits . In 20th USENIX Security Symposium , 2011 . Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In 20th USENIX Security Symposium, 2011."},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"145","volume-title":"Advances in Cryptology -- Crypto","author":"Ishai Y.","year":"2003","unstructured":"Y. Ishai , J. Kilian , K. Nissim , and E. Petrank . Extending oblivious transfers efficiently . In Advances in Cryptology -- Crypto 2003 , volume 2729 of LNCS , pages 145 -- 161 . Springer , 2003. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In Advances in Cryptology -- Crypto 2003, volume 2729 of LNCS, pages 145--161. Springer, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095129"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"L. Malka and J. Katz. VMCrypt -- modular software architecture for scalable secure computation. Available at http:\/\/eprint.iacr.org\/2010\/584. L. Malka and J. Katz. VMCrypt -- modular software architecture for scalable secure computation. Available at http:\/\/eprint.iacr.org\/2010\/584.","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_16_1","first-page":"448","volume-title":"12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Naor M.","year":"2001","unstructured":"M. Naor and B. Pinkas . Efficient oblivious transfer protocols . In 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 448 -- 457 . ACM-SIAM, 2001 . M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 448--457. ACM-SIAM, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258606"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"502","volume-title":"Advances in Cryptology -- Crypto","author":"Pinkas B.","year":"2010","unstructured":"B. Pinkas and T. Reinman . Oblivious RAM revisited . In Advances in Cryptology -- Crypto 2010 , volume 6223 of LNCS , pages 502 -- 519 . Springer , 2010. B. Pinkas and T. Reinman. Oblivious RAM revisited. In Advances in Cryptology -- Crypto 2010, volume 6223 of LNCS, pages 502--519. Springer, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_3_2_1_20_1","volume-title":"Towards practical oblivious RAM","author":"Stefanov E.","year":"2012","unstructured":"E. Stefanov , E. Shi , and D. Song . Towards practical oblivious RAM . In NDSS. The Internet Society , 2012 . E. Stefanov, E. Shi, and D. Song. Towards practical oblivious RAM. In NDSS. The Internet Society, 2012."},{"key":"e_1_3_2_1_21_1","volume-title":"Usable PIR","author":"Williams P.","year":"2008","unstructured":"P. Williams and R. Sion . Usable PIR . In NDSS. The Internet Society , 2008 . P. Williams and R. Sion. Usable PIR. In NDSS. The Internet Society, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455790"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS'12: the ACM Conference on Computer and Communications Security","location":"Raleigh North Carolina USA","acronym":"CCS'12","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2012 ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2382196.2382251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:48Z","timestamp":1750239288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382196.2382251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":23,"alternative-id":["10.1145\/2382196.2382251","10.1145\/2382196"],"URL":"https:\/\/doi.org\/10.1145\/2382196.2382251","relation":{},"subject":[],"published":{"date-parts":[[2012,10,16]]},"assertion":[{"value":"2012-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}