{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:51:45Z","timestamp":1779900705042,"version":"3.53.1"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683756","type":"print"},{"value":"9783031683763","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68376-3_6","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:02:07Z","timestamp":1723755727000},"page":"174-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Pairing-Free Blind Signatures from\u00a0CDH Assumptions"],"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-3751-8546","authenticated-orcid":false,"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4276-2797","authenticated-orcid":false,"given":"Chenzhi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"6_CR1","unstructured":"icloud private relay overview. https:\/\/www.apple.com\/privacy\/docs\/iCloud_Private_Relay_Overview_Dec2021.PDF"},{"key":"6_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 3 Sept 2021"},{"key":"6_CR3","unstructured":"Trust tokens. https:\/\/developer.chrome.com\/docs\/privacy-sandbox\/trust-tokens\/"},{"key":"6_CR4","unstructured":"VPN by google one, explained. https:\/\/one.google.com\/about\/vpn\/howitworks"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-44987-6_9","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"M Abe","year":"2001","unstructured":"Abe, M.: A secure three-move blind signature scheme for polynomially many signatures. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 136\u2013151. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_9"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-44598-6_17","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"M Abe","year":"2000","unstructured":"Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 271\u2013286. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_17"},{"key":"6_CR7","unstructured":"American National Standards Institute, Inc.: ANSI X9.62 public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA), 16 November 2005. https:\/\/standards.globalspec.com\/std\/1955141\/ANSI%20X9.62"},{"key":"6_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-031-58716-0_15","volume-title":"EUROCRYPT 2024, Part I","author":"R Bacho","year":"2024","unstructured":"Bacho, R., Loss, J., Tessaro, S., Wagner, B., Zhu, C.: Twinkle threshold signatures from DDH with full adaptive security. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part I. LNCS, pp. 429\u2013459. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_15"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 449\u2013458. ACM Press, October 2008. https:\/\/doi.org\/10.1145\/1455770.1455827","DOI":"10.1145\/1455770.1455827"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., Lysyanskaya, A.: Anonymous credentials light. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 1087\u20131098. ACM Press, November 2013. https:\/\/doi.org\/10.1145\/2508859.2516687","DOI":"10.1145\/2508859.2516687"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Barreto, P.L., Reich, D.D., Simplicio\u00a0Jr, M.A., Zanon, G.H.: Blind signatures from zero knowledge in the Kummer variety. In: Anais do XXIII Simp\u00f3sio Brasileiro em Seguran\u00e7a da Informa\u00e7\u00e3o e de Sistemas Computacionais, pp. 139\u2013152. SBC (2023). https:\/\/doi.org\/10.5753\/sbseg.2023.233503","DOI":"10.5753\/sbseg.2023.233503"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Barreto, P.L., Zanon, G.H.M.: Blind signatures from zero-knowledge arguments. Cryptology ePrint Archive, Report 2023\/067 (2023). https:\/\/eprint.iacr.org\/2023\/067","DOI":"10.5753\/sbseg.2023.233503"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M Bellare","year":"2003","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. 16(3), 185\u2013215 (2003). https:\/\/doi.org\/10.1007\/s00145-002-0120-1","journal-title":"J. Cryptol."},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 390\u2013399. ACM Press, October\/November 2006. https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: GQ and Schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162\u2013177. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_11"},{"key":"6_CR16","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 1993, pp. 62\u201373. ACM Press, November 1993. https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"6_CR18","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, Part I. LNCS, vol. 12696, pp. 33\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2"},{"issue":"2","key":"6_CR19","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":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0314-9","journal-title":"J. Cryptol."},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"S Brands","year":"1994","unstructured":"Brands, S.: Untraceable off-line cash in wallet with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302\u2013318. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_26"},{"key":"6_CR25","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.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 3\u201331. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_1","DOI":"10.1007\/978-3-031-15982-4_1"},{"key":"6_CR26","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Pairing-free blind signatures from CDH assumptions. Cryptology ePrint Archive, Report 2023\/1780 (2023). https:\/\/eprint.iacr.org\/2023\/1780"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO 1982, 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":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"D Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319\u2013327. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_25"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/11535218_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"B Chevallier-Mames","year":"2005","unstructured":"Chevallier-Mames, B.: An efficient CDH-based signature scheme with a tight security reduction. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 511\u2013526. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_31"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"R Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 678\u2013709. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"6_CR33","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_23","DOI":"10.1007\/978-3-031-38557-5_23"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"6_CR35","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":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-45724-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Fuchsbauer","year":"2020","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 2020, Part II. LNCS, vol. 12106, pp. 63\u201395. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3"},{"key":"6_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-031-58723-8_5","volume-title":"EUROCRYPT 2024, Part II","author":"G Fuchsbauer","year":"2024","unstructured":"Fuchsbauer, G., Wolf, M.: Concurrently secure blind Schnorr signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 124\u2013160. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_5"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201992","author":"A Fujioka","year":"1993","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244\u2013251. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_66"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-39200-9_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"E-J Goh","year":"2003","unstructured":"Goh, E.-J., Jarecki, S.: A signature scheme as secure as the Diffie-Hellman problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 401\u2013415. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_25"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Hanzlik, L., Loss, J., Thyagarajan, S., Wagner, B.: Sweep-UC: swapping coins privately. In: 2024 IEEE Symposium on Security and Privacy (SP), Los Alamitos, CA, USA, p. 84. IEEE Computer Society, May 2024. https:\/\/doi.org\/10.1109\/SP54263.2024.00081","DOI":"10.1109\/SP54263.2024.00081"},{"key":"6_CR42","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.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 753\u2013783. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_26","DOI":"10.1007\/978-3-031-30589-4_26"},{"key":"6_CR43","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, Part III. LNCS, vol. 11478, pp. 345\u2013375. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_12"},{"key":"6_CR44","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, October 2021. https:\/\/datatracker.ietf.org\/doc\/html\/draft-private-access- tokens-01, work in Progress"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"6_CR46","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":"6_CR47","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, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_16","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Kastner, J., Nguyen, K., Reichle, M.: Pairing-free blind signatures from standard assumptions in the rom. In: Reyzin, L., Stebila D. (eds.) CRYPTO\u00a02024. LNCS, vol. 14920, pp. 210\u2013245. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68376-3_7"},{"key":"6_CR49","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, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_12","DOI":"10.1007\/978-981-99-8724-5_12"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-030-92068-5_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"J Katz","year":"2021","unstructured":"Katz, J., Loss, J., Rosenberg, M.: Boosting the\u00a0security of\u00a0blind signature schemes. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part IV. LNCS, vol. 13093, pp. 468\u2013492. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_16"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-70700-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"E Kiltz","year":"2017","unstructured":"Kiltz, E., Loss, J., Pan, J.: Tightly-secure signatures from five-move identification protocols. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part III. LNCS, vol. 10626, pp. 68\u201394. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_3"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"UM Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271\u2013281. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_26"},{"key":"6_CR53","doi-asserted-by":"publisher","unstructured":"May, A., Schneider, C.R.T.: Dlog is practically as hard (or easy) as DH - solving Dlogs via DH oracles on EC standards. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4), 146\u2013166 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i4.146-166","DOI":"10.46586\/tches.v2023.i4.146-166"},{"key":"6_CR54","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21st ACM STOC, pp. 33\u201343. ACM Press, May 1989. https:\/\/doi.org\/10.1145\/73007.73011","DOI":"10.1145\/73007.73011"},{"key":"6_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-48658-5_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"T Okamoto","year":"1994","unstructured":"Okamoto, T.: Designated confirmer signatures and public-key encryption are equivalent. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 61\u201374. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_8"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-46766-1_27","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"T Okamoto","year":"1992","unstructured":"Okamoto, T., Ohta, K.: Universal electronic cash. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 324\u2013337. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_27"},{"key":"6_CR57","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 597\u2013627. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_21","DOI":"10.1007\/978-3-031-30589-4_21"},{"key":"6_CR58","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-031-58716-0_16","volume-title":"EUROCRYPT 2024, Part I","author":"J Pan","year":"2024","unstructured":"Pan, J., Wagner, B.: Toothpicks: more efficient fork-free two-round multi-signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part I. LNCS, vol. 14651, pp. 460\u2013489. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_16"},{"key":"6_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BFb0054141","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"D Pointcheval","year":"1998","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"},{"issue":"3","key":"6_CR60","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","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","journal-title":"J. Cryptol."},{"key":"6_CR61","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"},{"issue":"3","key":"6_CR62","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptol."},{"key":"6_CR63","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, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_27","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"6_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-70694-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"D Unruh","year":"2017","unstructured":"Unruh, D.: Post-quantum security of Fiat-Shamir. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part I. LNCS, vol. 10624, pp. 65\u201395. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68376-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:24:39Z","timestamp":1732649079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68376-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683756","9783031683763"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68376-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}