{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:55:50Z","timestamp":1764132950318,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100004284","name":"Xerox","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004284","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Teradata Research Award"},{"name":"B. John Garrick Foundation Award"},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"],"award-info":[{"award-number":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2008411"],"award-info":[{"award-number":["2008411"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N00014-11-1-0392"],"award-info":[{"award-number":["N00014-11-1-0392"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004399","name":"Okawa Foundation for Information and Telecommunications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"],"award-info":[{"award-number":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004317","name":"Lockheed Martin Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004317","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"],"award-info":[{"award-number":["CCF-0916574, IIS-1065276, CCF-1016540, CNS-1118126, CNS-1136174"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591879","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"515-524","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Black-box non-black-box zero knowledge"],"prefix":"10.1145","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"UCLA"}]},{"given":"Alessandra","family":"Scafuro","sequence":"additional","affiliation":[{"name":"UCLA"}]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[{"name":"University of Salerno"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. (ECCC)","author":"Asharov G.","year":"2011","unstructured":"G. Asharov and Y. Lindell . A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. (ECCC) , 2011 . G. Asharov and Y. Lindell. A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. (ECCC), 2011."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875552"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709244"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488639"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_23"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.15"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_9"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488638"},{"key":"e_1_3_2_2_14_1","volume-title":"CRYPTO","author":"Damgaard I.","year":"1991","unstructured":"I. Damgaard . Towards practical public key systems secure against chosen ciphertext attacks . In CRYPTO , 1991 . I. Damgaard. Towards practical public key systems secure against chosen ciphertext attacks. In CRYPTO, 1991."},{"key":"e_1_3_2_2_15_1","volume-title":"CRYPTO","author":"Fiat A.","year":"1986","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In CRYPTO , 1986 . A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, 1986."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380853"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993729"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.47"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802646"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9066-x"},{"key":"e_1_3_2_2_21_1","volume-title":"TCC","author":"Kiyoshima S.","year":"2014","unstructured":"S. Kiyoshima , Y. Manabe and Tatsuaki Okamoto Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol . In TCC , 2014 . S. Kiyoshima, Y. Manabe and Tatsuaki Okamoto Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. In TCC, 2014."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132531"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_27"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_30_1","volume-title":"Cryptology","author":"Naor M.","year":"1991","unstructured":"M. Naor . Bit commitment using pseudorandomness. J . Cryptology , 1991 . M. Naor. Bit commitment using pseudorandomness. J. Cryptology, 1991."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73011"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_31"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/060661880"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_24"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.87"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987304"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York","acronym":"STOC '14"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591879","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":38,"alternative-id":["10.1145\/2591796.2591879","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591879","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}