{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T13:29:54Z","timestamp":1778160594405,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["240258"],"award-info":[{"award-number":["240258"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090263","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"326-349","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":354,"title":["From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again"],"prefix":"10.1145","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"Tel Aviv University"}]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[{"name":"Boston University, Tel Aviv University"}]},{"given":"Alessandro","family":"Chiesa","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[{"name":"Tel Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760749.1760759"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646253.686344"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880936"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709244"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.27"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033046"},{"key":"e_1_3_2_1_11_1","first-page":"11","volume-title":"Proceedings of the 18th Annual International Cryptology Conference","author":"Blum M.","year":"1981","unstructured":"M. Blum . Coin flipping by telephone . In Proceedings of the 18th Annual International Cryptology Conference , pages 11 -- 15 , 1981 . M. Blum. Coin flipping by telephone. In Proceedings of the 18th Annual International Cryptology Conference, pages 11--15, 1981."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_1_16_1","first-page":"353","volume-title":"Proceedings of the 2nd Symposium on Innovations in Computer Science","author":"Braverman M.","year":"2011","unstructured":"M. Braverman , A. Hassidim , and Y. T. Kalai . Leaky pseudo-entropy functions . In Proceedings of the 2nd Symposium on Innovations in Computer Science , pages 353 -- 366 , 2011 . M. Braverman, A. Hassidim, and Y. T. Kalai. Leaky pseudo-entropy functions. In Proceedings of the 2nd Symposium on Innovations in Computer Science, pages 353--366, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756163"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_37"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_35"},{"key":"e_1_3_2_1_21_1","first-page":"310","volume-title":"Proceedings of the 1st Symposium on Innovations in Computer Science","author":"Chiesa A.","year":"2010","unstructured":"A. Chiesa and E. Tromer . Proof-carrying data and hearsay arguments from signature cards . In Proceedings of the 1st Symposium on Innovations in Computer Science , pages 310 -- 331 , 2010 . A. Chiesa and E. Tromer. Proof-carrying data and hearsay arguments from signature cards. In Proceedings of the 1st Symposium on Innovations in Computer Science, pages 310--331, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646756.759582"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11792086_31"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_21"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3088723.3088762"},{"key":"e_1_3_2_1_30_1","volume-title":"December","author":"Dwork C.","year":"2004","unstructured":"C. Dwork , M. Langberg , M. Naor , K. Nissim , and O. Reingold . Succinct NP proofs and spooky interactions , December 2004 . Available at www.openu.ac.il\/home\/mikel\/papers\/spooky.ps. C. Dwork, M. Langberg, M. Naor, K. Nissim, and O. Reingold. Succinct NP proofs and spooky interactions, December 2004. Available at www.openu.ac.il\/home\/mikel\/papers\/spooky.ps."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.56"},{"key":"e_1_3_2_1_32_1","first-page":"186","volume-title":"Proceedings of the 6th Annual International Cryptology Conference","author":"Fiat A.","year":"1987","unstructured":"A. Fiat and A. Shamir . How to prove yourself: practical solutions to identification and signature problems . In Proceedings of the 6th Annual International Cryptology Conference , pages 186 -- 194 , 1987 . A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Proceedings of the 6th Annual International Cryptology Conference, pages 186--194, 1987."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788417"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1894302.1894327"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_39_1","volume-title":"Collision-free hashing from lattice problems. Technical report","author":"Goldreich O.","year":"1996","unstructured":"O. Goldreich , S. Goldwasser , and S. Halevi . Collision-free hashing from lattice problems. Technical report , 1996 . ECCC TR 95--042. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. Technical report, 1996. ECCC TR95--042."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-002-0169-0"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706338"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_20"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.74"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_9"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_34"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/646754.705190"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.016"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02113297"},{"issue":"4","key":"e_1_3_2_1_59_1","first-page":"481","article-title":"Key distribution system based on identification information. Selected Areas in Communications","volume":"7","author":"Okamoto E.","year":"1989","unstructured":"E. Okamoto and K. Tanaka . Key distribution system based on identification information. Selected Areas in Communications , IEEE Journal on , 7 ( 4 ): 481 -- 485 , May 1989 . E. Okamoto and K. Tanaka. Key distribution system based on identification information. Selected Areas in Communications, IEEE Journal on, 7(4):481--485, May 1989.","journal-title":"IEEE Journal on"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_7"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780603"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039490"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.38"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754542.1754568"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802616"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_12"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts","acronym":"ITCS '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":62,"alternative-id":["10.1145\/2090236.2090263","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090263","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}