{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:21Z","timestamp":1770982701545,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"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":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993651","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"99-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":330,"title":["Separating succinct non-interactive arguments from all falsifiable assumptions"],"prefix":"10.1145","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center, Hawthorne, NY, USA"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[{"name":"New York Unviersity, New York, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646253.686344"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760749.1760759"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875552"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_7"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.67"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_18"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_21"},{"key":"e_1_3_2_2_10_1","first-page":"445","volume-title":"CRYPTO","author":"Damg\u00e5rd Ivan","year":"1991","unstructured":"Ivan Damg\u00e5rd . Towards practical public key systems secure against chosen ciphertext attacks . In CRYPTO , pages 445 -- 456 , 1991 . Ivan Damg\u00e5rd. Towards practical public key systems secure against chosen ciphertext attacks. In CRYPTO, pages 445--456, 1991."},{"key":"e_1_3_2_2_11_1","volume-title":"Manuscript","author":"Dwork Cynthia","year":"2004","unstructured":"Cynthia Dwork , Michael Langberg , Moni Naor , Kobbi Nissim , and Omer Reingold . Succint proofs for NP and spooky interactions . Manuscript , 2004 . Cynthia Dwork, Michael Langberg, Moni Naor, Kobbi Nissim, and Omer Reingold. Succint proofs for NP and spooky interactions. Manuscript, 2004."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_27"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.56"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"key":"e_1_3_2_2_15_1","first-page":"186","volume-title":"CRYPTO","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir . How to prove yourself: Practical solutions to identification and signature problems . In CRYPTO , pages 186 -- 194 , 1986 . Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186--194, 1986."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796557"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875550"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-002-0169-0"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_13"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Satoshi\n      Hada\n     and \n      Toshiaki\n      Tanaka\n    .\n  On the existence of 3-round zero-knowledge protocols\n  . In Hugo Krawczyk editor CRYPTO volume \n  1462\n   of \n  Lecture Notes in Computer Science pages \n  408\n  --\n  423\n  . \n  Springer 1998\n  .   Satoshi Hada and Toshiaki Tanaka. On the existence of 3-round zero-knowledge protocols. In Hugo Krawczyk editor CRYPTO volume 1462 of Lecture Notes in Computer Science pages 408--423. Springer 1998.","DOI":"10.1007\/BFb0055744"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796290"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89518"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.016"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993652"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.38"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0291-3"},{"key":"e_1_3_2_2_35_1","first-page":"11","volume-title":"FOCS","author":"Shamir Adi","year":"1990","unstructured":"Adi Shamir . IP= PSPACE. In FOCS , pages 11 -- 15 , 1990 . Adi Shamir. IP=PSPACE. In FOCS, pages 11--15, 1990."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054137"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448847"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_12"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993651","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":38,"alternative-id":["10.1145\/1993636.1993651","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993651","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}