{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:18:59Z","timestamp":1778167139403,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"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_5","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:56:02Z","timestamp":1778165762000},"page":"124-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tweed: Adaptively Secure Lattice-Based Two-Round Threshold Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3158-1979","authenticated-orcid":false,"given":"Kaijie","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3751-8546","authenticated-orcid":false,"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4276-2797","authenticated-orcid":false,"given":"Chenzhi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D., Malavolta, G., Roy, L.: Succinct oblivious tensor evaluation and applications: adaptively-secure laconic function evaluation and trapdoor hashing for all circuits. In: STOC (2025)","DOI":"10.1145\/3717823.3718164"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Stehl\u00e9, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol.\u00a0229, pp. 8:1\u20138:20. Schloss Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.8","DOI":"10.4230\/LIPIcs.ICALP.2022.8"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO\u00a02009. LNCS, vol.\u00a05677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Adaptively secure three-round threshold schnorr signatures from DDH. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 390\u2013422. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_13","DOI":"10.1007\/978-3-032-01887-8_13"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Glacius: threshold schnorr signatures from DDH with full adaptive security. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0II. LNCS, vol. 15602, pp. 304\u2013334. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_11","DOI":"10.1007\/978-3-031-91124-8_11"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022. pp. 193\u2013207. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560656","DOI":"10.1145\/3548606.3560656"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J., Tessaro, S., Wagner, B., Zhu, C.: Twinkle: threshold signatures from DDH with full adaptive security. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 429\u2013459. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_15","DOI":"10.1007\/978-3-031-58716-0_15"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Better than advertised security for non-interactive threshold signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 517\u2013550. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"5_CR9","unstructured":"Bienstock, A., de\u00a0Castro, L., Escudero, D., Polychroniadou, A., Takahashi, A.: Efficient, scalable threshold ML-DSA signatures: an MPC approach. Cryptology ePrint Archive, Paper 2025\/1163 (2025). https:\/\/eprint.iacr.org\/2025\/1163"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P.M.R., Sahai, A.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"5_CR11","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Kim, S.: A lattice-based universal thresholdizer for cryptographic systems. Cryptology ePrint Archive, Report 2017\/251 (2017). https:\/\/eprint.iacr.org\/2017\/251"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol.\u00a08441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"5_CR13","unstructured":"Borin, G., Celi, S., del Pino, R., Espitau, T., Niot, G., Prest, T.: Threshold signatures reloaded: ML-DSA and enhanced raccoon with identifiable aborts. Cryptology ePrint Archive, Paper 2025\/1166 (2025). https:\/\/eprint.iacr.org\/2025\/1166"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Boschini, C., Kaviani, D., Lai, R.W.F., Malavolta, G., Takahashi, A., Tibouchi, M.: Ringtail: practical two-round threshold signatures from learning with errors. In: Blanton, M., Enck, W., Nita-Rotaru, C. (eds.) 2025 IEEE Symposium on Security and Privacy, pp. 149\u2013164. IEEE Computer Society Press (2025). https:\/\/doi.org\/10.1109\/SP61157.2025.00070","DOI":"10.1109\/SP61157.2025.00070"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: lattice-based multi-signature with single-round online phase. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 276\u2013305. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10","DOI":"10.1007\/978-3-031-15979-4_10"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: 28th ACM STOC, pp. 639\u2013648. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.238015","DOI":"10.1145\/237814.238015"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Partially non-interactive two-round lattice-based threshold signatures. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 268\u2013302. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_9","DOI":"10.1007\/978-981-96-0894-2_9"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Chen, Y.: Dazzle: improved adaptive threshold signatures from DDH. In: Jager, T., Pan, J. (eds.) PKC\u00a02025, Part\u00a0III. LNCS, vol. 15676, pp. 233\u2013261. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91826-1_8","DOI":"10.1007\/978-3-031-91826-1_8"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Chen, Y.: Round-efficient adaptively secure threshold signatures with rewinding. IACR Commun. Cryptol. 2(2) (2025). https:\/\/doi.org\/10.62056\/ah893z10k","DOI":"10.62056\/ah893z10k"},{"key":"5_CR20","unstructured":"Connolly, D., Komlo, C., Goldberg, I., Wood, C.A.: Two-round threshold schnorr signatures with FROST. Internet-Draft draft-irtf-cfrg-frost-10, Internet Engineering Task Force (2022). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-frost\/10\/, work in Progress"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Katz, J., Komlo, C., Tessaro, S., Zhu, C.: On the adaptive security of FROST. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 480\u2013511. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_16","DOI":"10.1007\/978-3-032-01887-8_16"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 678\u2013709. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Stewart, A.: A plausible attack on the adaptive security of threshold schnorr signatures. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 457\u2013479. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_15","DOI":"10.1007\/978-3-032-01887-8_15"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Das, S., Ren, L.: Adaptively secure BLS threshold signatures from DDH and co-CDH. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 251\u2013284. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_9","DOI":"10.1007\/978-3-031-68394-7_9"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.O.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO\u201987. LNCS, vol.\u00a0293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8","DOI":"10.1007\/3-540-48184-2_8"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Devevey, J., Passel\u00e8gue, A., Stehl\u00e9, D.: G+G: a fiat-shamir lattice signature based on convolved gaussians. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 37\u201364. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Ebrahimi, E., Yadav, A.: Strongly secure universal thresholdizer. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0III. LNCS, vol. 15486, pp. 207\u2013239. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0891-1_7","DOI":"10.1007\/978-981-96-0891-1_7"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"5_CR32","unstructured":"Gao, L., et al.: $$\\sf {TalonG}$$: bandwidth-efficient two-round threshold signatures from lattices. In: EUROCRYPT (2026)"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Genise, N., Micciancio, D., Peikert, C., Walter, M.: Improved discrete gaussian and subgaussian analysis for lattice cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020, Part\u00a0I. LNCS, vol. 12110, pp. 623\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_21","DOI":"10.1007\/978-3-030-45374-9_21"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC. pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR35","unstructured":"Gerhart, P., Calsi, D.L., Russo, L., Schr\u00f6der, D.: Fully-adaptive two-round threshold schnorr signatures from DDH. Cryptology ePrint Archive, Paper 2025\/1478 (2025). https:\/\/eprint.iacr.org\/2025\/1478"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"G\u00fcr, K.D., Katz, J., Silde, T.: Two-round threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0II. pp. 266\u2013300. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"5_CR37","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\u00a02024, Part\u00a0VII. 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":"5_CR38","doi-asserted-by":"publisher","unstructured":"Lu, G., Waters, B.: How to sample a discrete gaussian (and more) from a random oracle. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 653\u2013682. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_23","DOI":"10.1007\/978-3-031-22365-5_23"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"5_CR40","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"5_CR41","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820, pp. 204\u2013224. Springer, Cham (Apr\/May 2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8","DOI":"10.1007\/978-3-319-78381-9_8"},{"key":"5_CR42","unstructured":"Makriyannis, N.: On the classic protocol for MPC schnorr signatures. Cryptology ePrint Archive, Paper 2022\/1332 (2022). https:\/\/eprint.iacr.org\/2022\/1332"},{"key":"5_CR43","unstructured":"National institute of standards and technology: multi-party threshold cryptography (2018\u2013Present). https:\/\/csrc.nist.gov\/Projects\/threshold-cryp tography"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO\u00a02002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_8","DOI":"10.1007\/3-540-45708-9_8"},{"key":"5_CR45","unstructured":"Peikert, C.: A decade of lattice cryptography. Cryptology ePrint Archive, Report 2015\/939 (2015). https:\/\/eprint.iacr.org\/2015\/939"},{"key":"5_CR46","unstructured":"del Pino, R., Espitau, T., Niot, G., Prest, T.: Simple and efficient lattice threshold signatures with identifiable aborts. Cryptology ePrint Archive, Paper 2025\/871 (2025). https:\/\/eprint.iacr.org\/2025\/871"},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"Pino, R.D., Katsumata, S., Niot, G., Reichle, M., Takemure, K.: Unmasking TRaccoon: a lattice-based threshold signature with an efficient identifiable abort protocol. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 423\u2013456. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_14","DOI":"10.1007\/978-3-032-01887-8_14"},{"key":"5_CR48","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"5_CR49","doi-asserted-by":"publisher","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th FOCS. pp. 859\u2013870. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00086","DOI":"10.1109\/FOCS.2018.00086"},{"key":"5_CR50","doi-asserted-by":"publisher","unstructured":"Takashima, K., Takayasu, A.: Tighter security for efficient lattice cryptography via the R\u00e9nyi divergence of optimized orders. In: Au, M.H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol.\u00a09451, pp. 412\u2013431. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_23","DOI":"10.1007\/978-3-319-26059-4_23"},{"key":"5_CR51","doi-asserted-by":"publisher","unstructured":"Zhu, C., Tessaro, S.: The algebraic one-more MISIS problem and applications to threshold signatures. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0I. LNCS, vol. 16000, pp. 548\u2013581. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_18","DOI":"10.1007\/978-3-032-01855-7_18"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:56:12Z","timestamp":1778165772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_5","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"}}]}}