{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:07:18Z","timestamp":1786979238850,"version":"build-2736575974"},"publisher-location":"Singapore","reference-count":80,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551187","type":"print"},{"value":"9789819551194","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"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-5119-4_19","type":"book-chapter","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:43:46Z","timestamp":1765057426000},"page":"601-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptively Secure Threshold Blind BLS Signatures and\u00a0Threshold Oblivious PRF"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5055-2407","authenticated-orcid":false,"given":"Stanislaw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1230-6941","authenticated-orcid":false,"given":"Phillip","family":"Nazarian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,7]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Barbosa, M., Katz, J., Loss, J., Xu, J.: Algebraic adversaries in the universal composability framework. In: Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT\u00a02021, Part\u00a0III, vol. 13092 of LNCS, pp. 311\u2013341. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-92078-4_11"},{"key":"19_CR2","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-44987-6_9"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Abe, M., Fehr, S.: Adaptively secure feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 317\u2013334. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_20","DOI":"10.1007\/978-3-540-28628-8_20"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: 2022 IEEE Symposium on Security and Privacy, pp. 2554\u20132572. IEEE Computer Society Press (2022)","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Almansa, J.F., Damg\u00e5rd, I., Nielsen, J.B.: Simplified threshold RSA with adaptive and proactive security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 593\u2013611. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_35","DOI":"10.1007\/11761679_35"},{"key":"19_CR6","unstructured":"Amjad, G.L., Hendrickson, S., Wood, C.A., Yeo, K.W.L.: Partially Blind RSA Signatures. Internet-Draft draft-irtf-cfrg-partially-blind-rsa-00, Internet Engineering Task Force (2024)"},{"key":"19_CR7","unstructured":"iCloud Private Relay Overview (2021). https:\/\/www.apple.com\/icloud\/docs\/iCloud_Private_Relay_Overview_Dec2021.pdf"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Adaptively secure three-round threshold schnorr signatures from DDH. In: Kalai, Y.T., Kamara, S.F., eds, Advances in Cryptology \u2013 CRYPTO 2025, pp. 390\u2013422, Cham. Springer Nature Switzerland (2025)","DOI":"10.1007\/978-3-032-01887-8_13"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Glacius: threshold schnorr signatures from DDH with full adaptive security. In: Fehr, S., Fouque, P.A., eds., Advances in Cryptology \u2013 EUROCRYPT 2025, pp. 304\u2013334, Cham. Springer Nature Switzerland (2025)","DOI":"10.1007\/978-3-031-91124-8_11"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, pp. 193\u2013207, New York. Association for Computing Machinery (2022)","DOI":"10.1145\/3548606.3560656"},{"key":"19_CR11","doi-asserted-by":"crossref","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\u00a02024, Part\u00a0I, vol. 14651 of LNCS, pp. 429\u2013459. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-58716-0_15"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. In: Chen, Y., Danezis, G., Shmatikov, V., eds., ACM CCS 2011, pp. 433\u2013444. ACM Press (2011)","DOI":"10.1145\/2046707.2046758"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Bellare, M., et al.: Better than advertised security for non-interactive threshold signatures. In: Dodis, Y., Shrimpton, T., eds., CRYPTO\u00a02022, Part\u00a0IV, vol. 13510 of LNCS, pp. 517\u2013550. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"19_CR14","unstructured":"Bellare, M., Tessaro, S., Zhu, C.: Stronger security for non-interactive threshold signatures: BLS and FROST. Cryptology ePrint Archive, Paper 2022\/833 (2022). https:\/\/eprint.iacr.org\/2022\/833"},{"key":"19_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.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3","DOI":"10.1007\/3-540-36288-6_3"},{"issue":"4","key":"19_CR16","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)","journal-title":"J. Cryptol."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Brandao, L., Peralta, R.: NIST first call for multi-party threshold schemes (2023). https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8214c\/draft","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Gro\u00df, T.: Efficient attributes for anonymous credentials. In: Ning, P., Syverson, P.F., Jha, S., eds., ACM CCS 2008, pp. 345\u2013356. ACM Press (2008)","DOI":"10.1145\/1455770.1455814"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lysyanskaya, A.: An identity escrow scheme with appointed verifiers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 388\u2013407. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_23","DOI":"10.1007\/3-540-44647-8_23"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G., eds., ACM CCS 2020, pp. 1769\u20131787. ACM Press (2020)","DOI":"10.1145\/3372297.3423367"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M.J., (eds.), CRYPTO\u201999, vol. 1666 of LNCS, pp. 98\u2013115. Springer, Berlin, Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_7"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: SoK: oblivious pseudorandom functions. Cryptology ePrint Archive, Report 2022\/302 (2022)","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth-efficient threshold EC-DSA. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V., eds, PKC\u00a02020, Part\u00a0II, vol. 12111 of LNCS, pp. 266\u2013296. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Celi, S., Davidson, A., Valdez, S., Wood, C.A.: Privacy Pass Issuance Protocols. RFC 9578 (2024)","DOI":"10.17487\/RFC9578"},{"key":"19_CR25","doi-asserted-by":"crossref","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, vol. 13509 of LNCS, pp. 3\u201331. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15982-4_1"},{"key":"19_CR26","doi-asserted-by":"crossref","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, vol. 14920 of LNCS, pp. 174\u2013209. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68376-3_6"},{"key":"19_CR27","first-page":"199","volume-title":"CRYPTO\u201982","author":"D Chaum","year":"1982","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 (1982)"},{"key":"19_CR28","doi-asserted-by":"publisher","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","DOI":"10.1007\/0-387-34799-2_25"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Chu, H., Gerhart, P., Ruffing, T., Schr\u00f6der, D.: Practical schnorr threshold signatures without the algebraic group model. In: Handschuh, H., Lysyanskaya, A., eds, CRYPTO\u00a02023, Part\u00a0I, vol. 14081 of LNCS, pp. 743\u2013773. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_24"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Crites, E., Komlo, C., Maller, M.: Fully adaptive schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A., eds, CRYPTO\u00a02023, Part\u00a0I, vol. 14081 of LNCS, pp. 678\u2013709. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Bellare, M., Crites, E., 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, vol. 14081 of LNCS, pp. 710\u2013742. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_23"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-57990-6_19","volume-title":"Security and Cryptography for Networks","author":"I Damg\u00e5rd","year":"2020","unstructured":"Damg\u00e5rd, I., Jakobsen, T.P., Nielsen, J.B., Pagter, J.I., \u00d8stergaard, M.B.: Fast threshold ECDSA with honest majority. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 382\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_19"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Das, P., Hesse, J., Lehmann, A.: DPaSE: distributed password-authenticated symmetric-key encryption, or how to get many keys from one password. In: Suga, Y., Sakurai, K., Ding, X., Sako, K., eds, ASIACCS 22, pp. 682\u2013696. ACM Press (2022)","DOI":"10.1145\/3488932.3517389"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Das, S., Camacho, P., Xiang, Z., Nieto, J., B\u00fcnz, B., Ren, L.: Threshold signatures from inner product argument: succinct, weighted, and multi-threshold. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E., eds, ACM CCS 2023, pp. 356\u2013370. ACM Press (2023)","DOI":"10.1145\/3576915.3623096"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Das, S., Ren, L.: Adaptively secure BLS threshold signatures from DDH and co-CDH. In: Reyzin, L., Stebila, D., eds, Advances in Cryptology \u2013 CRYPTO 2024, pp. 251\u2013284, Cham. Springer Nature Switzerland (2024)","DOI":"10.1007\/978-3-031-68394-7_9"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Denis, F., Jacobs, F., Wood, C.A.: RSA Blind Signatures. RFC 9474 (2023)","DOI":"10.17487\/RFC9474"},{"key":"19_CR37","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120\u2013127. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_8","DOI":"10.1007\/3-540-48184-2_8"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A., Tyner, L.: Threshold BBS+ signatures for distributed anonymous credential issuance. In: 2023 IEEE Symposium on Security and Privacy, pp. 773\u2013789. IEEE Computer Society Press (2023)","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Frankel, Y., MacKenzie, P. D., Yung, M.: Adaptively-secure optimal-resilience proactive RSA. In: Lam, K.Y., Okamoto, E., Xing, Ceditors, ASIACRYPT\u201999, vol. 1716 of LNCS, pp. 180\u2013194. Springer, Berlin, Heidelberg (1999)","DOI":"10.1007\/978-3-540-48000-6_15"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17","DOI":"10.1007\/978-3-540-30576-7_17"},{"issue":"16","key":"19_CR42","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"19_CR43","unstructured":"Garg, S., Jain, A., Mukherjee, P., Sinha, R., Wang, M., Zhang, Y.: hinTS: threshold signatures with silent setup. Cryptology ePrint Archive, Report 2023\/567 (2023)"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X., eds, ACM CCS 2018, pp. 1179\u20131194. ACM Press (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"19_CR45","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 156\u2013174. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"19_CR46","unstructured":"Trust Tokens (2024). https:\/\/developer.chrome.com\/docs\/privacy-sandbox\/trust-tokens\/"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Grontas, P., Pagourtzis, A., Zacharakis, A., Zhang, B.: Towards everlasting privacy and efficient coercion resistance in remote electronic voting. In: Zohar, A., et al., eds., FC 2018 Workshops, vol. 10958 of LNCS, pp. 210\u2013231. Springer, Berlin, Heidelberg (2019)","DOI":"10.1007\/978-3-662-58820-8_15"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Gu, Y., Jarecki, S., Kedzior, P., Nazarian, P., Xu, J.: Threshold PAKE with security against compromise of all servers. In: Advances in Cryptology \u2013 ASIACRYPT 2024 (2024)","DOI":"10.1007\/978-981-96-0935-2_3"},{"key":"19_CR49","doi-asserted-by":"crossref","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, vol. 14008 of LNCS, pp. 753\u2013783. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30589-4_26"},{"key":"19_CR50","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"19_CR51","doi-asserted-by":"publisher","unstructured":"Heilman, E., Baldimtsi, F., Goldberg, S.: Blindly signed contracts: anonymous on-blockchain and off-blockchain bitcoin transactions. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 43\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_4","DOI":"10.1007\/978-3-662-53357-4_4"},{"key":"19_CR52","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and t-pake in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"19_CR53","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 39\u201358. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_3","DOI":"10.1007\/978-3-319-61204-1_3"},{"key":"19_CR54","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., Resch, J.: Updatable oblivious key management for storage systems. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J., eds, ACM CCS 2019, pp. 379\u2013393. ACM Press (2019)","DOI":"10.1145\/3319535.3363196"},{"key":"19_CR55","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 456\u2013486. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"19_CR56","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577\u2013594. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_34","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"19_CR57","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 418\u2013435. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_26","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"19_CR58","unstructured":"Jarecki, S., Nazarian, P.: Adaptively secure threshold blind BLS signatures and threshold oblivious PRF. Cryptology ePrint Archive, Paper 2025\/483 (2025)"},{"key":"19_CR59","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201995, pp. 398\u2013406, New York. Association for Computing Machinery (1995)","DOI":"10.1145\/225058.225166"},{"key":"19_CR60","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, Part\u00a0I, vol. 14920 of LNCS, pp. 210\u2013245. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68376-3_7"},{"key":"19_CR61","doi-asserted-by":"crossref","unstructured":"Kim, J., Kim, K., Lee, C.: An efficient and provably secure threshold blind signature. In: 4th International Conference on Information Security and Cryptology \u2013 ICISC\u201901, Berlin, Heidelberg. Springer-Verlag (2001)","DOI":"10.1007\/3-540-45861-1_24"},{"key":"19_CR62","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S., eds., ACM CCS 2016, pp. 818\u2013829. ACM Press (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"19_CR63","unstructured":"Komlo, C., Goldberg, I.: FROST: Flexible round-optimized Schnorr threshold signatures. In: Dunkelman, O., Jacobson Jr., M.J., O\u2019Flynn, C., eds., SAC 2020, vol. 12804 of LNCS, pp. 34\u201365. Springer, Cham (2020)"},{"key":"19_CR64","doi-asserted-by":"crossref","unstructured":"Kuchta, V., Manulis, M.: Rerandomizable threshold blind signatures. In: Trusted Systems- 6th International Conference \u2013 INTRUST 2014 (2014)","DOI":"10.1007\/978-3-319-27998-5_5"},{"key":"19_CR65","doi-asserted-by":"crossref","unstructured":"Lehmann, A., Nazarian, P., \u00d6zbay, C.: Stronger security for threshold blind signatures. In Serge Fehr and Pierre-Alain Fouque, editors, Advances in Cryptology \u2013 EUROCRYPT 2025, pp. 335\u2013364, Cham. Springer Nature Switzerland (2025)","DOI":"10.1007\/978-3-031-91124-8_12"},{"key":"19_CR66","doi-asserted-by":"crossref","unstructured":"Libert, B., Yung, M., Joye, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In: Halld\u00f3rsson, M.M., Dolev, S., eds., 33rd ACM PODC, pp. 303\u2013312. ACM (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"19_CR67","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"19_CR68","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X., eds, ACM CCS 2018, pp. 1837\u20131854. ACM Press (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"19_CR69","doi-asserted-by":"publisher","unstructured":"Lysyanskaya, A., Peikert, C.: Adaptive security in the threshold setting: from cryptosystems to signature schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 331\u2013350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_20","DOI":"10.1007\/3-540-45682-1_20"},{"issue":"2","key":"19_CR70","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004)","journal-title":"J. ACM"},{"key":"19_CR71","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-46766-1_27"},{"issue":"3","key":"19_CR72","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)","journal-title":"J. Cryptol."},{"key":"19_CR73","doi-asserted-by":"publisher","first-page":"138239","DOI":"10.1109\/ACCESS.2024.3445298","volume":"12","author":"V Reyes-Macedo","year":"2024","unstructured":"Reyes-Macedo, V., Kawachi, A., Gallegos-Garc\u00eda, G., Salinas-Rosales, M.: A threshold-blind signature scheme and its application in blockchain-based systems. IEEE Access 12, 138239\u2013138251 (2024)","journal-title":"IEEE Access"},{"key":"19_CR74","unstructured":"Rial, A., Piotrowska, A.M.: Security analysis of coconut, an attribute-based credential scheme with threshold issuance. Cryptology ePrint Archive, Report 2022\/011 (2022)"},{"key":"19_CR75","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Security of blind discrete log signatures against interactive attacks. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 1\u201312. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45600-7_1","DOI":"10.1007\/3-540-45600-7_1"},{"key":"19_CR76","doi-asserted-by":"crossref","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U., eds., Advances in Cryptology \u2014 EUROCRYPT \u201996, pp. 190\u2013199, Berlin, Heidelberg. Springer Berlin Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_17"},{"key":"19_CR77","doi-asserted-by":"crossref","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: Dunkelman, O., Dziembowski, S., eds., EUROCRYPT\u00a02022, Part\u00a0II, vol. 13276 of LNCS, pp. 782\u2013811. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"19_CR78","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Celi, S., Ristenpart, T., Sullivan, N., Tessaro, S., Wood, C.A.: A fast and simple partially oblivious PRF, with applications. In: Dunkelman, O., Dziembowski, S., eds., Advances in Cryptology \u2013 EUROCRYPT 2022, pp. 674\u2013705, Cham. Springer International Publishing (2022)","DOI":"10.1007\/978-3-031-07085-3_23"},{"key":"19_CR79","unstructured":"Vo, D. L., Zhang, F., Kim, K.: A new threshold blind signature scheme from pairings. In: Symposium on Cryptography and Information Security \u2013 SCIS 2023 (2003)"},{"key":"19_CR80","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Panario, D.: Factoring polynomials over finite fields: a survey. J. Symbolic Comput., 31(1), 3\u201317 (2001)","DOI":"10.1006\/jsco.1999.1002"}],"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-5119-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:44:14Z","timestamp":1765057454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5119-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,7]]},"ISBN":["9789819551187","9789819551194"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5119-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,7]]},"assertion":[{"value":"7 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"}}]}}