{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:07:31Z","timestamp":1779286051918,"version":"3.51.4"},"publisher-location":"Cham","reference-count":81,"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_8","type":"book-chapter","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:10Z","timestamp":1779282970000},"page":"231-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Composing AGM-Secure Functionalities with\u00a0Cryptographic Proofs"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahak","family":"Pancholi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Aardal, M.A., Aranha, D.F., Boudgoust, K., Kolby, S., Takahashi, A.: Aggregating falcon signatures with LaBRADOR. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0I, LNCS, vol. 14920, pp. 71\u2013106, Santa Barbara, CA, USA, August\u00a018\u201322, 2024. Springer, Cham, Switzerland (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_3","DOI":"10.1007\/978-3-031-68376-3_3"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Barbosa, M., Katz, J., Loss, J., Xu, J.: Algebraic adversaries in the universal composability framework. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0III, LNCS, vol. 13092, pp. 311\u2013341, Singapore, December\u00a06\u201310, 2021. Springer, Cham, Switzerland (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_11","DOI":"10.1007\/978-3-030-92078-4_11"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Ambrona, M., Beunardeau, M., Schmitt, A.-L., Toledo, R.R.: APLONK: aggregated P LON K from multi-polynomial commitment schemes. In: International Workshop on Security, pages 195\u2013213. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-41326-1_11","DOI":"10.1007\/978-3-031-41326-1_11"},{"key":"8_CR4","unstructured":"Afshar, A., Goyal, R.: Verifiable streaming computation and step-by-step zero-knowledge. Cryptology ePrint Archive, Paper 2025\/251 (2025)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 2087\u20132104, Dallas, TX, USA, October\u00a031\u00a0\u2013\u00a0November\u00a02, 2017. ACM Press (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"8_CR6","unstructured":"Arun, A., Setty, S.: Nebula: efficient read-write memory and switchboard circuits for folding schemes. Cryptology ePrint Archive, Report 2024\/1605 (2024)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334, San Francisco, CA, USA, May\u00a021\u201323, 2018. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"8_CR8","unstructured":"Botta, V., Bottoni, S., Campanelli, M., Ragnoli, E., Trombetta, A.: QEDB: expressive and modular verifiable databases (without SNARKs). Cryptology ePrint Archive, Paper 2025\/1408 (2025)"},{"issue":"4","key":"8_CR9","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. Cryptol. 30(4), 989\u20131066 (2017)","journal-title":"J. Cryptol."},{"key":"8_CR10","doi-asserted-by":"crossref","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 Annual ACM Symposium on Theory of Computing, pp. 111\u2013120, Palo Alto, CA, USA, June\u00a01\u20134, 2013. ACM Press","DOI":"10.1145\/2488608.2488623"},{"key":"8_CR11","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":"8_CR12","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":"8_CR13","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":"8_CR14","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":"8_CR15","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: 22nd Theory of Cryptography Conference, Part\u00a0I, LNCS, vol. 15364, pp. 90\u2013124, Milan, Italy, December\u00a02\u20136, 2024. Springer, Cham, Switzerland (2024). https:\/\/doi.org\/10.1007\/978-3-031-78011-0_4","DOI":"10.1007\/978-3-031-78011-0_4"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"8_CR18","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":"8_CR19","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0III, LNCS, vol. 13092, pp. 65\u201397, Singapore, December\u00a06\u201310, 2021. Springer, Cham, Switzerland (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_3","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"8_CR20","unstructured":"Barkan-Vered, W., Harding, F., Keller, J., Xu, J.: On the non-malleability of ECVRF in the algebraic group model. Cryptology ePrint Archive, Report 2023\/1004 (2023)"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0II, LNCS, vol. 14005, pp. 379\u2013404, Lyon, France, April\u00a023\u201327, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_13","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"8_CR22","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II, LNCS, vol. 13276, pp. 336\u2013366, Trondheim, Norway, May\u00a030\u00a0\u2013\u00a0June\u00a03, 2022. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_12","DOI":"10.1007\/978-3-031-07085-3_12"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0III, LNCS, vol. 13092, pp. 3\u201333, Singapore, December\u00a06\u201310, 2021. Springer, Cham, Switzerland (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Khoshakhlagh, H.: Witness encryption for succinct functional commitments and applications. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II, LNCS, vol. 14602, pp. 132\u2013167, Sydney, NSW, Australia, April\u00a015\u201317, 2024. Springer, Cham, Switzerland . https:\/\/doi.org\/10.1007\/978-3-031-57722-2_5","DOI":"10.1007\/978-3-031-57722-2_5"},{"key":"8_CR25","unstructured":"Campanelli, M., Fiore, D., Pancholi, M.: When can we incrementally prove computations of arbitrary depth? Cryptology ePrint Archive, Paper 2025\/1413 (2025)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 2075\u20132092, London, UK, November\u00a011\u201315, 2019. ACM Press (2019)","DOI":"10.1145\/3319535.3339820"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: TESTUDO: linear time prover SNARKs with constant size proofs and square root size universal setup. In: Aly, A., Tibouchi, M. (eds.) Progress in Cryptology - LATINCRYPT\u00a02023: 8th International Conference on Cryptology and Information Security in Latin America, LNCS, vol. 14168, pp. 331\u2013351, Quito, Ecuador, October\u00a03\u20136, 2023. Springer, Cham, Switzerland . https:\/\/doi.org\/10.1007\/978-3-031-44469-2_17","DOI":"10.1007\/978-3-031-44469-2_17"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Ganesh, C., Khoshakhlagh, H., Siim, J.: Impossibilities in succinct arguments: black-box extraction and more. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 23: 14th International Conference on Cryptology in Africa, LNCS, vol. 14064, pp. 465\u2013489, Sousse, Tunisia, July\u00a019\u201321, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_20","DOI":"10.1007\/978-3-031-37679-5_20"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Guan, Z., Samocha, S., Yogev, E.: Security bounds for proof-carrying data from straightline extractors. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024: 22nd Theory of Cryptography Conference, Part\u00a0II, LNCS, vol. 15365, pp. 464\u2013496, Milan, Italy, December\u00a02\u20136, 2024. Springer, Cham, Switzerland . https:\/\/doi.org\/10.1007\/978-3-031-78017-2_16","DOI":"10.1007\/978-3-031-78017-2_16"},{"key":"8_CR30","unstructured":"Campanelli, M., Hall-Andersen, M.: Fully succinct arguments over the integers from first principles. Cryptology ePrint Archive, Report 2024\/1548 (2024)"},{"key":"8_CR31","unstructured":"Campanelli, M., Hall-Andersen, M., Kamp, S.H.: Curve forests: transparent zero-knowledge set membership with batching and strong security. Cryptology ePrint Archive, Report 2024\/1647 (2024)"},{"key":"8_CR32","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":"8_CR33","doi-asserted-by":"publisher","unstructured":"Crites, E., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I, LNCS, vol. 14081, pp. 678\u2013709, Santa Barbara, CA, USA, August\u00a020\u201324, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Crites, E., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Snowblind: a threshold blind signature in pairing-free groups. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I, LNCS, vol. 14081, pp. 710\u2013742, Santa Barbara, CA, USA, August\u00a020\u201324, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_23","DOI":"10.1007\/978-3-031-38557-5_23"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0IV, LNCS, vol. 13794, pp. 189\u2013219, Taipei, Taiwan, December\u00a05\u20139, 2022. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_7","DOI":"10.1007\/978-3-031-22972-5_7"},{"key":"8_CR36","first-page":"310","volume":"10","author":"A Chiesa","year":"2010","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. ICS 10, 310\u2013331 (2010)","journal-title":"ICS"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd Annual Symposium on Foundations of Computer Science, pp. 1057\u20131068, Denver, CO, USA, October\u00a031\u00a0\u2013\u00a0November\u00a03, 2022. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Datta, P., Jain, A., Jin, Z., Korb, A., Mathialagan, S., Sahai, A.: Incrementally verifiable computation for NP from standard assumptions. Cryptology ePrint Archive, Paper 2025\/1546 (2025)","DOI":"10.1007\/978-3-032-01907-3_20"},{"key":"8_CR39","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":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-662-53641-4_5","volume-title":"Theory of Cryptography","author":"D Fiore","year":"2016","unstructured":"Fiore, D., Nitulescu, A.: On the (In)security of SNARKs in the presence of oracles. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 108\u2013138. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_5"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-45724-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Fuchsbauer","year":"2020","unstructured":"Fuchsbauer, G., Plouviez, A., Seurin, Y.: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 63\u201395. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3"},{"key":"8_CR42","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0II, LNCS, vol. 14005, pp. 315\u2013346, Lyon, France, April\u00a023\u201327, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_11","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Gailly, N., Maller, M., Nitulescu, A.: SnarkPack: practical SNARK aggregation. In: Eyal, I., Garay, J.A. (eds.) FC 2022: 26th International Conference on Financial Cryptography and Data Security, LNCS, vol. 13411, pp. 203\u2013229, Grenada, May\u00a02\u20136, 2022. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_10","DOI":"10.1007\/978-3-031-18283-9_10"},{"key":"8_CR44","unstructured":"Ganesh, C., Patranabis, S., Prakash, S., Singh, N.: GAPP: Generic Aggregation of Polynomial Protocols. Cryptology ePrint Archive, Report 2024\/1685 (2024)"},{"key":"8_CR45","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":"8_CR46","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: PointProofs: aggregating proofs for multiple vector commitments. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020: 27th Conference on Computer and Communications Security, pp. 2007\u20132023, Virtual Event, USA, November\u00a09\u201313, 2020. ACM Press (2020)","DOI":"10.1145\/3372297.3417244"},{"key":"8_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84252-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Ghoshal","year":"2021","unstructured":"Ghoshal, A., Tessaro, S.: Tight state-restoration soundness in the algebraic group model. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_3"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd Annual ACM Symposium on Theory of Computing, pp. 99\u2013108, San Jose, CA, USA, June\u00a06\u20138, 2011. ACM Press (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"8_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46803-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Hohenberger","year":"2015","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Universal signature aggregators. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 3\u201334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_1"},{"key":"8_CR50","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":"8_CR51","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Xu, J.: On pairing-free blind signature schemes in the algebraic group model. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022: 25th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II, LNCS, vol. 13178, pp. 468\u2013497, Virtual Event, March\u00a08\u201311, 2022. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_16","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"8_CR52","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.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0IV, LNCS, vol. 13510, pp. 359\u2013388, Santa Barbara, CA, USA, August\u00a015\u201318. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"8_CR53","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_CR54","unstructured":"Protocol Labs. SnarkPack V2: a new version of filecoin\u2019s proof aggregator. https:\/\/filecoin.io\/blog\/posts\/snarkpack-v2-a-new-version-of-filecoin-s-proof-aggregator\/"},{"key":"8_CR55","unstructured":"LayerEdge. What is layeredge? https:\/\/docs.layeredge.io\/docs\/introduction-to-layerEdge\/what-is-layerEdge"},{"key":"8_CR56","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. LNCS, vol. 13043, pp. 1\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1"},{"key":"8_CR57","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Polymath: groth16 is not the limit. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X, LNCS, vol. 14929, pp. 170\u2013206, Santa Barbara, CA, USA, August\u00a018\u201322, 2024. Springer, Cham, Switzerland (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_6","DOI":"10.1007\/978-3-031-68403-6_6"},{"key":"8_CR58","doi-asserted-by":"publisher","unstructured":"Lipmaa, H., Parisella, R., Siim, J.: Algebraic group model with oblivious sampling. In: Rothblum, G.N., Wee, H. (eds.) TCC\u00a02023: 21st Theory of Cryptography Conference, Part\u00a0IV, LNCS, vol. 14372, pp. 363\u2013392, Taipei, Taiwan, November\u00a029\u00a0\u2013\u00a0December\u00a02, 2023. Springer, Cham, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_14","DOI":"10.1007\/978-3-031-48624-1_14"},{"key":"8_CR59","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016: 43rd International Colloquium on Automata, Languages and Programming, Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a055 , pp. 30:1\u201330:14, Rome, Italy, July\u00a011\u201315, 2016. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik"},{"key":"8_CR60","unstructured":"Lee, H., Seo, J.H.: On the security of nova recursive proof system. Cryptology ePrint Archive, Report 2024\/232 (2024)"},{"key":"8_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-030-03329-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"RWF Lai","year":"2018","unstructured":"Lai, R.W.F., Tai, R.K.H., Wong, H.W.H., Chow, S.S.M.: Multi-key homomorphic signatures unforgeable under insider corruption. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 465\u2013492. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_16"},{"key":"8_CR62","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, T., Zhang, J., Song, D., Zhang, Y.: Pianist: Scalable zkRollups via fully distributed zero-knowledge proofs. In: 2024 IEEE Symposium on Security and Privacy, pp. 1777\u20131793, San Francisco, CA, USA, May\u00a019\u201323, 2024. IEEE Computer Society Press (2024)","DOI":"10.1109\/SP54263.2024.00035"},{"key":"8_CR63","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 2111\u20132128, London, UK, November\u00a011\u201315, 2019. ACM Press","DOI":"10.1145\/3319535.3339817"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453, Santa Fe, NM, USA, November\u00a020\u201322, 1994. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"8_CR65","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994 (1994)"},{"key":"8_CR66","unstructured":"https:\/\/minaprotocol.com\/"},{"key":"8_CR67","doi-asserted-by":"crossref","unstructured":"Maller, M., Mohnblatt, N., Zapico, A.: IVC in the open-and-sign random oracle model. Cryptology ePrint Archive, Paper 2025\/1663 (2025)","DOI":"10.1007\/978-981-95-5122-4_11"},{"key":"8_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-70697-9_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"G Malavolta","year":"2017","unstructured":"Malavolta, G., Schr\u00f6der, D.: Efficient ring signatures in the standard model. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 128\u2013157. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_5"},{"key":"8_CR69","unstructured":"https:\/\/whitepaper.nexus.xyz\/"},{"key":"8_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round SCHNORR multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"8_CR71","doi-asserted-by":"crossref","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd Annual Symposium on Foundations of Computer Science, pp. 1045\u20131056, Denver, CO, USA, October\u00a031\u00a0\u2013\u00a0November\u00a03, 2022. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"8_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22"},{"key":"8_CR73","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: Aggregating and maintaining proofs in vector commitments. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022: 31st USENIX Security Symposium, pp. 3001\u20133018, Boston, MA, USA, August\u00a010\u201312, 2022. USENIX Association (2022)"},{"key":"8_CR74","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. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"8_CR75","unstructured":"https:\/\/starkware.co\/"},{"key":"8_CR76","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":"8_CR77","doi-asserted-by":"publisher","unstructured":"Vesely, P., et al.: PLUMO: an ultralight blockchain client. In: Eyal, I., Garay, J.A. (eds.) FC 2022: 26th International Conference on Financial Cryptography and Data Security, LNCS, vol. 13411, pp. 597\u2013614 Grenada, May\u00a02\u20136, 2022. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_30","DOI":"10.1007\/978-3-031-18283-9_30"},{"key":"8_CR78","doi-asserted-by":"crossref","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, San Francisco, CA, USA, May\u00a021\u201323, 2018. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"8_CR79","doi-asserted-by":"crossref","unstructured":"Xie, T., et al.: zkBridge: trustless cross-chain bridges made practical. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 3003\u20133017, Los Angeles, CA, USA, November\u00a07\u201311, 2022. ACM Press (2022)","DOI":"10.1145\/3548606.3560652"},{"key":"8_CR80","unstructured":"Yang, X., Zhang, C., Ryan, M., Meng, G.: Multivariate multi-polynomial commitment and its applications. Cryptology ePrint Archive, Report 2024\/827 (2024)"},{"key":"8_CR81","unstructured":"https:\/\/www.zksync.io\/"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:22Z","timestamp":1779282982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26737-5_8"}},"subtitle":["Applications to Unbounded-Depth IVC and More"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267368","9783032267375"],"references-count":81,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26737-5_8","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"}}]}}