{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:35:18Z","timestamp":1786530918020,"version":"3.56.0"},"publisher-location":"Cham","reference-count":59,"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_13","type":"book-chapter","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:02:13Z","timestamp":1786528933000},"page":"393-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing Tag with\u00a0Okamoto-Schnorr: Three-Move Pairing-Free Blind Signatures from\u00a0DDH"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1990-1329","authenticated-orcid":false,"given":"Rutchathon","family":"Chairattana-Apirom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-5472","authenticated-orcid":false,"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3751-8546","authenticated-orcid":false,"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,13]]},"reference":[{"key":"13_CR1","unstructured":"iCloud private relay overview. https:\/\/www.apple.com\/privacy\/docs\/iCloud_Private_Relay_Overview_Dec2021.PDF"},{"key":"13_CR2","unstructured":"PCM: Click fraud prevention and attribution sent to advertiser. https:\/\/webkit.org\/blog\/11940\/pcm-click-fraud-prevention-and-attribution-sent-to-advertiser\/. Accessed 30 Sept 2021"},{"key":"13_CR3","unstructured":"Trust tokens. https:\/\/developer.chrome.com\/docs\/privacy-sandbox\/trust-tokens\/"},{"key":"13_CR4","unstructured":"VPN by Google One, explained. https:\/\/one.google.com\/about\/vpn\/howitworks"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Abe, M.: A secure three-move blind signature scheme for polynomially many signatures. In: Pfitzmann, B. (ed.) EUROCRYPT\u00a02001. LNCS, vol.\u00a02045, pp. 136\u2013151. Springer, Berlin, Heidelberg (May 2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_9","DOI":"10.1007\/3-540-44987-6_9"},{"key":"13_CR6","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":"13_CR7","doi-asserted-by":"publisher","unstructured":"Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: Bellare, M. (ed.) CRYPTO\u00a02000. LNCS, vol.\u00a01880, pp. 271\u2013286. Springer, Berlin, Heidelberg (Aug 2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_17","DOI":"10.1007\/3-540-44598-6_17"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Alkeilani Alkadri, N., Harasser, P., Janson, C.: BlindOR: an efficient lattice-based blind signature scheme from OR-proofs. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 21. LNCS, vol. 13099, pp. 95\u2013115. Springer, Cham (Dec 2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_6","DOI":"10.1007\/978-3-030-92548-2_6"},{"key":"13_CR9","unstructured":"American National Standards Institute, Inc.: ANSI X9.62 public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA) (Nov 16, 2005). https:\/\/standards.globalspec.com\/std\/1955141\/ANSI%20X9.62"},{"issue":"11","key":"13_CR10","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2007.907471","volume":"53","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., Kurosawa, K., Staddon, J.: Multi-recipient encryption schemes: Efficient constructions and their security. IEEE Trans. Inf. Theory 53(11), 3927\u20133943 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93, pp. 62\u201373. ACM Press (Nov 1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"13_CR12","doi-asserted-by":"publisher","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\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 33\u201353. Springer, Cham (Oct 2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2","DOI":"10.1007\/978-3-030-77870-5_2"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-022-09436-0","volume":"35","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. 35(4), 25 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09436-0","journal-title":"J. Cryptol."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012). https:\/\/doi.org\/10.1007\/s13389-012-0027-1","journal-title":"J. Cryptogr. Eng."},{"key":"13_CR15","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. LNCS, 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":"13_CR16","doi-asserted-by":"publisher","unstructured":"Brandt, N., Hofheinz, D., Kloo\u00df, M., Reichle, M.: Tightly-secure blind signatures in pairing-free groups. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT\u00a02025, Part\u00a0VI. LNCS, vol. 16250, pp. 337\u2013369. Springer, Singapore (Dec 2025). https:\/\/doi.org\/10.1007\/978-981-95-5119-4_11","DOI":"10.1007\/978-981-95-5119-4_11"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Celi, S., Davidson, A., Valdez, S., Wood, C.A.: Privacy Pass Issuance Protocols. RFC 9578 (Jun 2024). https:\/\/doi.org\/10.17487\/RFC9578, https:\/\/www.rfc-editor.org\/info\/rfc9578","DOI":"10.17487\/RFC9578"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Harding, F., Lysyanskaya, A., Tessaro, S.: Server-aided anonymous credentials. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 291\u2013324. Springer, Cham (Aug 2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_10","DOI":"10.1007\/978-3-032-01887-8_10"},{"key":"13_CR19","unstructured":"Chairattana-Apirom, R., Reichle, M., Tessaro, S.: Playing tag with okamoto-schnorr: Three-move pairing-free blind signatures from DDH. Cryptology ePrint Archive, Paper 2026\/571 (2026). https:\/\/eprint.iacr.org\/2026\/571"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Pairing-free blind signatures from CDH assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 174\u2013209. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_6","DOI":"10.1007\/978-3-031-68376-3_6"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Chase, M., Meiklejohn, S., Zaverucha, G.: Algebraic MACs and keyed-verification anonymous credentials. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 1205\u20131216. ACM Press (Nov 2014). https:\/\/doi.org\/10.1145\/2660267.2660328","DOI":"10.1145\/2660267.2660328"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO\u201982, pp. 199\u2013203. 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":"13_CR23","doi-asserted-by":"publisher","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO\u201988. LNCS, vol.\u00a0403, pp. 319\u2013327. Springer, New York (Aug 1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_25","DOI":"10.1007\/0-387-34799-2_25"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO\u201992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Berlin, Heidelberg (Aug 1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7","DOI":"10.1007\/3-540-48071-4_7"},{"key":"13_CR25","unstructured":"Chen, Y.: Three-move blind signatures in pairing-free groups. To appear at CRYPTO 2026 (2026). https:\/\/eprint.iacr.org\/2026\/593"},{"key":"13_CR26","unstructured":"Ciampi, M., Monica, P.D., Visconti, I.: Round-optimal GUC-secure blind signatures from minimal computational and setup assumptions. Cryptology ePrint Archive, Paper 2026\/145 (2026) https:\/\/eprint.iacr.org\/2026\/145"},{"key":"13_CR27","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: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 710\u2013742. Springer, Cham (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_23","DOI":"10.1007\/978-3-031-38557-5_23"},{"issue":"3","key":"13_CR28","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. PoPETs 2018(3), 164\u2013180 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","journal-title":"PoPETs"},{"key":"13_CR29","unstructured":"Dietz, M., Kastner, J., Tessaro, S.: On the impossibility of round-optimal pairing-free blind signatures in the ROM. To appear at CRYPTO 2026 (2026). https:\/\/eprint.iacr.org\/2026\/090"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0II. LNCS, vol.\u00a08043, pp. 129\u2013147. Springer, Berlin, Heidelberg (Aug 2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Round-optimal composable blind signatures in the common reference string model. In: Dwork, C. (ed.) CRYPTO\u00a02006. LNCS, vol.\u00a04117, pp. 60\u201377. Springer, Berlin, Heidelberg (Aug 2006). https:\/\/doi.org\/10.1007\/11818175_4","DOI":"10.1007\/11818175_4"},{"key":"13_CR32","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 (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Plouviez, A., Seurin, Y.: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 63\u201395. Springer, Cham (May 2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3","DOI":"10.1007\/978-3-030-45724-2_3"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT\u201992. LNCS, vol.\u00a0718, pp. 244\u2013251. Springer, Berlin, Heidelberg (Dec 1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_66","DOI":"10.1007\/3-540-57220-1_66"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Berlin, Heidelberg (Apr 2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Hauck, E., Kiltz, E., Loss, J.: A modular treatment of blind signatures from identification schemes. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478, pp. 345\u2013375. Springer, Cham (May 2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_12","DOI":"10.1007\/978-3-030-17659-4_12"},{"key":"13_CR37","unstructured":"Hendrickson, S., Iyengar, J., Pauly, T., Valdez, S., Wood, C.A.: Private Access Tokens. Internet-Draft draft-private-access-tokens-01, Internet Engineering Task Force (Oct 2021). https:\/\/datatracker.ietf.org\/doc\/html\/draft-private-access- tokens-01, work in Progress"},{"key":"13_CR38","unstructured":"Huang, S., et al.: DIT: De-Identified Authenticated Telemetry at Scale. Tech. rep. (Apr 2021). https:\/\/research.fb.com\/wp-content\/uploads\/2021\/04\/DIT-De- Identified-Authenticated-Telemetry-at-Scale_final.pdf"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BFb0052233","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"A Juels","year":"1997","unstructured":"Juels, A., Luby, M., Ostrovsky, R.: Security of blind digital signatures. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150\u2013164. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052233"},{"key":"13_CR40","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.) ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 279\u2013309. Springer, Cham (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_10","DOI":"10.1007\/978-3-031-22972-5_10"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Xu, J.: On pairing-free blind signature schemes in the algebraic group model. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0II. LNCS, vol. 13178, pp. 468\u2013497. Springer, Cham (Mar 2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_16","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"13_CR42","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":"13_CR43","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Sakai, Y.: Practical round-optimal blind signatures in the ROM from standard assumptions. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14439, pp. 383\u2013417. Springer, Singapore (Dec 2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_12","DOI":"10.1007\/978-981-99-8724-5_12"},{"key":"13_CR44","unstructured":"Kloo\u00df, M., Lai, R.W.F., Reichle, M.: Blind signatures from arguments of inequality. Cryptology ePrint Archive, Report 2025\/1886 (2025). https:\/\/eprint.iacr.org\/2025\/1886"},{"key":"13_CR45","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Reichle, M.: Blind signatures from proofs of inequality. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 157\u2013189. Springer, Cham (Aug 2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_6","DOI":"10.1007\/978-3-032-01887-8_6"},{"key":"13_CR46","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Reichle, M., Wagner, B.: Practical blind signatures in pairing-free groups. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0I. LNCS, vol. 15484, pp. 363\u2013395. Springer, Singapore (Dec 2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_12","DOI":"10.1007\/978-981-96-0875-1_12"},{"key":"13_CR47","doi-asserted-by":"publisher","unstructured":"Maurer, U.: Zero-knowledge proofs of knowledge for group homomorphisms. DCC 77(2-3), 663\u2013676 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0103-5","DOI":"10.1007\/s10623-015-0103-5"},{"key":"13_CR48","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography (invited paper). In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Berlin, Heidelberg (Dec 2005). https:\/\/doi.org\/10.1007\/11586821_1","DOI":"10.1007\/11586821_1"},{"key":"13_CR49","unstructured":"Ohkubo, M., Abe, M.: Security of some three-move blind signature schemes reconsidered. In: The 2003 Symposium on Cryptography and Information Security (2003)"},{"key":"13_CR50","doi-asserted-by":"publisher","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) CRYPTO\u201992. LNCS, vol.\u00a0740, pp. 31\u201353. Springer, Berlin, Heidelberg (Aug 1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_3","DOI":"10.1007\/3-540-48071-4_3"},{"key":"13_CR51","doi-asserted-by":"publisher","unstructured":"Okamoto, T.: Designated confirmer signatures and public-key encryption are equivalent. In: Desmedt, Y. (ed.) CRYPTO\u201994. LNCS, vol.\u00a0839, pp. 61\u201374. Springer, Berlin, Heidelberg (Aug 1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_8","DOI":"10.1007\/3-540-48658-5_8"},{"key":"13_CR52","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Ohta, K.: Universal electronic cash. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol.\u00a0576, pp. 324\u2013337. Springer, Berlin, Heidelberg (Aug 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_27","DOI":"10.1007\/3-540-46766-1_27"},{"key":"13_CR53","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Tessaro, S., Zaverucha, G., Zhu, C.: Oblivious issuance of proofs. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 254\u2013287. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_8","DOI":"10.1007\/978-3-031-68400-5_8"},{"key":"13_CR54","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (Jun 2000). https:\/\/doi.org\/10.1007\/s001450010003","DOI":"10.1007\/s001450010003"},{"key":"13_CR55","doi-asserted-by":"publisher","unstructured":"Reichle, M., Reinke, Z.: Threshold blind signatures from CDH. In: Bai, S., Persichetti, E. (eds.) Public-Key Cryptography \u2013 PKC 2026, pp. 269\u2013301. Springer Nature Switzerland, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-26731-3_9","DOI":"10.1007\/978-3-032-26731-3_9"},{"key":"13_CR56","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, New York (Aug 1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"13_CR57","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Berlin, Heidelberg (May 1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"13_CR58","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 782\u2013811. Springer, Cham (May\u00a0\/\u00a0Jun 2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_27","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"13_CR59","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 628\u2013658. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_22","DOI":"10.1007\/978-3-031-30589-4_22"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:02:24Z","timestamp":1786528944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35415-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354143","9783032354150"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35415-0_13","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"}}]}}