{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:22:52Z","timestamp":1780352572752,"version":"3.54.1"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911330","type":"print"},{"value":"9783031911347","type":"electronic"}],"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-031-91134-7_7","type":"book-chapter","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:28Z","timestamp":1745665468000},"page":"184-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Malleable SNARKs and\u00a0Their Applications"],"prefix":"10.1007","author":[{"given":"Suvradip","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Hofheinz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4083-8073","authenticated-orcid":false,"given":"Roman","family":"Langrehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4724-8022","authenticated-orcid":false,"given":"Christoph","family":"Striecks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2379-8564","authenticated-orcid":false,"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,27]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Akavia, A., Gentry, C., Halevi, S., Vald, M.: Achievable CCA2 relaxation for homomorphic encryption. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 70\u201399. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_3","DOI":"10.1007\/978-3-031-22365-5_3"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-319-56614-6_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Ananth","year":"2017","unstructured":"Ananth, P., Cohen, A., Jain, A.: Cryptography with updates. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 445\u2013472. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_15"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-78524-8_20","volume-title":"Theory of Cryptography","author":"M Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and noninteractive anonymous credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 356\u2013374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_20"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216\u2013233. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_22"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/0-387-34805-0_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"M Bellare","year":"1990","unstructured":"Bellare, M., Goldwasser, S.: New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 194\u2013211. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_19"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The Hunting of the SNARK. J. Cryptology 30(4), 989\u20131066 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9241-9","journal-title":"J. Cryptology"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 111\u2013120. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 505\u2013514. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591859","DOI":"10.1145\/2591796.2591859"},{"key":"7_CR9","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":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-030-64840-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Boneh","year":"2020","unstructured":"Boneh, D., Eskandarian, S., Kim, S., Shih, M.: Improving speed and security in updatable encryption schemes. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 559\u2013589. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_19"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., Segev, G., Waters, B.: Targeted malleability: homomorphic encryption for restricted computations. In: Goldwasser, S. (ed.) ITCS 2012, pp. 350\u2013366. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090264","DOI":"10.1145\/2090236.2090264"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-56784-2_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Boyd","year":"2020","unstructured":"Boyd, C., Davies, G.T., Gj\u00f8steen, K., Jiang, Y.: Fast and secure updatable encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 464\u2013493. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_16"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-540-45146-4_33","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565\u2013582. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_33"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-56880-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Chakraborty","year":"2020","unstructured":"Chakraborty, S., Dziembowski, S., Nielsen, J.B.: Reverse\u00a0firewalls\u00a0for\u00a0actively\u00a0secure\u00a0MPCs. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 732\u2013762. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_26"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-92075-3_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Chakraborty","year":"2021","unstructured":"Chakraborty, S., Ganesh, C., Pancholi, M., Sarkar, P.: Reverse firewalls for adaptively secure MPC without setup. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part II. LNCS, vol. 13091, pp. 335\u2013364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_12"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Ganesh, C., Sarkar, P.: Reverse firewalls for oblivious transfer extension and applications to zero-knowledge. In: Hazay, C., Stam, M. (ed.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 239\u2013270. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_9","DOI":"10.1007\/978-3-031-30545-0_9"},{"key":"7_CR19","unstructured":"Chakraborty, S., Magliocco, L., Magri, B., Venturi, D.: Key exchange in the post-snowden era: UC secure subversion-resilient PAKE. Cryptology ePrint Archive, Paper 2023\/1827 (to appear at Asiacrypt 2024). https:\/\/eprint.iacr.org\/2023\/1827 (2024). https:\/\/eprint.iacr.org\/2023\/1827"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Magri, B., Nielsen, J.B., Venturi, D.: Universally composable subversion-resilient cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 272\u2013302. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_10","DOI":"10.1007\/978-3-031-06944-4_10"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-29011-4_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Chase","year":"2012","unstructured":"Chase, M., Kohlweiss, M., Lysyanskaya, A., Meiklejohn, S.: Malleable proof systems and applications. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 281\u2013300. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_18"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-36594-2_6","volume-title":"Theory of Cryptography","author":"M Chase","year":"2013","unstructured":"Chase, M., Kohlweiss, M., Lysyanskaya, A., Meiklejohn, S.: Succinct malleable NIZKs and an application to compact shuffles. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 100\u2013119. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_6"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Chen, H., Galteland, Y.J., Liang, K.: CCA-1 secure updatable encryption with adaptive security. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part V. LNCS, vol. 14442, pp. 374\u2013406. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_12","DOI":"10.1007\/978-981-99-8733-7_12"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-030-64840-4_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L Chen","year":"2020","unstructured":"Chen, L., Li, Y., Tang, Q.: CCA updatable encryption against malicious re-encryption attacks. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 590\u2013620. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_20"},{"key":"7_CR25","unstructured":"Cheng, J., Goyal, R.: Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge. Cryptology ePrint Archive, Report 2024\/1603 (2024). https:\/\/eprint.iacr.org\/2024\/1603"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"R Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103\u2013118. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_9"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"De Santis, A., Persiano, G.: Zero-knowledge proofs of knowledge without interaction (extended abstract). In: 33rd FOCS, pp. 427\u2013436. IEEE Computer Society Press (1992). https:\/\/doi.org\/10.1109\/SFCS.1992.267809","DOI":"10.1109\/SFCS.1992.267809"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-662-53018-4_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Mironov, I., Stephens-Davidowitz, N.: Message transmission with reverse firewalls\u2014secure communication on corrupted machines. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 341\u2013372. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_13"},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-63697-9_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Everspaugh","year":"2017","unstructured":"Everspaugh, A., Paterson, K., Ristenpart, T., Scott, S.: Key rotation for authenticated encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part III. LNCS, vol. 10403, pp. 98\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_4"},{"key":"7_CR32","unstructured":"Fabrega, A., Maurer, U., Mularczyk, M.: A Fresh Approach to Updatable Symmetric Encryption. Cryptology ePrint Archive, Report 2021\/559 (2021). https:\/\/eprint.iacr.org\/2021\/559"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-34618-8_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"A Faonio","year":"2019","unstructured":"Faonio, A., Fiore, D., Herranz, J., R\u00e0fols, C.: Structure-Preserving and Re-randomizable RCCA-Secure Public Key Encryption and Its Applications. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 159\u2013190. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_6"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Fauzi, P., Hovd, M.N., Raddum, H.: On the IND-CCA1 security of FHE schemes. Cryptography 6(1) (2022). issn: 2410\u2013387X. https:\/\/doi.org\/10.3390\/cryptography6010013","DOI":"10.3390\/cryptography6010013"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Galteland, Y.J., Pan, J.: Backward-leak uni-directional updatable encryption from (homomorphic) public key encryption. In: PKC 2023, Part II. LNCS, vol. 13941, pp. 399\u2013428. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_14","DOI":"10.1007\/978-3-031-31371-4_14"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Magri, B., Venturi, D.: Cryptographic reverse firewalls for interactive proof systems. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) ICALP 2020. LIPIcs. Schloss Dagstuhl, vol. 168, pp. 55:1\u201355:16 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.55","DOI":"10.4230\/LIPIcs.ICALP.2020.55"},{"key":"7_CR37","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":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-24638-1_9","volume-title":"Theory of Cryptography","author":"J Groth","year":"2004","unstructured":"Groth, J.: Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 152\u2013170. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_9"},{"key":"7_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":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-64840-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"Y Jiang","year":"2020","unstructured":"Jiang, Y.: The direction of updatable encryption does not matter much. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 529\u2013558. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_18"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-17653-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Kloo\u00df","year":"2019","unstructured":"Kloo\u00df, M., Lehmann, A., Rupp, A.: (R)CCA secure updatable encryption with integrity protection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 68\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_3"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-030-92075-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"C Kuhn","year":"2021","unstructured":"Kuhn, C., Hofheinz, D., Rupp, A., Strufe, T.: Onion routing with\u00a0replies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part II. LNCS, vol. 13091, pp. 573\u2013604. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_20"},{"key":"7_CR44","unstructured":"K\u00f6lbl, S., Pandit, A., Misoczki, R., Schmieg., S.:Crypto agility and post- quantum cryptography at Google. In: Real-World Crypto Symposium (2023). https:\/\/www.youtube.com\/watch?v=IAOWRO9Qn10&t=107s"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-319-78372-7_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"A Lehmann","year":"2018","unstructured":"Lehmann, A., Tackmann, B.: Updatable encryption with\u00a0post-compromise security. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 685\u2013716. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_22"},{"key":"7_CR46","unstructured":"Levy-dit-Vehel, F., Rom\u00e9as, M.: A Composable Look at Updatable Encryption. Cryptology ePrint Archive, Report 2021\/538 (2021). https:\/\/eprint.iacr.org\/2021\/538"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-28496-0_4","volume-title":"Selected Areas in Cryptography","author":"J Loftus","year":"2012","unstructured":"Loftus, J., May, A., Smart, N.P., Vercauteren, F.: On CCA-secure somewhat homomorphic encryption. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 55\u201372. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_4"},{"key":"7_CR48","doi-asserted-by":"publisher","unstructured":"Manulis, M., Nguyen, J.: Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 63\u201393. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_3","DOI":"10.1007\/978-3-031-58723-8_3"},{"key":"7_CR49","doi-asserted-by":"publisher","unstructured":"Meers, J., Riepel, D.: CCA secure updatable encryption from non-mappable group actions. In: Saarinen, M.-J., Smith-Tone, D. (eds.) PQCrypto 2024, Part I. LNCS, vol. 14771, pp. 137\u2013169. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_5","DOI":"10.1007\/978-3-031-62743-9_5"},{"key":"7_CR50","doi-asserted-by":"publisher","unstructured":"Miao, P., Patranabis, S., Watson, G.J.: Unidirectional updatable encryption and proxy re-encryption from DDH. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 368\u2013398. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_13","DOI":"10.1007\/978-3-031-31371-4_13"},{"key":"7_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-46803-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"I Mironov","year":"2015","unstructured":"Mironov, I., Stephens-Davidowitz, N.: Cryptographic reverse firewalls. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 657\u2013686. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_22"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd ACM STOC, pp. 427\u2013437. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"7_CR53","doi-asserted-by":"publisher","unstructured":"Nishimaki, R.: The direction of updatable encryption does matter. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022, Part II. LNCS, vol. 13178, pp. 194\u2013224. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_7","DOI":"10.1007\/978-3-030-97131-1_7"},{"key":"7_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-70278-0_22","volume-title":"Financial Cryptography and Data Security","author":"O Pereira","year":"2017","unstructured":"Pereira, O., Rivest, R.L.: Marked mix-nets. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 353\u2013369. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_22"},{"key":"7_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-70583-3_54","volume-title":"Automata, Languages and Programming","author":"M Prabhakaran","year":"2008","unstructured":"Prabhakaran, M., Rosulek, M.: Homomorphic encryption with CCA security. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 667\u2013678. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_54"},{"key":"7_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-540-74143-5_29","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M Prabhakaran","year":"2007","unstructured":"Prabhakaran, M., Rosulek, M.: Rerandomizable RCCA encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 517\u2013534. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_29"},{"key":"7_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"C Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_35"},{"key":"7_CR58","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release Crypto. Technical report (MIT\/LCS\/TR)-684. MIT (1996). https:\/\/people.csail.mit.edu\/rivest\/pubs\/RSW96.pdf"},{"key":"7_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":"7_CR60","doi-asserted-by":"publisher","unstructured":"Slamanig, D., Striecks, C.: Revisiting updatable encryption: controlled forward security, constructions and a puncturable perspective. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part II. LNCS, vol. 14370, pp. 220\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_8","DOI":"10.1007\/978-3-031-48618-0_8"},{"key":"7_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"7_CR62","unstructured":"Volkhov, M.: Malleable Zero-Knowledge Proofs and Applications. Ph.D. thesis. University of Edinburgh (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91134-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:32Z","timestamp":1745665472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91134-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911330","9783031911347"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91134-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}