{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:44:25Z","timestamp":1750308265108,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007395","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"252-261","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Completeness in two-party secure computation"],"prefix":"10.1145","author":[{"given":"Danny","family":"Harnik","sequence":"first","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703968"},{"key":"e_1_3_2_1_2_1","first-page":"547","volume-title":"CRYPTO '89","volume":"435","author":"Bellare M.","year":"1989","unstructured":"M. Bellare and S. Micali . Non-interactive oblivious transfer and applications . In CRYPTO '89 , volume 435 , pages 547 -- 557 . Springer , 1989 .]] M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In CRYPTO '89, volume 435, pages 547--557. Springer, 1989.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404004"},{"key":"e_1_3_2_1_6_1","first-page":"350","volume-title":"CRYPTO '87","volume":"293","author":"Crepeau C.","year":"1987","unstructured":"C. Crepeau . Equivalence between two flavours of oblivious transfers . In CRYPTO '87 , volume 293 , pages 350 -- 354 . Springer-Verlag , 1987 .]] C. Crepeau. Equivalence between two flavours of oblivious transfers. In CRYPTO '87, volume 293, pages 350--354. Springer-Verlag, 1987.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756131"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704145"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796557"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich . Foundations of Cryptography . Cambridge University Press , 2001 .]] O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2001.]]"},{"volume-title":"Foundations of cryptography -","author":"Goldreich O.","key":"e_1_3_2_1_12_1","unstructured":"O. Goldreich . Foundations of cryptography - volume 2 . Working Draft , available at www. wisdom. weizmann. ac. il\/oded\/foc-vol2. html, 2004.]] O. Goldreich. Foundations of cryptography - volume 2. Working Draft, available at www. wisdom. weizmann. ac. il\/oded\/foc-vol2. html, 2004.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_16_1","volume-title":"ECCC (50)","author":"Goldreich O.","year":"1995","unstructured":"O. Goldreich , N. Nisan , and A. Wigderson . On Yao's XOR-lemma . In ECCC (50) , volume 2 , 1995 .]] O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-lemma. In ECCC (50), volume 2, 1995.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"TR03-060","author":"Harnik D.","year":"2003","unstructured":"D. Harnik , M. Naor , O. Reingold , and A. Rosen . Completeness in two-party secure computation - a computational view. ECCC , TR03-060 , 2003 .]] D. Harnik, M. Naor, O. Reingold, and A. Rosen. Completeness in two-party secure computation - a computational view. ECCC, TR03-060, 2003.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/829497.829786"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103475"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335342"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797321742"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405021"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365743"},{"key":"e_1_3_2_1_27_1","first-page":"448","volume-title":"SIAM Symposium on Discrete Algorithms (SODA 2001","author":"Naor M.","year":"2001","unstructured":"M. Naor and B. Pinkas . Efficient oblivious transfer protocols . In SIAM Symposium on Discrete Algorithms (SODA 2001 ), pages 448 -- 457 , 2001 .]] M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SIAM Symposium on Discrete Algorithms (SODA 2001), pages 448--457, 2001.]]"},{"key":"e_1_3_2_1_28_1","first-page":"3","volume-title":"Second Israel Symposium on Theory of Computing Systems, ISTCS 93, Proceedings. IEEE Computer Society","author":"Ostrovsky R.","year":"1993","unstructured":"R. Ostrovsky and A. Wigderson . One-way fuctions are essential for non-trivial zero-knowledge . In Second Israel Symposium on Theory of Computing Systems, ISTCS 93, Proceedings. IEEE Computer Society , pages 3 -- 17 , 1993 .]] R. Ostrovsky and A. Wigderson. One-way fuctions are essential for non-trivial zero-knowledge. In Second Israel Symposium on Theory of Computing Systems, ISTCS 93, Proceedings. IEEE Computer Society, pages 3--17, 1993.]]"},{"key":"e_1_3_2_1_29_1","volume-title":"TR-81","author":"Rabin M. O.","year":"1981","unstructured":"M. O. Rabin . How to exchange secrets by oblivious transfer . TR-81 , Harvard , 1981 .]] M. O. Rabin. How to exchange secrets by oblivious transfer. TR-81, Harvard, 1981.]]"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:55Z","timestamp":1750267435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007395"}},"subtitle":["a computational view"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":31,"alternative-id":["10.1145\/1007352.1007395","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007395","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}