{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:00:08Z","timestamp":1774454408276,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250794","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":307,"title":["Zero-knowledge from secure multiparty computation"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_24"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100285"},{"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","volume-title":"Proc. COMPCON 1982:  133--137","author":"Blum M.","unstructured":"M. Blum . Coin Flipping by Telephone - A Protocol for Solving Impossible Problems . In Proc. COMPCON 1982: 133--137 . M. Blum. Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. In Proc. COMPCON 1982: 133--137."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227686"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_31"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258635"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706339"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_23"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_30"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . Foundations of Cryptography: Basic Applications . Cambridge University Press , 2004 . O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00208001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"e_1_3_2_1_21_1","first-page":"171","volume-title":"CRYPTO","author":"Goldreich O.","year":"1986","unstructured":"O. Goldreich , S. Micali , and A. Wigderson . How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design . In CRYPTO 1986 , pages 171 -- 185 . O. Goldreich, S. Micali, and A. Wigderson. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In CRYPTO 1986, pages 171--185."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_21"},{"key":"e_1_3_2_1_24_1","unstructured":"I. Haitner and O. Reingold. Statistically-Hiding Commitment from Any One-Way Function. These proceedings.  I. Haitner and O. Reingold. Statistically-Hiding Commitment from Any One-Way Function. These proceedings."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_26_1","first-page":"8","volume-title":"CRYPTO'88","author":"Impagliazzo R.","year":"1988","unstructured":"R. Impagliazzo and S. Rudich . Limits on the Provable Consequences of One-way Permutations . In CRYPTO'88 , Springer-Verlag (LNCS 403), pages 8 -- 26 , 1988 . R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-way Permutations. In CRYPTO'88, Springer-Verlag (LNCS 403), pages 8--26, 1988."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132531"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.74"},{"key":"e_1_3_2_1_29_1","volume-title":"Manuscript","author":"Kalai Y.T.","year":"2007","unstructured":"Y.T. Kalai and R. Raz . Interactive PCP . Manuscript , 2007 . Y.T. Kalai and R. Raz. Interactive PCP. Manuscript, 2007."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptology 11(1)","author":"Kilian J.","year":"1998","unstructured":"J. Kilian and E. Petrank . An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptology 11(1) , pages 1 -- 27 , 1998 . J. Kilian and E. Petrank. An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. J. Cryptology 11(1), pages 1--27, 1998."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652156"},{"key":"e_1_3_2_1_38_1","volume-title":"Aiken Computation Laboratory","author":"Rabin M.","year":"1981","unstructured":"M. Rabin . How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81 , Aiken Computation Laboratory , Harvard U. , 1981 . M. Rabin. How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_40_1","volume-title":"XOR). Math. Notes of the Academy of Science of the USSR, all 41(4):333--338","author":"Razborov A.","year":"1987","unstructured":"A. Razborov . Lower bounds for the size of circuits of bounded depth with basis all(AND , XOR). Math. Notes of the Academy of Science of the USSR, all 41(4):333--338 , 1987 . A. Razborov. Lower bounds for the size of circuits of bounded depth with basis all(AND, XOR). Math. Notes of the Academy of Science of the USSR, all 41(4):333--338, 1987."},{"key":"e_1_3_2_1_41_1","volume-title":"TCC 2004:  1--20","author":"Reingold O.","unstructured":"O. Reingold , L. Trevisan , and S. P. Vadhan . Notions of Reducibility between Cryptographic Primitives . TCC 2004: 1--20 . O. Reingold, L. Trevisan, and S. P. Vadhan. Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1--20."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_11"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250794","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:20Z","timestamp":1750258340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":45,"alternative-id":["10.1145\/1250790.1250794","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250794","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}