{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:07:38Z","timestamp":1779286058241,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267368","type":"print"},{"value":"9783032267375","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-26737-5_9","type":"book-chapter","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:44Z","timestamp":1779283004000},"page":"269-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Simulation-Extractability of\u00a0Proof-Carrying Data"],"prefix":"10.1007","author":[{"given":"Behzad","family":"Abdolmaleki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Campanelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang","family":"Dao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamidreza","family":"Khoshakhlagh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"9_CR1","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, November 2020. https:\/\/doi.org\/10.1145\/3372297.3417228","DOI":"10.1145\/3372297.3417228"},{"key":"9_CR2","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":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16"},{"key":"9_CR4","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, June 2013. https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"9_CR5","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: decentralized cryptocurrency at scale. Cryptology ePrint Archive, Report 2020\/352 (2020). https:\/\/eprint.iacr.org\/2020\/352"},{"key":"9_CR6","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, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"9_CR7","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. Cryptology ePrint Archive, Report 2020\/1618 (2020). https:\/\/eprint.iacr.org\/2020\/1618"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-84242-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24"},{"key":"9_CR9","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. Cryptology ePrint Archive, Report 2020\/499 (2020). https:\/\/eprint.iacr.org\/2020\/499"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64378-2_1","volume-title":"Theory of Cryptography","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: accumulation for Reed-Solomon codes. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16006. pp. 128\u2013160. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_5","DOI":"10.1007\/978-3-032-01907-3_5"},{"key":"9_CR12","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":"9_CR13","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.) Advances in Cryptology \u2013 EUROCRYPT 2025. 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":"9_CR14","unstructured":"Campanelli, M., Fiore, D., Pancholi, M.: On composing AGM-secure functionalities with cryptographic proofs: applications to unbounded-depth IVC and more. Cryptology ePrint Archive, Paper 2025\/2086 (2025). https:\/\/eprint.iacr.org\/2025\/2086"},{"key":"9_CR15","unstructured":"Campanelli, M., Fiore, D., Pancholi, M.: When can we incrementally prove computations of arbitrary depth? Cryptology ePrint Archive, Paper 2025\/1413 (2025). https:\/\/eprint.iacr.org\/2025\/1413"},{"key":"9_CR16","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, October 2001. https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR17","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":"9_CR18","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Spooner, N.: On succinct non-interactive arguments in relativized worlds. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 336\u2013366. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_12","DOI":"10.1007\/978-3-031-07085-3_12"},{"key":"9_CR19","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":"9_CR20","unstructured":"Chiesa, A., Guan, Z., Samocha, S., Yogev, E.: Security bounds for proof-carrying data from straightline extractors. Cryptology ePrint Archive, Report 2023\/1646 (2023). https:\/\/eprint.iacr.org\/2023\/1646"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Guan, Z., Samocha, S., Yogev, E.: Security bounds for proof-carrying data from straightline extractors. In: TCC\u00a02024, Part\u00a0II. LNCS, pp. 464\u2013496. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_16","DOI":"10.1007\/978-3-031-78017-2_16"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","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"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27"},{"key":"9_CR24","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: Yao, A.C.C. (ed.) ICS 2010, pp. 310\u2013331. Tsinghua University Press (2010)"},{"key":"9_CR25","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":"9_CR26","doi-asserted-by":"publisher","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO\u00a02001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_33","DOI":"10.1007\/3-540-44647-8_33"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Decker, C., Wattenhofer, R.: Bitcoin transaction malleability and MtGox. In: Kutylowski, M., Vaidya, J. (eds.) ESORICS\u00a02014, Part\u00a0II. LNCS, vol.\u00a08713, pp. 313\u2013326. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11212-1_18","DOI":"10.1007\/978-3-319-11212-1_18"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd FOCS, pp. 1057\u20131068. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00103","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"9_CR29","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":"9_CR30","doi-asserted-by":"crossref","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zkSNARKs. Cryptology ePrint Archive, Report 2023\/569 (2023). https:\/\/eprint.iacr.org\/2023\/569","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Faonio, A., Fiore, D., Russo, L.: Real-world universal zkSNARKs are non-malleable. Cryptology ePrint Archive, Report 2024\/721 (2024). https:\/\/eprint.iacr.org\/2024\/721","DOI":"10.1145\/3658644.3690351"},{"key":"9_CR32","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":"9_CR33","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":"9_CR34","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model). In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 397\u2013426. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_14","DOI":"10.1007\/978-3-031-07085-3_14"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Groth, J., Maller, M.: Snarky signatures: minimal signatures of knowledge from simulation-extractable SNARKs. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0II. LNCS, vol. 10402, pp. 581\u2013612. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_20","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"9_CR36","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":"9_CR37","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.T.V.: HyperNova: recursive arguments for customizable constraint systems. LNCS, pp. 345\u2013379. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"9_CR39","unstructured":"Lee, H., Seo, J.H.: On the security of nova recursive proof system. Cryptology ePrint Archive, Paper 2024\/232 (2024). https:\/\/eprint.iacr.org\/2024\/232"},{"key":"9_CR40","unstructured":"Lurk lab (2024). https:\/\/github.com\/lurk-lab"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2111\u20132128. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3339817","DOI":"10.1145\/3319535.3339817"},{"key":"9_CR42","unstructured":"Maller, M., Mohnblatt, N., Zapico, A.: IVC in the open-and-sign random oracle model. Cryptology ePrint Archive, Paper 2025\/1663 (2025). https:\/\/eprint.iacr.org\/2025\/1663"},{"key":"9_CR43","unstructured":"Mina protocol (2024). https:\/\/minaprotocol.com\/"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Naor, M., Paneth, O., Rothblum, G.N.: Incrementally verifiable computation via incremental PCPs. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892, pp. 552\u2013576. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_21","DOI":"10.1007\/978-3-030-36033-7_21"},{"key":"9_CR45","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive (2023)"},{"key":"9_CR46","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Report 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Nguyen, W.D., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: a scalable framework for folding-based SNARKs. LNCS, pp. 308\u2013344. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_10","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd FOCS, pp. 1045\u20131056. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00102","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"R\u00e0fols, C., Zapico, A.: An algebraic framework for universal and updatable SNARKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 774\u2013804. Springer, Cham, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_27","DOI":"10.1007\/978-3-030-84242-0_27"},{"key":"9_CR50","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC\u00a02008. LNCS, vol.\u00a04948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"9_CR52","unstructured":"Zhao, J., Setty, S., Cui, W., Zaverucha, G.: MicroNova: folding-based arguments with efficient (on-chain) verification. Cryptology ePrint Archive, Paper 2024\/2099 (2024). https:\/\/eprint.iacr.org\/2024\/2099"},{"key":"9_CR53","doi-asserted-by":"publisher","unstructured":"Zhao, J., Setty, S.T.V., Cui, W., Zaverucha, G.: MicroNova: folding-based arguments with efficient (on-chain) verification. In: 2025 IEEE Symposium on Security and Privacy, pp. 1964\u20131982. IEEE Computer Society Press (2025). https:\/\/doi.org\/10.1109\/SP61157.2025.00168","DOI":"10.1109\/SP61157.2025.00168"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26737-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:49Z","timestamp":1779283009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26737-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267368","9783032267375"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26737-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"21 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}