{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:07:08Z","timestamp":1781608028137,"version":"3.54.5"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918254","type":"print"},{"value":"9783031918261","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-91826-1_7","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:28:19Z","timestamp":1746592099000},"page":"200-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Commit-and-Prove System for\u00a0Vectors and\u00a0Applications to\u00a0Threshold Signing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-7899","authenticated-orcid":false,"given":"Anja","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5000-7655","authenticated-orcid":false,"given":"Cavit","family":"\u00d6zbay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-030-92068-5_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"T Attema","year":"2021","unstructured":"Attema, T., Cramer, R., Rambaud, M.: Compressed $$\\Sigma $$-protocols for\u00a0bilinear group arithmetic circuits and\u00a0application to\u00a0logarithmic transparent threshold signatures. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 526\u2013556. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_18"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baird, L., et al.: Threshold signatures in the multiverse. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 1454\u20131470 (2023)","DOI":"10.1109\/SP46215.2023.10179436"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bauer, B., Farshim, P., Harasser, P., Kohlweiss, M.: The uber-knowledge assumption: a bridge to the AGM. IACR Commun. Cryptol. 1(3) (2024). https:\/\/doi.org\/10.62056\/anr-zoja5","DOI":"10.62056\/anr-zoja5"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-56880-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"B Bauer","year":"2020","unstructured":"Bauer, B., Fuchsbauer, G., Loss, J.: A\u00a0classification\u00a0of\u00a0computational\u00a0assumptions in the algebraic group model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 121\u2013151. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_5"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-03329-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 435\u2013464. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_15"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Komlo, C.: Threshold signatures with private accountability. In: CRYPTO 2022-Annual International Cryptology Conference, pp. 551\u2013581 (2022)","DOI":"10.1007\/978-3-031-15985-5_19"},{"key":"7_CR7","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":"7_CR8","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: ACM CCS 2019, pp. 2075\u20132092 (2019). https:\/\/doi.org\/10.1145\/3319535.3339820. https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: Asiacrypt 2022, pp. 189\u2013219 (2022)","DOI":"10.1007\/978-3-031-22972-5_7"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-031-58737-5_3","volume-title":"Advances in Cryptology - EUROCRYPT 2024","author":"P Chaidos","year":"2024","unstructured":"Chaidos, P., Kiayias, A., Reyzin, L., Zinovyev, A.: Approximate lower bound arguments. In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024, pp. 55\u201384. Springer, Cham (2024)"},{"key":"7_CR11","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_CR12","doi-asserted-by":"publisher","unstructured":"Costello, C., et al.: Geppetto: versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 253\u2013270. IEEE (2015). https:\/\/doi.org\/10.1109\/SP.2015.23. https:\/\/ieeexplore.ieee.org\/document\/7163030\/","DOI":"10.1109\/SP.2015.23"},{"key":"7_CR13","unstructured":"Crites, E., Komlo, C., Maller, M.: How to prove schnorr assuming schnorr: security of multi- and threshold signatures. Cryptology ePrint Archive, Paper 2021\/1375 (2021). https:\/\/eprint.iacr.org\/2021\/1375. https:\/\/eprint.iacr.org\/2021\/1375"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Das, S., Camacho, P., Xiang, Z., Nieto, J., B\u00fcnz, B., Ren, L.: Threshold signatures from inner product argument: succinct, weighted, and multi-threshold. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, pp. 356\u2013370. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3623096. https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623096","DOI":"10.1145\/3576915.3623096"},{"key":"7_CR15","unstructured":"Ellis, S.: A decentralized oracle network steve ellis, ari juels, and sergey nazarov (2017). https:\/\/research.chain.link\/whitepaper-v1.pdf"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-642-54631-0_36","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"A Escala","year":"2014","unstructured":"Escala, A., Groth, J.: Fine-tuning Groth-Sahai proofs. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 630\u2013649. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_36"},{"key":"7_CR17","unstructured":"ethereum.org: What are daos? (2025). https:\/\/ethereum.org\/en\/developers\/docs\/consensus-mechanisms\/pos\/"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zksnarks. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography - TCC 2023 (2023)","DOI":"10.1007\/978-3-031-48621-0_16"},{"key":"7_CR19","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":"7_CR20","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Khoshakhlagh, H., Kohlweiss, M., Nitulescu, A., Zajac, M.: What makes fiat\u2013shamir zksnarks (updatable srs) simulation extractable? In: International Conference on Security and Cryptography for Networks - SCN 2022, pp. 735\u2013760 (2022)","DOI":"10.1007\/978-3-031-14791-3_32"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Ganesh, C., Kondi, Y., Orlandi, C., Pancholi, M., Takahashi, A., Tschudi, D.: Witness-succinct universally-composable snarks. In: Eurocrypt 2023, pp. 315\u2013346 (2023)","DOI":"10.1007\/978-3-031-30617-4_11"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-39200-9_11","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"JA Garay","year":"2003","unstructured":"Garay, J.A., MacKenzie, P., Yang, K.: Strengthening zero-knowledge protocols using signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 177\u2013194. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_11"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Garg, S., Goel, A., Wang, M.: How to prove statements obliviously? In: Advances in Cryptology - CRYPTO 2024: 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part X, pp. 449\u2013487. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_14","DOI":"10.1007\/978-3-031-68403-6_14"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: hints: threshold signatures with silent setup. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 3034\u20133052 (2023). https:\/\/doi.org\/10.1109\/SP54263.2024.00057","DOI":"10.1109\/SP54263.2024.00057"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-031-68394-7_12","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"S Garg","year":"2024","unstructured":"Garg, S., Kolonelos, D., Policharla, G.V., Wang, M.: Threshold encryption with silent setup. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, pp. 352\u2013386. Springer, Cham (2024)"},{"key":"7_CR26","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_CR27","unstructured":"Kosba, A., et al.: C$$\\emptyset $$c$$\\emptyset $$: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive, Paper 2015\/1093 (2015). https:\/\/eprint.iacr.org\/2015\/1093"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Libert, B.: Vector commitments with proofs of smallness: short range proofs and more. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography - PKC 2024, vol. 14602, pp. 36\u201367. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_2","DOI":"10.1007\/978-3-031-57722-2_2"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Micali, S., Reyzin, L., Vlachos, G., Wahby, R.S., Zeldovich, N.: Compact certificates of collective knowledge. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 626\u2013641 (2020). https:\/\/doi.org\/10.1109\/SP40001.2021.00096","DOI":"10.1109\/SP40001.2021.00096"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Qiu, T., Tang, Q.: Predicate aggregate signatures and applications. In: Asiacrypt - 2023, pp. 279\u2013312. Springer (2023)","DOI":"10.1007\/978-981-99-8724-5_9"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-030-84242-0_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C R\u00e0fols","year":"2021","unstructured":"R\u00e0fols, C., Zapico, A.: An algebraic framework for universal and updatable SNARKs. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 774\u2013804. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_27"},{"key":"7_CR33","unstructured":"Smith, C.: Proof-of-stake (PoS) (2024). https:\/\/ethereum.org\/en\/developers\/docs\/consensus-mechanisms\/pos\/"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Szepieniec, A., Zhang, Y.: Polynomial IOPs for linear algebra relations. In: Conference on Public-Key Cryptography - PKC 2022, pp. 523\u2013552. Springer (2022)","DOI":"10.1007\/978-3-030-97121-2_19"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91826-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:28:38Z","timestamp":1746592118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91826-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918254","9783031918261"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91826-1_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":"5 May 2025","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":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}