{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:35:26Z","timestamp":1783791326104,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"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_5","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"113-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Fiat-Shamir Transformation of\u00a0Multi-round Interactive Proofs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Attema","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"5_CR1","unstructured":"Full version of this paper. IACR ePrint 2021\/1377"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings - limits of schnorr-like arguments over lattices. In: CRYPTO, pp. 519\u2013548 (2021)","DOI":"10.1007\/978-3-030-84245-1_18"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-protocol theory and practical application to plug & play secure algorithmics. In: CRYPTO, pp. 513\u2013543 (2020)","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$\\Sigma $$-protocol theory for lattices. In: CRYPTO, pp. 549\u2013579 (2021)","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, R., Rambaud, M.: Compressed $$\\Sigma $$-protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. In: ASIACRYPT, pp. 526\u2013556 (2021)","DOI":"10.1007\/978-3-030-92068-5_18"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Attema, T., Fehr, S.: Parallel repetition of $$(k_1,\\dots , k_{\\mu })$$-special-sound multi-round interactive proofs. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15802-5_15"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: STOC, pp. 484\u2013493 (2002)","DOI":"10.1145\/509907.509979"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: CCS, pp. 390\u2013399 (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: EUROCRYPT, pp. 103\u2013128 (2019)","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: TCC, pp. 31\u201360 (2016)","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: CRYPTO, pp. 123\u2013152 (2021)","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: EUROCRYPT, pp. 327\u2013357 (2016)","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: A non-PCP approach to succinct quantum-safe zero-knowledge. In: CRYPTO, pp. 441\u2013469 (2020)","DOI":"10.1007\/978-3-030-56880-1_16"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: S &P, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: EUROCRYPT, pp. 677\u2013706 (2020)","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D., Wichs, D.: Fiat-Shamir: from practice to theory. In: STOC, pp. 1082\u20131090. ACM (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct arguments in the quantum random oracle model. In: TCC, pp. 1\u201329 (2019)","DOI":"10.1007\/978-3-030-36033-7_1"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: CRYPTO, pp. 186\u2013194 (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A., Zajac, M.: What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? In: SCN, pp. 735\u2013760 (2022)","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Lyubashevsky, V.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: EUROCRYPT, pp. 458\u2013487 (2022)","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Ghoshal, A., Tessaro, S.: Tight state-restoration soundness in the algebraic group model. In: CRYPTO, pp. 64\u201393 (2021)","DOI":"10.1007\/978-3-030-84252-9_3"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Applications, Vol. 2. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Hoffmann, M., Kloo\u00df, M., Rupp, A.: Efficient zero-knowledge arguments in the discrete log setting, revisited. In: CCS, pp. 2093\u20132110 (2019)","DOI":"10.1145\/3319535.3354251"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Jaeger, J., Tessaro, S.: Expected-time cryptography: generic techniques and applications to concrete soundness. In: TCC, pp. 414\u2013443 (2020)","DOI":"10.1007\/978-3-030-64381-2_15"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: CCS, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Short discrete log proofs for FHE and ring-LWE ciphertexts. In: PKC, pp. 344\u2013373 (2019)","DOI":"10.1007\/978-3-030-17253-4_12"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: EUROCRYPT, pp. 387\u2013398 (1996)","DOI":"10.1007\/3-540-68339-9_33"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: S &P, pp. 926\u2013943 (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"5_CR30","unstructured":"Wikstr\u00f6m, D.: Special soundness revisited. IACR ePrint 2018\/1157 (2018)"},{"key":"5_CR31","unstructured":"Wikstr\u00f6m, D.: Special soundness in the random oracle model. IACR ePrint 2021\/1264 (2021)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:05Z","timestamp":1766278925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5","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"}]}}