{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:56:02Z","timestamp":1779900962747,"version":"3.53.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22318-1_19","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"526-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fully Succinct Batch Arguments for\u00a0$$\\textsf{NP}$$ from\u00a0Indistinguishability Obfuscation"],"prefix":"10.1007","author":[{"given":"Rachit","family":"Garg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Sheridan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: FOCS, pp. 191\u2013209 (2015)","DOI":"10.1109\/FOCS.2015.21"},{"key":"19_CR3","unstructured":"Eli, B.-S., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. (2018)"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., et al.: The Hunting of the SNARK. J. Cryptology 30(4), 989\u20131066 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9241-9","journal-title":"J. Cryptology"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC, pp. 111\u2013120 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: STOC (2014)","DOI":"10.1145\/2591796.2591859"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: CRYPTO, pp. 1\u201318 (2001)","DOI":"10.1007\/3-540-44647-8_1"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: PKC, pp. 501\u2013519 (2014)","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Lattice-based SNARGs and their application to more efficient obfuscation. In: EUROCRYPT (2017)","DOI":"10.1007\/978-3-319-56617-7_9"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Quasi-optimal snargs via linear multi-prover interactive proofs. In: EUROCRYPT, pp. 222\u2013255 (2018)","DOI":"10.1007\/978-3-319-78372-7_8"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: ASIACRYPT, pp. 280\u2013300 (2013)","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.P.: Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: CRYPTO, pp. 394\u2013423 (2021)","DOI":"10.1007\/978-3-030-84259-8_14"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Snargs for $$\\cal{P}$$ from LWE. In: FOCS, pp. 68\u201379 (2021)","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Post-quantum and transparent recursive proofs from holography. In: EUROCRYPT, Fractal (2020)","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Faust, S., Hazay, C.: Secure two-party computation with low communication. In: TCC (2012)","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. IACR Cryptol. ePrint Arch. (2022)","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: ASIACRYPT (2010)","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: EUROCRYPT (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99\u2013108 (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Hub\u00e1cek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: ITCS, pp. 163\u2013172 (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over f_p, dlin, and prgs in nc$${\\hat{\\,}}$$0. In: EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: STOC, pp. 419\u2013428 (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, S., Zacharias, T.: Delegatable pseudorandom functions and applications. In: ACM CCS, pp. 669\u2013684 (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: ASIACRYPT (2013)","DOI":"10.1007\/978-3-642-42033-7_3"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: CRYPTO, pp. 369\u2013378 (1987)","DOI":"10.1007\/3-540-48184-2_32"},{"key":"19_CR31","unstructured":"Micali, S.: Computationally-sound proofs. In: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic (1995)"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: CRYPTO (2003)","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: ASIACRYPT, pp. 121\u2013145 (2015)","DOI":"10.1007\/978-3-662-48797-6_6"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Nearly practical verifiable computation. In: IEEE Symposium on Security and Privacy, Pinocchio (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Setty, S.T.V.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22318-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:01:52Z","timestamp":1766278912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}