{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:50:42Z","timestamp":1755795042296,"version":"3.44.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019066"},{"type":"electronic","value":"9783032019073"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_8","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:32Z","timestamp":1755383252000},"page":"225-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universally Composable SNARKs with\u00a0Transparent Setup without Programmable Random Oracle"],"prefix":"10.1007","author":[{"given":"Christian","family":"Badertscher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Campanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Ciampi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Russo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Arun, A., Ganesh, C., Lokam, S.V., Mopuri, T., Sridhar, S.: Dew: a transparent constant-sized polynomial commitment scheme. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0II. LNCS, vol. 13941, pp. 542\u2013571. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_19","DOI":"10.1007\/978-3-031-31371-4_19"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-56877-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-protocol theory and\u00a0practical application\u00a0to\u00a0plug\u00a0 &\u00a0play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 513\u2013543. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18"},{"key":"8_CR3","unstructured":"Badertscher, C., Campanelli, M., Ciampi, M., Russo, L., Siniscalchi, L.: Universally composable SNARKs with transparent setup without programmable random oracle. Cryptology ePrint Archive, Report 2024\/1549 (2024). https:\/\/eprint.iacr.org\/2024\/1549"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64381-2_1","volume-title":"Theory of Cryptography","author":"C Badertscher","year":"2020","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: capturing global setup within plain UC. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 1\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-030-90453-1_22","volume-title":"Theory of Cryptography","author":"C Badertscher","year":"2021","unstructured":"Badertscher, C., Hesse, J., Zikas, V.: On the (ir)replaceability of global setups, or how (not) to use a global ledger. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 626\u2013657. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_22"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/978-3-662-53890-6_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"F Baldimtsi","year":"2016","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Indistinguishable proofs of work or knowledge. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 902\u2013933. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_30"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th ACM STOC, pp. 103\u2013112. ACM Press (1988). https:\/\/doi.org\/10.1145\/62212.62222","DOI":"10.1145\/62212.62222"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Bobolz, J., Farshim, P., Kohlweiss, M., Takahashi, A.: The brave new world of global generic groups and UC-secure zero-overhead SNARKs. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024, Part\u00a0I. LNCS, vol. 15364, pp. 90\u2013124. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78011-0_4","DOI":"10.1007\/978-3-031-78011-0_4"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-56620-7_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"B Broadnax","year":"2017","unstructured":"Broadnax, B., D\u00f6ttling, N., Hartung, G., M\u00fcller-Quade, J., Nagel, M.: Concurrently composable security with shielded super-polynomial simulators. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 351\u2013381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_13"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-78381-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Camenisch","year":"2018","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part I. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92078-4_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Campanelli","year":"2021","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a\u00a0toolbox for\u00a0more efficient universal and\u00a0updatable zkSNARKs and\u00a0commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Faonio, A., Russo, L.: SNARKs for virtual machines are non-malleable. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0IV. LNCS, vol. 15604, pp. 153\u2013183. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_6","DOI":"10.1007\/978-3-031-91134-7_6"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Hall-Andersen, M.: Veksel: simple, efficient, anonymous payments with large anonymity sets from well-studied assumptions. In: Suga, Y., Sakurai, K., Ding, X., Sako, K. (eds.) ASIACCS 22, pp. 652\u2013666. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3517424","DOI":"10.1145\/3488932.3517424"},{"key":"8_CR17","unstructured":"Campanelli, M., Hall-Andersen, M., Kamp, S.H.: Curve trees: practical and transparent $$\\{$$Zero-Knowledge$$\\}$$ accumulators. In: 32nd USENIX Security Symposium (USENIX Security 2023), pp. 4391\u20134408 (2023)"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Canetti, R., Jain, A., Scafuro, A.: Practical UC security with a global random oracle. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 597\u2013608. ACM Press (2014). https:\/\/doi.org\/10.1145\/2660267.2660374","DOI":"10.1145\/2660267.2660374"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: 51st FOCS, pp. 541\u2013550. IEEE Computer Society Press (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.86","DOI":"10.1109\/FOCS.2010.86"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Fenzi, G.: zkSNARKs in the ROM with unconditional UC-security. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024, Part\u00a0I. LNCS, vol. 15364, pp. 67\u201389. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78011-0_3","DOI":"10.1007\/978-3-031-78011-0_3"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Visconti, I.: Efficient NIZK arguments with straight-line simulation and extraction. In: Beresford, A.R., Patra, A., Bellini, E. (eds.) CANS 22. LNCS, vol. 13641, pp. 3\u201322. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20974-1_1","DOI":"10.1007\/978-3-031-20974-1_1"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Dao, Q., Grubbs, P.: Spartan and bulletproofs are simulation-extractable (for free!). In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 531\u2013562. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_18","DOI":"10.1007\/978-3-031-30617-4_18"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"A De Santis","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566\u2013598. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-17373-8_35","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y Dodis","year":"2010","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 613\u2013631. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_35"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zkSNARKs. In: Rothblum, G.N., Wee, H. (eds.) TCC\u00a02023, Part\u00a0III. LNCS, vol. 14371, pp. 455\u2013485. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_16","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Faonio, A., Fiore, D., Russo, L.: Real-world universal zkSNARKs are non-malleable. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024, pp. 3138\u20133151. ACM Press (2024). https:\/\/doi.org\/10.1145\/3658644.3690351","DOI":"10.1145\/3658644.3690351"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"8_CR30","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A., Zajac, M.: What makes fiat-shamir zkSNARKs (updatable SRS) simulation extractable? In: Galdi, C., Jarecki, S. (eds.) SCN 22. LNCS, vol. 13409, pp. 735\u2013760. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_32","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Kondi, Y., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Witness-succinct universally-composable SNARKs. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 315\u2013346. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_11","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994). https:\/\/doi.org\/10.1007\/BF00195207","journal-title":"J. Cryptol."},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304. ACM Press (1985). https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-319-63715-0_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Groth","year":"2017","unstructured":"Groth, J., Maller, M.: Snarky signatures: minimal signatures of knowledge from simulation-extractable SNARKs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 581\u2013612. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20"},{"key":"8_CR38","doi-asserted-by":"publisher","unstructured":"Gupta, A., Kerr, S., Kirkpatrick, M.S., Bertino, E.: Marlin: making it harder to fish for gadgets. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 1016\u20131018. ACM Press (2012). https:\/\/doi.org\/10.1145\/2382196.2382310","DOI":"10.1145\/2382196.2382310"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"Kohlweiss, M., Pancholi, M., Takahashi, A.: How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach. In: Rothblum, G.N., Wee, H. (eds.) TCC\u00a02023, Part\u00a0III. LNCS, vol. 14371, pp. 486\u2013512. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_17","DOI":"10.1007\/978-3-031-48621-0_17"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90453-1_1","volume-title":"Theory of Cryptography","author":"J Lee","year":"2021","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th FOCS, pp. 436\u2013453. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"8_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 316\u2013337. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_19"},{"key":"8_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_10"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Babai, L. (ed.) 36th ACM STOC, pp. 232\u2013241. ACM Press (2004). https:\/\/doi.org\/10.1145\/1007352.1007393","DOI":"10.1145\/1007352.1007393"},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: Babai, L. (ed.) 36th ACM STOC, pp. 242\u2013251. ACM Press (2004). https:\/\/doi.org\/10.1145\/1007352.1007394","DOI":"10.1145\/1007352.1007394"},{"key":"8_CR47","unstructured":"Seres, I.A., Burcsi, P.: Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time. Cryptology ePrint Archive, Report 2023\/670 (2023). https:\/\/eprint.iacr.org\/2023\/670"},{"key":"8_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"8_CR49","unstructured":"Swihart, J.: Zcash counterfeiting vulnerability successfully remediated (2019)"},{"key":"8_CR50","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Tzialla, I., shelat, a., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE Symposium on Security and Privacy, pp. 926\u2013943. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"8_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-10366-7_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"H Wee","year":"2009","unstructured":"Wee, H.: Zero knowledge in the random oracle model, revisited. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 417\u2013434. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_25"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:34Z","timestamp":1755383254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}