{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:35:11Z","timestamp":1786530911249,"version":"3.56.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354143","type":"print"},{"value":"9783032354150","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-35415-0_14","type":"book-chapter","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:01:23Z","timestamp":1786528883000},"page":"426-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Blind Signatures from\u00a0Arguments of\u00a0Inequality"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kloo\u00df","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abe, M.: A secure three-move blind signature scheme for polynomially many signatures. In: EUROCRYPT 2001. LNCS. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_9","DOI":"10.1007\/3-540-44987-6_9"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0034851","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"M Abe","year":"1996","unstructured":"Abe, M., Fujisaki, E.: How to date blind signatures. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 244\u2013251. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034851"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: CRYPTO 2000. LNCS. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_17","DOI":"10.1007\/3-540-44598-6_17"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Alkadri, N.A., Harasser, P., Janson, C.: BlindOR: an efficient lattice-based blind signature scheme from OR-Proofs. In: CANS 21. LNCS. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_6","DOI":"10.1007\/978-3-030-92548-2_6"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-Key model and a general forking lemma. In: ACM CCS 2006. ACM Press (2006). https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. In: EUROCRYPT 2021, Part I. LNCS. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2","DOI":"10.1007\/978-3-030-77870-5_2"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"den Boer, B.: Diffie-hellman is as strong as discrete log for certain primes (rump session). In: CRYPTO\u201988. LNCS. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_38","DOI":"10.1007\/0-387-34799-2_38"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Bollauf, M.F., Parisella, R., Siim, J.: Revisiting discrete logarithm reductions. In: CiC 2 (2025). https:\/\/doi.org\/10.62056\/a0c3c3c2h","DOI":"10.62056\/a0c3c3c2h"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography (extended abstract). In: CRYPTO\u201996. LNCS. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_22","DOI":"10.1007\/3-540-68697-5_22"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Brands, S.: Untraceable off-line cash in wallets with observers (extended abstract). In: CRYPTO\u201993. LNCS. Springer, Berlin, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_26","DOI":"10.1007\/3-540-48329-2_26"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Brandt, N., Hofheinz, D., Kloo\u00df, M., Reichle, M.: Tightly-secure blind signatures in pairing-free groups. In: ASIACRYPT 2025, Part VI. LNCS. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-5119-4_11","DOI":"10.1007\/978-981-95-5119-4_11"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for nontransferable anonymous credentials with optional anonymity revocation. In: EUROCRYPT 2001. LNCS. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7","DOI":"10.1007\/3-540-44987-6_7"},{"key":"14_CR13","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: CRYPTO 2022, Part III. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_1","DOI":"10.1007\/978-3-031-15982-4_1"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Pairing-Free blind signatures from CDH assumptions. In: CRYPTO 2024, Part I. LNCS. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_6","DOI":"10.1007\/978-3-031-68376-3_6"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO\u201982. Plenum Press, New York, USA (1982). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chaum, D.:Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. In: EUROCRYPT\u201988. LNCS. Springer,Berlin, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_15","DOI":"10.1007\/3-540-45961-8_15"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: CRYPTO\u201988. LNCS. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_25","DOI":"10.1007\/0-387-34799-2_25"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO\u201994. LNCS. Springer, Berlin, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19","DOI":"10.1007\/3-540-48658-5_19"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Snowblind: a threshold blind signature in pairing-free groups. In: CRYPTO 2023, Part I. LNCS. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_23","DOI":"10.1007\/978-3-031-38557-5_23"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Davidson, A., Goldberg, I., Sullivan, N., Tankersley, G., Valsorda, F.: Privacy pass: bypassing internet challenges anonymously. In: PoPETs 3 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","DOI":"10.1515\/popets-2018-0026"},{"key":"14_CR21","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: EUROCRYPT 2024, Part VI. LNCS. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_13","DOI":"10.1007\/978-3-031-58751-1_13"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. In: PKC 2023, Part I. LNCS. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_15","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO\u201986. LNCS. Springer, Berlin, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: CRYPTO 2006. LNCS. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_4","DOI":"10.1007\/11818175_4"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: CRYPTO 2018, Part II. LNCS. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Plouviez, A., Seurin, Y.: Blind schnorr signatures and signed elgamal encryption in the algebraic group model. In: EUROCRYPT 2020, Part II. LNCS. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3","DOI":"10.1007\/978-3-030-45724-2_3"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: AUSCRYPT. Springer (1992)","DOI":"10.1007\/3-540-57220-1_66"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Hanzlik, L., Lai, Y., Mula, M., Paracucchi, E., Slamanig, D., Tang, G.: Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions. In: ASIACRYPT 2025, Part IV. LNCS. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-5113-2_2","DOI":"10.1007\/978-981-95-5113-2_2"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Hanzlik, L., Loss, J., Wagner, B.: Rai-choo! evolving blind signatures to the next level. In: EUROCRYPT 2023, Part V. LNCS. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_26","DOI":"10.1007\/978-3-031-30589-4_26"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Hauck, E., Kiltz, E., Loss, J.: A modular treatment of blind signatures from identification schemes. In: EUROCRYPT 2019, Part III. LNCS. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_12","DOI":"10.1007\/978-3-030-17659-4_12"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Hauck, E., Kiltz, E., Loss, J., Nguyen, N.K.: Lattice-Based blind signatures, revisited. In: CRYPTO 2020, Part II. LNCS. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_18","DOI":"10.1007\/978-3-030-56880-1_18"},{"key":"14_CR32","unstructured":"Hendrickson, S., Iyengar, J., Pauly, T., Valdez, S., Wood, C.A.: Private Access tokens. internet-draft draft-private-accesstokens-01. work in progress (2022). https:\/\/datatracker.ietf.org\/doc\/draft-private-access-tokens\/"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Xu, J.: On pairing-free blind signature schemes in the algebraic group model. In: PKC 2022, Part II. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_16","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Xu, J.: The abe-okamoto partially blind signature scheme revisited. In: ASIACRYPT 2022, Part IV. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_10","DOI":"10.1007\/978-3-031-22972-5_10"},{"key":"14_CR35","unstructured":"Kastner, J., Tessaro, S., Zaverucha, G.: Round-optimal pairing-free blind signatures. Cryptology ePrint Archive, Paper 2026\/091 (2026). https:\/\/eprint.iacr.org\/2026\/091"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Lai, Y., Reichle, M.: Breaking parallel ROS: implication for isogeny and lattice-based blind signatures. In: PKC 2024, Part I. LNCS. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57718-5_11","DOI":"10.1007\/978-3-031-57718-5_11"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Sakai, Y.: Practical round-optimal blind signatures in the ROM from standard assumptions. In: ASIACRYPT 2023, Part II. LNCS. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_12","DOI":"10.1007\/978-981-99-8724-5_12"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Katz, J., Loss, J., Rosenberg, M.: Boosting the security of blind signature schemes. In: ASIACRYPT 2021, Part IV. LNCS. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_16","DOI":"10.1007\/978-3-030-92068-5_16"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Reichle, M.: Blind signatures from proofs of inequality. In: CRYPTO 2025, Part VI. LNCS. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_6","DOI":"10.1007\/978-3-032-01887-8_6"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Reichle, M., Wagner, B.: Practical blind signatures in pairing-free groups. In: ASIACRYPT 2024, Part I. LNCS. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_12","DOI":"10.1007\/978-981-96-0875-1_12"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Maurer, U.: Zero-knowledge proofs of knowledge for group homomorphisms. Des. Codes Crypt. 77, 663\u2013676 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0103-5","DOI":"10.1007\/s10623-015-0103-5"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the diffie-hellman protocol and computing discrete algorithms. In: CRYPTO\u201994. LNCS. Springer, Berlin, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_26","DOI":"10.1007\/3-540-48658-5_26"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Maurer, U.M., Wolf, S.: Diffie-hellman oracles. In: CRYPTO\u201996. LNCS. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_21","DOI":"10.1007\/3-540-68697-5_21"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Ohta, K.: Universal electronic cash. In: CRYPTO\u201991. LNCS. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_27","DOI":"10.1007\/3-540-46766-1_27"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"Pointcheval, D.: Strengthened security for blind signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 391\u2013405. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054141","DOI":"10.1007\/BFb0054141"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000). https:\/\/doi.org\/10.1007\/s001450010003","DOI":"10.1007\/s001450010003"},{"key":"14_CR47","unstructured":"Reichle, M., Reinke, Z.: Threshold blind signatures from CDH. Cryptology ePrint Archive, Paper 2025\/1798 (2025). https:\/\/eprint.iacr.org\/2025\/1798"},{"key":"14_CR48","doi-asserted-by":"publisher","unstructured":"Schnorr, C.: Efficient identification and signatures for smart cards. In: CRYPTO\u201989. LNCS. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: EUROCRYPT 2022, Part II. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_27","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"14_CR50","doi-asserted-by":"publisher","unstructured":"Wagner, D.: A generalized birthday problem. In: CRYPTO 2002. LNCS. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35415-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:01:28Z","timestamp":1786528888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35415-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354143","9783032354150"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35415-0_14","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":"13 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}