{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:45:44Z","timestamp":1778215544052,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551125","type":"print"},{"value":"9789819551132","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5113-2_2","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:35Z","timestamp":1765122215000},"page":"35-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions"],"prefix":"10.1007","author":[{"given":"Lucjan","family":"Hanzlik","sequence":"first","affiliation":[]},{"given":"Yi-Fu","family":"Lai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5953-8724","authenticated-orcid":false,"given":"Marzio","family":"Mula","sequence":"additional","affiliation":[]},{"given":"Eugenio","family":"Paracucchi","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Slamanig","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., Yadav, A.: Practical, round-optimal lattice-based blind signatures. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 39\u201353. ACM Press, November 2022. https:\/\/doi.org\/10.1145\/3548606.3560650","DOI":"10.1145\/3548606.3560650"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-55304-3_3","volume-title":"Information Security and Privacy","author":"N Alkeilani Alkadri","year":"2020","unstructured":"Alkeilani Alkadri, N., El Bansarkhani, R., Buchmann, J.: On lattice-based interactive protocols: an approach with less or no aborts. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 41\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_3"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-92548-2_6","volume-title":"Cryptology and Network Security","author":"N Alkeilani Alkadri","year":"2021","unstructured":"Alkeilani Alkadri, N., Harasser, P., Janson, C.: BlindOR: an\u00a0Efficient Lattice-Based Blind Signature Scheme from\u00a0OR-Proofs. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 95\u2013115. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_6"},{"key":"2_CR5","unstructured":"Baldi, M., et al.: LESS \u2014 Linear Equivalence Signature Scheme. Tech. rep., National Institute of Standards and Technology (2024). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"2_CR6","unstructured":"Baldi, M., et al.: LESS \u2014 Linear Equivalence Signature Scheme. Tech. rep., National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"2_CR7","unstructured":"Baldi, M., et al.: The less signature scheme (2023). https:\/\/www.less-project.com\/"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/23799927.2022.2048206","volume":"7","author":"A Barenghi","year":"2022","unstructured":"Barenghi, A., Biasse, J.F., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112\u2013128 (2022). https:\/\/doi.org\/10.1080\/23799927.2022.2048206","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Battagliola, M., Borin, G., Di Crescenzo, G., Meneghetti, A., Persichetti, E.: Enhancing threshold group action signature schemes: Adaptive security and scalability improvements. Cryptology ePrint Archive, Report 2025\/085 (2025). https:\/\/eprint.iacr.org\/2025\/085","DOI":"10.1007\/978-3-031-86599-2_5"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Battagliola, M., Borin, G., Meneghetti, A., Persichetti, E.: Cutting the GRASS: Threshold GRoup action signature schemes. In: Oswald, E. (ed.) Topics in Cryptology \u2013 CT-RSA\u00a02024. LNCS, vol. 14643, pp. 460\u2013489. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_18","DOI":"10.1007\/978-3-031-58868-6_18"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-92068-5_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"B Bauer","year":"2021","unstructured":"Bauer, B., Fuchsbauer, G., Plouviez, A.: The one-more discrete logarithm assumption in\u00a0the\u00a0generic group model. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 587\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_20"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-77870-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 33\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Beullens, W., Dobson, S., Katsumata, S., Lai, Y.F., Pintore, F.: Group signatures and more from isogenies and lattices: Generic, simple, and efficient. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13276, pp. 95\u2013126. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_4","DOI":"10.1007\/978-3-031-07085-3_4"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-64834-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 464\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: Efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02019, Part\u00a0I. Lecture Notes in Computer Science, vol. 11921, pp. 227\u2013247. Springer, Cham (Dec 2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: Short, efficient, and round-optimal. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023: 30th Conference on Computer and Communications Security, pp. 16\u201329. ACM Press, November 2023. https:\/\/doi.org\/10.1145\/3576915.3616613","DOI":"10.1145\/3576915.3616613"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: Code-based signatures without syndromes. In: Nitaj, A., Youssef, A.M. (eds.) AFRICACRYPT 20: 12th International Conference on Cryptology in Africa. LNCS, vol. 12174, pp. 45\u201365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"2_CR18","unstructured":"Bl\u00e4ser, M., et al.: ALTEQ. Tech. rep., National Institute of Standards and Technology (2023), https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC\u00a02003: 6th International Workshop on Theory and Practice in Public Key Cryptography. Lecture Notes in Computer Science, vol.\u00a02567, pp. 31\u201346. Springer, Berlin, Heidelberg (Jan 2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3","DOI":"10.1007\/3-540-36288-6_3"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Boneh, D., Guan, J., Zhandry, M.: A lower bound on the length of signatures based on group actions and generic isogenies. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 507\u2013531. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_18","DOI":"10.1007\/978-3-031-30589-4_18"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-26948-7_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Bootle","year":"2019","unstructured":"Bootle, J., Lyubashevsky, V., Seiler, G.: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 176\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_7"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Budroni, A., Chi-Dom\u00ednguez, J.J., D\u2019Alconzo, G., Scala, A.J.D., Kulkarni, M.: Don\u2019t use it twice! Solving relaxed linear equivalence problems. In: Advances in Cryptology \u2013 ASIACRYPT\u00a02024, Part\u00a0VIII. pp. 35\u201365. LNCS, Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0944-4_2","DOI":"10.1007\/978-981-96-0944-4_2"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Hanzlik, L., Loss, J., Lysyanskaya, A., Wagner, B.: PI-cut-choo and friends: Compact blind signatures via parallel instance cut-and-choose and more. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 3\u201331. Springer, Cham (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_1","DOI":"10.1007\/978-3-031-15982-4_1"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology \u2013 CRYPTO\u201982. pp. 199\u2013203. Plenum Press, New York (1982). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Chen, M., Leroux, A., Panny, L.: SCALLOP-HD: group action from 2-dimensional isogenies. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0III. LNCS, vol. 14603, pp. 190\u2013216. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_7","DOI":"10.1007\/978-3-031-57725-3_7"},{"key":"2_CR27","unstructured":"Chou, T., Niederhagen, R., Persichetti, E., Ran, L., Randrianarisoa, T.H., Reijnders, K., Samardjiska, S., Trimoska, M.: MEDS \u2014 Matrix Equivalence Digital Signature. Tech. rep. , National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Cong, K., Lai, Y.F., Levin, S.: Efficient isogeny proofs using generic techniques. In: Tibouchi, M., Wang, X. (eds.) ACNS 23: 21st International Conference on Applied Cryptography and Network Security, Part\u00a0II. LNCS, vol. 13906, pp. 248\u2013275. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_10","DOI":"10.1007\/978-3-031-33491-7_10"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Dartois, P., et al.: Pegasis: practical effective class group action using 4-dimensional isogenies. In: Tauman\u00a0Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025, pp. 67\u201399. Springer, Cham (2025)","DOI":"10.1007\/978-3-032-01855-7_3"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1515\/popets-2018-0026","volume":"2018","author":"A Davidson","year":"2018","unstructured":"Davidson, A., Goldberg, I., Sullivan, N., Tankersley, G., Valsorda, F.: Privacy pass: bypassing internet challenges anonymously. Proc. Privacy Enhancing Technol. 2018(3), 164\u2013180 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"De Feo, L., Fouotsa, T.B., Kutas, P., Leroux, A., Merz, S.P., Panny, L., Wesolowski, B.: SCALLOP: Scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. LNCS, vol. 13940, pp. 345\u2013375. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: Compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-45388-6_7","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Meyer, M.: Threshold schemes from isogeny assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 187\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Do, K., Hanzlik, L., Paracucchi, E.: M &M\u2019S: Mix and match attacks on Schnorr-type blind signatures with repetition. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 363\u2013387. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_13","DOI":"10.1007\/978-3-031-58751-1_13"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.P.J.: Hawk: Module LIP makes lattice signatures fast, compact and simple. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 65\u201394. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. LNCS, vol. 13940, pp. 406\u2013435. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_15","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors, pp. 387\u2013424. LNCS, Springer, Cham, Aug 2024. https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: Dwork, C. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02006. LNCS, vol.\u00a04117, pp. 60\u201377. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_4","DOI":"10.1007\/11818175_4"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Hanser, C., Kamath, C., Slamanig, D.: Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Zikas, V., De Prisco, R. (eds.) SCN 16: 10th International Conference on Security in Communication Networks. LNCS, vol.\u00a09841, pp. 391\u2013408. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_21","DOI":"10.1007\/978-3-319-44618-9_21"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 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"},{"issue":"3","key":"2_CR42","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991). https:\/\/doi.org\/10.1145\/116825.116852","journal-title":"J. ACM"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Hanzlik, L., Loss, J., Wagner, B.: Rai-choo! Evolving blind signatures to the next level. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 753\u2013783. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_26","DOI":"10.1007\/978-3-031-30589-4_26"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-17659-4_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Hauck","year":"2019","unstructured":"Hauck, E., Kiltz, E., Loss, J.: A modular treatment of blind signatures from identification schemes. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 345\u2013375. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_12"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-56880-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Hauck","year":"2020","unstructured":"Hauck, E., Kiltz, E., Loss, J., Nguyen, N.K.: Lattice-based blind signatures, revisited. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 500\u2013529. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_18"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"Heilman, E., Alshenibr, L., Baldimtsi, F., Scafuro, A., Goldberg, S.: TumbleBit: An untrusted bitcoin-compatible anonymous payment hub. In: ISOC Network and Distributed System Security Symposium \u2013 NDSS\u00a02017. The Internet Society, Feb\/Mar 2017. https:\/\/doi.org\/10.14722\/ndss.2017.23086","DOI":"10.14722\/ndss.2017.23086"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Xu, J.: The Abe-Okamoto partially blind signature scheme revisited. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_10","DOI":"10.1007\/978-3-031-22972-5_10"},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Lai, Y.F., LeGrow, J.T., Qin, L.: CSI-Otter: Isogeny-based (partially) blind signatures from the class group action with a twist. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0III. LNCS, vol. 14083, pp. 729\u2013761. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_24","DOI":"10.1007\/978-3-031-38548-3_24"},{"key":"2_CR49","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Lai, Y.F., Reichle, M.: Breaking parallel ROS: implication for isogeny and lattice-based blind signatures. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. LNCS, vol. 14601, pp. 319\u2013351. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57718-5_11","DOI":"10.1007\/978-3-031-57718-5_11"},{"key":"2_CR50","doi-asserted-by":"publisher","unstructured":"Lai, Y.F.: Capybara and tsubaki: Verifiable random functions from group actions and isogenies. IACR Communications in Cryptology (CiC) 1(3), 1 (2024). https:\/\/doi.org\/10.62056\/avr-11zn4","DOI":"10.62056\/avr-11zn4"},{"key":"2_CR51","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. Lecture Notes in Computer Science, vol.\u00a05912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"2_CR52","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"2_CR53","doi-asserted-by":"publisher","unstructured":"Meers, J., Riepel, D.: CCA secure updatable encryption from non-mappable group actions. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0I. pp. 137\u2013169. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_5","DOI":"10.1007\/978-3-031-62743-9_5"},{"key":"2_CR54","doi-asserted-by":"publisher","unstructured":"Persichetti, E., Santini, P.: A new formulation of the linear equivalence problem and shorter LESS signatures. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 351\u2013378. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_12","DOI":"10.1007\/978-981-99-8739-9_12"},{"key":"2_CR55","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 306\u2013336. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_11","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"2_CR56","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology 13(3), 361\u2013396 (2000). https:\/\/doi.org\/10.1007\/s001450010003","DOI":"10.1007\/s001450010003"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5113-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T15:43:36Z","timestamp":1765122216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5113-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551125","9789819551132"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5113-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}