{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:59:17Z","timestamp":1781078357494,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488623","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"111-120","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":214,"title":["Recursive composition and bootstrapping for SNARKS and proof-carrying data"],"prefix":"10.1145","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[{"name":"Boston University and Tel Aviv University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessandro","family":"Chiesa","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eran","family":"Tromer","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICALP '00","author":"Aiello W.","unstructured":"W. Aiello , S. N. Bhatt , R. Ostrovsky , and S. Rajagopalan . Fast verification of any remote procedure call . ICALP '00 . W. Aiello, S. N. Bhatt, R. Ostrovsky, and S. Rajagopalan. Fast verification of any remote procedure call. ICALP '00."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709244"},{"key":"e_1_3_2_1_4_1","volume-title":"CRYPTO '04","author":"Bellare M.","unstructured":"M. Bellare and A. Palacio . The knowledge-of-exponent assumptions and 3-round zk protocols . CRYPTO '04 . M. Bellare and A. Palacio. The knowledge-of-exponent assumptions and 3-round zk protocols. CRYPTO '04."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_9_1","volume-title":"CRYPTO '12","author":"Bitansky N.","unstructured":"N. Bitansky and A. Chiesa . Succinct arguments from mips and their efficiency benefits . CRYPTO '12 . N. Bitansky and A. Chiesa. Succinct arguments from mips and their efficiency benefits. CRYPTO '12."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185352"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090264"},{"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.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_1_15_1","volume-title":"ICS '10","author":"Chiesa A.","unstructured":"A. Chiesa and E. Tromer . Proof-carrying data and hearsay arguments from signature cards . ICS '10 . A. Chiesa and E. Tromer. Proof-carrying data and hearsay arguments from signature cards. ICS '10."},{"key":"e_1_3_2_1_16_1","volume-title":"Proof-carrying data: Secure computation on untrusted platforms. The Next Wave: The NSA's review of emerging technologies","author":"Chiesa A.","year":"2012","unstructured":"A. Chiesa and E. Tromer . Proof-carrying data: Secure computation on untrusted platforms. The Next Wave: The NSA's review of emerging technologies , 2012 . A. Chiesa and E. Tromer. Proof-carrying data: Secure computation on untrusted platforms. The Next Wave: The NSA's review of emerging technologies, 2012."},{"key":"e_1_3_2_1_17_1","volume-title":"CRYPTO '92","author":"Damg\u00e5rd I.","unstructured":"I. Damg\u00e5rd . Towards practical public key systems secure against chosen ciphertext attacks . CRYPTO '92 . I. Damg\u00e5rd. Towards practical public key systems secure against chosen ciphertext attacks. CRYPTO '92."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_21"},{"key":"e_1_3_2_1_20_1","volume-title":"Succinct NP proofs and spooky interactions","author":"Dwork C.","year":"2004","unstructured":"C. Dwork , M. Langberg , M. Naor , K. Nissim , and O. Reingold . Succinct NP proofs and spooky interactions , 2004 . C. Dwork, M. Langberg, M. Naor, K. Nissim, and O. Reingold. Succinct NP proofs and spooky interactions, 2004."},{"key":"e_1_3_2_1_21_1","volume-title":"CRYPTO '87","author":"Fiat A.","unstructured":"A. Fiat and A. Shamir . How to prove yourself . CRYPTO '87 . A. Fiat and A. Shamir. How to prove yourself. CRYPTO '87."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00116-1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-002-0169-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_31_1","volume-title":"ASIACRYPT '10","author":"Groth J.","unstructured":"J. Groth . Short pairing-based non-interactive zero-knowledge arguments . ASIACRYPT '10 . J. Groth. Short pairing-based non-interactive zero-knowledge arguments. ASIACRYPT '10."},{"key":"e_1_3_2_1_32_1","volume-title":"Probabilistic lower bounds for byzantine agreement. Unpublished manuscript","author":"Karlin A. R.","year":"1986","unstructured":"A. R. Karlin and A. C. Yao . Probabilistic lower bounds for byzantine agreement. Unpublished manuscript , 1986 . A. R. Karlin and A. C. Yao. Probabilistic lower bounds for byzantine agreement. Unpublished manuscript, 1986."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.016"},{"key":"e_1_3_2_1_37_1","volume-title":"CRYPTO '03","author":"Naor M.","unstructured":"M. Naor . On cryptographic assumptions and challenges . CRYPTO '03 . M. Naor. On cryptographic assumptions and challenges. CRYPTO '03."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.40"},{"key":"e_1_3_2_1_39_1","volume-title":"TCC '08","author":"Valiant P.","unstructured":"P. Valiant . Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency . TCC '08 . P. Valiant. Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. TCC '08."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_12"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":38,"alternative-id":["10.1145\/2488608.2488623","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488623","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}