{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:16:27Z","timestamp":1778166987661,"version":"3.51.4"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032252906","type":"print"},{"value":"9783032252913","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-25291-3_7","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:54:04Z","timestamp":1778165644000},"page":"184-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Putting Multi Into Multi-signatures: Tight Security for\u00a0Multiple Signers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-7899","authenticated-orcid":false,"given":"Anja","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5000-7655","authenticated-orcid":false,"given":"Cavit","family":"\u00d6zbay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abe, M., Hofheinz, D., Nishimaki, R., Ohkubo, M., Pan, J.: Compact structure-preserving signatures with almost tight security. J. Cryptol. 36(4) (2023)","DOI":"10.1007\/s00145-023-09477-z"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-03326-2_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"M Abe","year":"2018","unstructured":"Abe, M., Jutla, C.S., Ohkubo, M., Roy, A.: Improved (almost) tightly-secure simulation-sound QA-NIZK with applications. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 627\u2013656. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_21"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Abou\u00a0Haidar, C., Das, D., Lehmann, A., \u00d6zbay, C., Kempner, O.P.: Privacy-preserving multi-signatures: generic techniques and constructions without pairings. In: Jager, T., Pan, J. (eds.) PKC 2025. LNCS, vol. 15675, pp. 66\u201398. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91823-0_3","DOI":"10.1007\/978-3-031-91823-0_3"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bacho, R., Wagner, B.: Tightly secure non-interactive bls multi-signatures. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15485, pp. 397\u2013422. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0888-1_13","DOI":"10.1007\/978-981-96-0888-1_13"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bacho, R., Wagner, B.: T-spoon: Tightly secure two-round multi-signatures with key aggregation. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16005, p. 256\u2013290. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_9","DOI":"10.1007\/978-3-032-01887-8_9"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-46494-6_26","volume-title":"Theory of Cryptography","author":"C Bader","year":"2015","unstructured":"Bader, C., Hofheinz, D., Jager, T., Kiltz, E., Li, Y.: Tightly-secure authenticated key exchange. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 629\u2013658. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_26"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Proceedings of the 15th ACM conference on Computer and communications security - CCS 2008, p.\u00a0449 (2008)","DOI":"10.1145\/1455770.1455827"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Subset-optimized bls multi-signature with key aggregation. In: Financial Cryptography and Data Security: 28th International Conference, FC 2024, pp. 188\u2013205 (2025)","DOI":"10.1007\/978-3-031-78679-2_10"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Bellare, M., Ranjan, R., Riepel, D., Aldakheel, A.: The concrete security of two-party computation: Simple definitions, and tight proofs for PSI and OPRFs. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15489, pp. 328\u2013362. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_11","DOI":"10.1007\/978-981-96-0938-3_11"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-Key encryption in a multi-user setting: security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259\u2013274. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_18"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-030-92068-5_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Bellare","year":"2021","unstructured":"Bellare, M., Dai, W.: Chain reductions for\u00a0multi-signatures and\u00a0the\u00a0HBMS scheme. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 650\u2013678. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_22"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-73420-8_37","volume-title":"Automata, Languages and Programming","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Unrestricted aggregate signatures. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 411\u2013422. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_37"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, pp. 390\u2013399 (2006)","DOI":"10.1145\/1180405.1180453"},{"key":"7_CR14","unstructured":"Bernstein, D.: Multi-user Schnorr security, revisited. Cryptology ePrint Archive, IACR (2015). Report Number: 996"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Blocki, J., Lee, S.: On the multi-user security of short Schnorr signatures with preprocessing. In: Dunkelman, O., Dziembowski, S. (eds) EUROCRYPT 2022. LNCS, vol 13276, pp. 614\u2013643. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_21","DOI":"10.1007\/978-3-031-07085-3_21"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223\u2013238. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_14"},{"key":"7_CR18","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_CR19","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":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Chen, Y.: Round-efficient adaptively secure threshold signatures with rewinding. IACR Commun. Cryptol. 2(2) (2025)","DOI":"10.62056\/ah893z10k"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J-S Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/978-3-030-56877-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"G Couteau","year":"2020","unstructured":"Couteau, G., Hartmann, D.: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 768\u2013798. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_27"},{"key":"7_CR24","unstructured":"Crites, E., Komlo, C., Maller, M.: How to prove Schnorr assuming Schnorr: security of multi-and threshold signatures. Cryptology ePrint Archive (2021). Report Number: 1375"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Drijvers, M., et al.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1084\u20131101 (2019)","DOI":"10.1109\/SP.2019.00050"},{"key":"7_CR26","unstructured":"Edgington, B.: Upgrading ethereum a technical handbook on ethereum\u2019s move to proof of stake and beyond (2022). https:\/\/eth2book.info\/capella\/part2\/building_blocks\/signatures\/. Accessed 14 Feb 2025"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Fukumitsu, M., Hasegawa, S.: A tightly-secure lattice-based multisignature. In: Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, pp. 3\u201311 (2019)","DOI":"10.1145\/3327958.3329542"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Fukumitsu, M., Hasegawa, S.: A tightly secure ddh-based multisignature with public-key aggregation. In: 2020 Eighth International Symposium on Computing and Networking Workshops (CANDARW), pp. 321\u2013327 (2020)","DOI":"10.1109\/CANDARW51189.2020.00069"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Glabush, L., H\u00f6velmanns, K., Stebila, D.: Tight multi-challenge security reductions for key encapsulation mechanisms (2025). https:\/\/eprint.iacr.org\/2025\/343","DOI":"10.62056\/a63zl83y6"},{"issue":"4","key":"7_CR32","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00145-007-0549-3","volume":"20","author":"EJ Goh","year":"2007","unstructured":"Goh, E.J., Jarecki, S., Katz, J., Wang, N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. J. Cryptol. 20(4), 493\u2013514 (2007)","journal-title":"J. Cryptol."},{"key":"7_CR33","unstructured":"Groth, J.: Homomorphic trapdoor commitments to group elements (2009). https:\/\/eprint.iacr.org\/2009\/007"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-84259-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Han","year":"2021","unstructured":"Han, S., et al.: Authenticated key exchange and signatures with tight security in the standard model. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 670\u2013700. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_23"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-92075-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Han","year":"2021","unstructured":"Han, S., Liu, S., Gu, D.: Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 483\u2013513. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_17"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively Secure 5 Round Threshold Signatures from MLWE\/MSIS and DL with Rewinding. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14926, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003, pp. 155\u2013164 (2003)","DOI":"10.1145\/948109.948132"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-662-53008-5_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Kiltz","year":"2016","unstructured":"Kiltz, E., Masny, D., Pan, J.: Optimal security proofs for signatures from identification schemes. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 33\u201361. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_2"},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Kondi, Y., Shelat, A.: Improved straight-line extraction in the random oracle model with applications to signature aggregation. In: Agrawal, S., Lin, D. (eds) ASIACRYPT 2022. LNCS, vol 13792, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_10","DOI":"10.1007\/978-3-031-22966-4_10"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-84242-0_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"H K\u0131l\u0131n\u00e7 Alper","year":"2021","unstructured":"K\u0131l\u0131n\u00e7 Alper, H., Burdges, J.: Two-round trip Schnorr multi-signatures via delinearized witnesses. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 157\u2013188. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_7"},{"issue":"1","key":"7_CR41","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12095-017-0253-6","volume":"10","author":"MS Lacharit\u00e9","year":"2018","unstructured":"Lacharit\u00e9, M.S.: Security of BLS and BGLS signatures in a multi-user setting. Cryptogr. Commun. 10(1), 41\u201358 (2018)","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"7_CR42","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s00145-020-09356-x","volume":"33","author":"R Langrehr","year":"2020","unstructured":"Langrehr, R., Pan, J.: Tightly secure hierarchical identity-based encryption. J. Cryptol. 33(4), 1787\u20131821 (2020)","journal-title":"J. Cryptol."},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-03298-1_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"D-P Le","year":"2009","unstructured":"Le, D.-P., Bonnecaze, A., Gabillon, A.: Multisignatures as secure as the Diffie-Hellman problem in the plain public-key model. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 35\u201351. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_3"},{"key":"7_CR44","doi-asserted-by":"publisher","unstructured":"Lehmann, A., Nazarian, P., \u00d6zbay, C.: Stronger security for threshold blind signatures. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15602, pp. 335\u2013364. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_12","DOI":"10.1007\/978-3-031-91124-8_12"},{"key":"7_CR45","unstructured":"Lehmann, A., \u00d6zbay, C.: Putting multi into multi-signatures: tight security for multiple signers. Cryptology ePrint Archive, Paper 2025\/2198 (2025). https:\/\/eprint.iacr.org\/2025\/2198"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11761679_28","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465\u2013485. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_28"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P MacKenzie","year":"2004","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 382\u2013400. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_23"},{"issue":"9","key":"7_CR48","doi-asserted-by":"publisher","first-page":"2139","DOI":"10.1007\/s10623-019-00608-x","volume":"87","author":"G Maxwell","year":"2019","unstructured":"Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple Schnorr multi-signatures with applications to Bitcoin. Des. Codes Crypt. 87(9), 2139\u20132164 (2019)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"7_CR49","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/B:DESI.0000036250.18062.3f","volume":"33","author":"A Menezes","year":"2004","unstructured":"Menezes, A., Smart, N.: Security of signature schemes in a multi-user setting. Des. Codes Crypt. 33(3), 261\u2013274 (2004)","journal-title":"Des. Codes Crypt."},{"key":"7_CR50","unstructured":"Nick, J., Ruffing, T., Elliott, J.: Musig2 for bip340-compatible multi-signatures (2022). https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0327.mediawiki. Accessed 14 Feb 2025"},{"key":"7_CR51","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":"7_CR52","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, pp. 1717\u20131731 (2020)","DOI":"10.1145\/3372297.3417236"},{"key":"7_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-59013-0_24","volume-title":"Computer Security \u2013 ESORICS 2020","author":"J Pan","year":"2020","unstructured":"Pan, J., Ringerud, M.: Signatures with tight multi-user security from search assumptions. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 485\u2013504. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_24"},{"key":"7_CR54","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 597\u2013627. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_21","DOI":"10.1007\/978-3-031-30589-4_21"},{"key":"7_CR55","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Toothpicks: more efficient fork-free two-round multi-signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14651, pp. 460\u2013489. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_16","DOI":"10.1007\/978-3-031-58716-0_16"},{"issue":"3","key":"7_CR56","doi-asserted-by":"publisher","first-page":"443","DOI":"10.15388\/Informatica.2012.369","volume":"23","author":"H Qian","year":"2012","unstructured":"Qian, H., Li, X., Huang, X.: Tightly secure non-interactive multisignatures in the plain public key model. Informatica 23(3), 443\u2013460 (2012)","journal-title":"Informatica"},{"issue":"2","key":"7_CR57","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ipl.2010.10.015","volume":"111","author":"H Qian","year":"2010","unstructured":"Qian, H., Xu, S.: Non-interactive multisignatures in the plain public-key model with efficient verification. Inf. Process. Lett. 111(2), 82\u201389 (2010)","journal-title":"Inf. Process. Lett."},{"key":"7_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72540-4_13","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"T Ristenpart","year":"2007","unstructured":"Ristenpart, T., Yilek, S.: The power of proofs-of-possession: securing multiparty signatures against rogue-key attacks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 228\u2013245. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_13"},{"key":"7_CR59","unstructured":"Takemure, K., Sakai, Y., Santoso, B., Hanaoka, G., Ohta, K.: More efficient two-round multi-signature scheme with provably secure parameters for standardized elliptic curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. advpub, 2023EAP1045 (2023)"},{"key":"7_CR60","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol 14008, pp. 628\u2013658. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_22","DOI":"10.1007\/978-3-031-30589-4_22"},{"key":"7_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-34961-4_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"JL Villar","year":"2012","unstructured":"Villar, J.L.: Optimal reductions of some decisional problems to the rank problem. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 80\u201397. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_7"},{"key":"7_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25291-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:54:16Z","timestamp":1778165656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_7","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":"8 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}