{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:25:55Z","timestamp":1768926355617,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","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-032-01855-7_16","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:32Z","timestamp":1755373292000},"page":"477-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Lattice Blind Signatures from\u00a0Recycled Entropy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2869-3833","authenticated-orcid":false,"given":"Corentin","family":"Jeudy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1283-7257","authenticated-orcid":false,"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., Yadav, A.: Practical, round-optimal lattice-based blind signatures. In: CCS (2022). https:\/\/doi.org\/10.1145\/3548606.3560650","DOI":"10.1145\/3548606.3560650"},{"key":"16_CR2","doi-asserted-by":"publisher","DOI":"10.1145\/2815111.2815158","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J., Fitzpatrick, R., Perret, L.: Algebraic algorithms for LWE problems. ACM Commun. Comput. Algebra (2015). https:\/\/doi.org\/10.1145\/2815111.2815158","journal-title":"ACM Commun. Comput. Algebra"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. (2015)","DOI":"10.1515\/jmc-2015-0016"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Alkadri, N.A., Bansarkhani, R.E., Buchmann, J.: BLAZE: practical lattice-based blind signatures for privacy-preserving applications. In: Financial Cryptography and Data Security (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_26","DOI":"10.1007\/978-3-030-51280-4_26"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Argo, S., G\u00fcneysu, T., Jeudy, C., Land, G., Roux-Langlois, A., Sanders, O.: Practical post-quantum signatures for privacy. In: CCS (2024). https:\/\/doi.org\/10.1145\/3658644.3670297","DOI":"10.1145\/3658644.3670297"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: ICALP (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. (1993)","DOI":"10.1007\/BF01445125"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: EUROCRYPT (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38","DOI":"10.1007\/3-540-39200-9_38"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. J. Cryptol. (2003)","DOI":"10.1007\/3-540-46088-8_25"},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-022-09436-0","author":"F Benhamouda","year":"2022","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. J. Cryptol. (2022). https:\/\/doi.org\/10.1007\/S00145-022-09436-0","journal-title":"J. Cryptol."},{"key":"16_CR11","unstructured":"Bernhard, D., Warinschi, B.: Cryptographic voting - a gentle introduction. IACR Cryptology ePrint Archive, p. 765 (2016)"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. In: CCS (2023). https:\/\/doi.org\/10.1145\/3576915.3616613","DOI":"10.1145\/3576915.3616613"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792543","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM (2003). https:\/\/doi.org\/10.1145\/792538.792543","journal-title":"J. ACM"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9005-7","journal-title":"J. Cryptol."},{"key":"16_CR15","unstructured":"Bouaziz-Ermann, S., Canard, S., Eberhart, G., Kaim, G., Roux-Langlois, A., Traor\u00e9, J.: Lattice-based (partially) blind signature without restart. IACR Cryptology ePrint Archive, p.\u00a0260 (2020)"},{"key":"16_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-022-09441-3","author":"K Boudgoust","year":"2023","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: On the hardness of module learning with errors with short distributions. J. Cryptol. (2023). https:\/\/doi.org\/10.1007\/s00145-022-09441-3","journal-title":"J. Cryptol."},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: CCS (2004). https:\/\/doi.org\/10.1145\/1030083.1030103","DOI":"10.1145\/1030083.1030103"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268\u2013289. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_20"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199\u2013203. Springer, Boston, MA (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18"},{"key":"16_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-4730-9_14","volume-title":"CRYPTO","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signature system. In: Chaum, D. (ed.) CRYPTO. Springer, Boston (1983). https:\/\/doi.org\/10.1007\/978-1-4684-4730-9_14"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"16_CR24","unstructured":"Chen, Y.: R\u00e9duction de R\u00e9seau et S\u00e9curit\u00e9 Concr\u00e8te du Chiffrement Compl\u00e8tement Homomorphe. Ph.D. thesis, Paris 7 (2013)"},{"key":"16_CR25","unstructured":"Cheon, J.H., et al.: HAETAE: shorter lattice-based fiat-shamir signatures. IACR Cryptology ePrint Archive, p.\u00a0624 (2023)"},{"key":"16_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/978-3-031-38557-5_23","volume-title":"CRYPTO 2023","author":"EC Crites","year":"2023","unstructured":"Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Snowblind: a threshold blind signature in pairing-free groups. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14081, pp. 710\u2013742. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_23"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11818175_4","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Fischlin","year":"2006","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 60\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_4"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-45374-9_21","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"N Genise","year":"2020","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 2020. LNCS, vol. 12110, pp. 623\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_21"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"16_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_18","author":"E Hauck","year":"2020","unstructured":"Hauck, E., Kiltz, E., Loss, J., Nguyen, N.K.: Lattice-based blind signatures. Revisited. In: CRYPTO (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_18","journal-title":"Revisited. In: CRYPTO"},{"key":"16_CR31","unstructured":"Hub, B.I., Bank, S.N.: Project Tourbillon: Exploring privacy, security and scalability for CBDCs (2023). https:\/\/www.bis.org\/publ\/othp80.pdf"},{"key":"16_CR32","unstructured":"ISO\/IEC: ISO\/IEC 18370-1:2016 Information Technology\u2014Security Techniques\u2014Blind digital signatures (2016). https:\/\/www.iso.org\/standard\/62288.html"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-031-38545-2_12","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"C Jeudy","year":"2023","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols. Application to anonymous credentials. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 351\u2013383. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Sanders, O.: Improved lattice blind signatures from recycled entropy. IACR Cryptology ePrint Archive, p.\u00a01289 (2024)","DOI":"10.1007\/978-3-032-01855-7_16"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Sanders, O.: Worst-case lattice sampler with truncated gadgets and applications. IACR Cryptology ePrint Archive, p.\u00a01952 (2024)","DOI":"10.1007\/978-981-95-5099-9_7"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BFB0052233","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"A Juels","year":"1997","unstructured":"Juels, A., Luby, M., Ostrovsky, R.: Security of blind digital signatures (extended abstract). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150\u2013164. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFB0052233"},{"issue":"3","key":"16_CR37","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53890-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 373\u2013403. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_13"},{"key":"16_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-78440-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"V Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V.: Lattice-based identification schemes secure under active attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 162\u2013179. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78440-1_10"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-031-22972-5_4","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K.: BLOOM: bimodal lattice one-out-of-many proofs and applications. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 95\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_4"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-92068-5_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plancon, M., Seiler, G.: Shorter lattice-based group signatures via\u00a0\u201cAlmost Free\u2019\u2019 encryption and\u00a0other optimizations. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 218\u2013248. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_8"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 215\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"16_CR45","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"16_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-031-15979-4_11","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"R del Pino","year":"2022","unstructured":"del Pino, R., Katsumata, S.: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 36\u2013336. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_11"},{"key":"16_CR48","doi-asserted-by":"publisher","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In: CCS (2018). https:\/\/doi.org\/10.1145\/3243734.3243852","DOI":"10.1145\/3243734.3243852"},{"key":"16_CR49","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: CT-RSA (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"16_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/S001450010003","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. (2000). https:\/\/doi.org\/10.1007\/S001450010003","journal-title":"J. Cryptol."},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-17373-8_24","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Lattice-based blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 413\u2013430. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_24"},{"key":"16_CR52","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":"16_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-031-07085-3_27","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"S Tessaro","year":"2022","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 782\u2013811. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_27"},{"key":"16_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"DA Wagner","year":"2002","unstructured":"Wagner, D.A.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:50Z","timestamp":1768850510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_16","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}