{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:31:30Z","timestamp":1784874690513,"version":"3.55.0"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780103","type":"print"},{"value":"9783031780110","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"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-031-78011-0_4","type":"book-chapter","created":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T19:25:41Z","timestamp":1733081141000},"page":"90-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Brave New World of\u00a0Global Generic Groups and\u00a0UC-Secure Zero-Overhead SNARKs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9704-2124","authenticated-orcid":false,"given":"Jan","family":"Bobolz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2746-3585","authenticated-orcid":false,"given":"Pooya","family":"Farshim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8660-9663","authenticated-orcid":false,"given":"Markulf","family":"Kohlweiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8556-3053","authenticated-orcid":false,"given":"Akira","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-92078-4_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Abdalla","year":"2021","unstructured":"Abdalla, M., Barbosa, M., Katz, J., Loss, J., Xu, J.: Algebraic adversaries in\u00a0the\u00a0universal composability framework. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 311\u2013341. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_11"},{"key":"4_CR2","unstructured":"Abdolmaleki, B., Glaeser, N., Ramacher, S., Slamanig, D.: Universally composable NIZKs: Circuit-succinct, non-malleable and CRS-updatable. Cryptology ePrint Archive, Report 2023\/097 (2023). https:\/\/eprint.iacr.org\/2023\/097"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Abdolmaleki, B., Ramacher, S., Slamanig, D.: Lift-and-shift: obtaining simulation extractable subversion and updatable SNARKs generically. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1987\u20132005. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417228","DOI":"10.1145\/3372297.3417228"},{"key":"4_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. LNCS, vol. 12552, pp. 1\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-64322-8_22","volume-title":"Financial Cryptography and Data Security","author":"K Baghery","year":"2021","unstructured":"Baghery, K., Kohlweiss, M., Siim, J., Volkhov, M.: Another look at extraction and\u00a0randomization of Groth\u2019s zk-SNARK. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12674, pp. 457\u2013475. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64322-8_22"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-92548-2_28","volume-title":"Cryptology and Network Security","author":"K Baghery","year":"2021","unstructured":"Baghery, K., Sedaghat, M.: Tiramisu: black-box simulation extractable NIZKs in\u00a0the\u00a0updatable CRS model. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 531\u2013551. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_28"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/978-3-030-26951-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Bartusek","year":"2019","unstructured":"Bartusek, J., Ma, F., Zhandry, M.: The distinction between fixed and random generators in group-based assumptions. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 801\u2013830. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_27"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Bauer, B., Farshim, P., Harasser, P., Kohlweiss, M.: The uber-knowledge assumption: a bridge to the agm. Cryptology ePrint Archive, Paper 2023\/1601 (2023). https:\/\/eprint.iacr.org\/2023\/1601","DOI":"10.62056\/anr-zoja5"},{"key":"4_CR9","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. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bobolz, J., Farshim, P., Kohlweiss, M., Takahashi, A.: The brave new world of global generic groups and UC-secure zero-overhead SNARKs. Cryptology ePrint Archive, Paper 2024\/818 (2024). https:\/\/eprint.iacr.org\/2024\/818","DOI":"10.1007\/978-3-031-78011-0_4"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"4_CR12","unstructured":"Bowe, S., Gabizon, A.: Making groth\u2019s zk-SNARK simulation extractable in the random oracle model. Cryptology ePrint Archive, Report 2018\/187 (2018). https:\/\/eprint.iacr.org\/2018\/187"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-03332-3_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"C Brzuska","year":"2018","unstructured":"Brzuska, C., Delignat-Lavaud, A., Fournet, C., Kohbrok, K., Kohlweiss, M.: State separation for code-based game-playing proofs. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 222\u2013249. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_9"},{"key":"4_CR14","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. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"4_CR15","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. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"4_CR16","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. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"4_CR17","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":"4_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"4_CR19","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Paper 2000\/067 (2020). https:\/\/eprint.iacr.org\/2000\/067, https:\/\/eprint.iacr.org\/2000\/067"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"4_CR21","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":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_16"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Canetti, R., Sarkar, P., Wang, X.: Triply adaptive UC NIZK. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 466\u2013495. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_16","DOI":"10.1007\/978-3-031-22966-4_16"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On Signatures of Knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_5"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Chen, B., et al.: Rotatable zero knowledge sets - post compromise secure auditable dictionaries with application to key transparency. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13793, pp. 547\u2013580. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_19","DOI":"10.1007\/978-3-031-22969-5_19"},{"key":"4_CR26","unstructured":"Chiesa, A., Fenzi, G.: zksnarks in the rom with unconditional uc-security. Cryptology ePrint Archive, Paper 2024\/724 (2024). https:\/\/eprint.iacr.org\/2024\/724"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-030-26951-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Cohen","year":"2019","unstructured":"Cohen, R., Shelat, A., Wichs, D.: Adaptively secure MPC with sublinear communication complexity. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 30\u201360. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_2"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Cremers, C., Naor, M., Paz, S., Ronen, E.: CHIP and CRISP: Protecting all parties against compromise through identity-binding PAKEs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 668\u2013698. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_23","DOI":"10.1007\/978-3-031-15979-4_23"},{"key":"4_CR31","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":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36178-2_6","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"AW Dent","year":"2002","unstructured":"Dent, A.W.: Adapting the weaknesses of the random oracle model to the generic group model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 100\u2013109. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_6"},{"key":"4_CR33","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_16","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"4_CR34","unstructured":"Faonio, A., Fiore, D., Russo, L.: Real-world universal zksnarks are non-malleable. Cryptology ePrint Archive, Paper 2024\/721 (2024). https:\/\/eprint.iacr.org\/2024\/721"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-34931-7_5","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Faust","year":"2012","unstructured":"Faust, S., Kohlweiss, M., Marson, G.A., Venturi, D.: On the non-malleability of the fiat-shamir transform. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 60\u201379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_5"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"4_CR37","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":"4_CR38","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_11","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-Sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29"},{"key":"4_CR40","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. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"4_CR41","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. LNCS, vol. 10402, pp. 581\u2013612. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20"},{"issue":"3","key":"4_CR42","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00145-013-9160-y","volume":"28","author":"D Hofheinz","year":"2015","unstructured":"Hofheinz, D., Shoup, V.: GNUC: a new universal composability framework. J. Cryptol. 28(3), 423\u2013508 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9160-y","journal-title":"J. Cryptol."},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-17373-8_31","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"T Jager","year":"2010","unstructured":"Jager, T., Rupp, A.: The semi-generic group model and applications to pairing-based cryptography. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 539\u2013556. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_31"},{"key":"4_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13"},{"key":"4_CR45","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":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-84259-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Kerber","year":"2021","unstructured":"Kerber, T., Kiayias, A., Kohlweiss, M.: Composition with knowledge assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 364\u2013393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_13"},{"key":"4_CR47","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_17","DOI":"10.1007\/978-3-031-48621-0_17"},{"key":"4_CR48","unstructured":"Kosba, A., et al.: C$$\\emptyset $$c$$\\emptyset $$: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive, Report 2015\/1093 (2015). https:\/\/eprint.iacr.org\/2015\/1093"},{"key":"4_CR49","doi-asserted-by":"publisher","unstructured":"Kosba, A.E., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy, pp. 839\u2013858. IEEE Computer Society Press (2016). https:\/\/doi.org\/10.1109\/SP.2016.55","DOI":"10.1109\/SP.2016.55"},{"key":"4_CR50","unstructured":"K\u00fcsters, R.: Simulation-based security with inexhaustible interactive Turing machines. Cryptology ePrint Archive, Report 2006\/151 (2006). https:\/\/eprint.iacr.org\/2006\/151"},{"key":"4_CR51","doi-asserted-by":"publisher","unstructured":"Lipmaa, H., Parisella, R., Siim, J.: Algebraic group model with oblivious sampling. In: Rothblum, G.N., Wee, H. (eds.) Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, 29 November\u20132 December 2023, Proceedings, Part IV. LNCS, vol. 14372, pp. 363\u2013392. Springer, Heidelbegr (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_14","DOI":"10.1007\/978-3-031-48624-1_14"},{"key":"4_CR52","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Efficient and universally composable non-interactive zero-knowledge proofs of knowledge with security against adaptive corruptions. Cryptology ePrint Archive, Report 2022\/1484 (2022). https:\/\/eprint.iacr.org\/2022\/1484"},{"key":"4_CR53","doi-asserted-by":"publisher","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Universally composable $$\\varSigma $$-protocols in the global random-oracle model. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 203\u2013233. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_8","DOI":"10.1007\/978-3-031-22318-1_8"},{"key":"4_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14577-3_1","volume-title":"Financial Cryptography and Data Security","author":"U Maurer","year":"2010","unstructured":"Maurer, U.: Constructive Cryptography \u2013 A Primer. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, p. 1. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_1"},{"key":"4_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"10th IMA International Conference on Cryptography and Coding","author":"UM Maurer","year":"2005","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography (invited paper). In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005)"},{"issue":"4","key":"4_CR56","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000). https:\/\/doi.org\/10.1137\/S0097539795284959","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4_CR57","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"VI Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes 55(2), 165\u2013172 (1994)","journal-title":"Math. Notes"},{"key":"4_CR58","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA\u00a02016. LNCS, vol.\u00a09610, pp. 111\u2013126. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"4_CR59","doi-asserted-by":"publisher","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, pp. 543\u2013553. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814628","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"4_CR60","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"4_CR61","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45325-3_8","volume-title":"8th IMA International Conference on Cryptography and Coding","author":"NP Smart","year":"2001","unstructured":"Smart, N.P.: The exact security of ECIES in the generic group model. In: Honary, B. (ed.) 8th IMA International Conference on Cryptography and Coding. LNCS, vol. 2260, pp. 73\u201384. Springer, Heidelberg (2001)"},{"key":"4_CR62","doi-asserted-by":"publisher","unstructured":"Stern, J., Pointcheval, D., Malone-Lee, J., Smart, N.P.: Flaws in applying proof methodologies to signature schemes. In: Yung, M. (ed.) CRYPTO\u00a02002. LNCS, vol.\u00a02442, pp. 93\u2013110. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_7","DOI":"10.1007\/3-540-45708-9_7"},{"key":"4_CR63","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: To label, or not to label (in generic groups). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 66\u201396. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_3","DOI":"10.1007\/978-3-031-15982-4_3"},{"key":"4_CR64","doi-asserted-by":"publisher","unstructured":"Zhang, C., Zhou, H.S., Katz, J.: An analysis of the algebraic group model. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 310\u2013322. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_11","DOI":"10.1007\/978-3-031-22972-5_11"}],"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-78011-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T20:02:52Z","timestamp":1733083372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78011-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"ISBN":["9783031780103","9783031780110"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78011-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}