{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:08Z","timestamp":1786978868026,"version":"3.56.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031577208","type":"print"},{"value":"9783031577185","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-57718-5_11","type":"book-chapter","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T18:01:17Z","timestamp":1712944877000},"page":"319-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Breaking Parallel ROS: Implication for\u00a0Isogeny and\u00a0Lattice-Based Blind Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8496-0476","authenticated-orcid":false,"given":"Shuichi","family":"Katsumata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1346-9372","authenticated-orcid":false,"given":"Yi-Fu","family":"Lai","sequence":"additional","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"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"11_CR1","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":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-22792-9_37","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Abe","year":"2011","unstructured":"Abe, M., Groth, J., Haralambiev, K., Ohkubo, M.: Optimal structure-preserving signatures in asymmetric bilinear groups. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 649\u2013666. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_37"},{"key":"11_CR3","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":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-030-51280-4_26","volume-title":"Financial Cryptography and Data Security","author":"N Alkeilani Alkadri","year":"2020","unstructured":"Alkeilani Alkadri, N., El Bansarkhani, R., Buchmann, J.: BLAZE: practical lattice-based blind signatures for privacy-preserving applications. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 484\u2013502. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_26"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-55304-3_3","volume-title":"Information Security and Privacy","author":"N Alkeilani Alkadri","year":"2020","unstructured":"Alkeilani Alkadri, N., El Bansarkhani, R., Buchmann, J.: On lattice-based interactive protocols: an approach with less or no aborts. In: Liu, J.K., Cui, H. (eds.) ACISP 2020. LNCS, vol. 12248, pp. 41\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-55304-3_3"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-030-92548-2_6","volume-title":"Cryptology and Network Security","author":"N Alkeilani Alkadri","year":"2021","unstructured":"Alkeilani Alkadri, N., Harasser, P., Janson, C.: BlindOR: an\u00a0efficient lattice-based blind signature scheme from\u00a0OR-proofs. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 95\u2013115. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_6"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-77870-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 33\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. Cryptology ePrint Archive, Paper 2023\/077","DOI":"10.1145\/3576915.3616613"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.3233\/JCS-130477","volume":"21","author":"O Blazy","year":"2013","unstructured":"Blazy, O., Fuchsbauer, G., Pointcheval, D., Vergnaud, D.: Short blind signatures. J. Comput. Secur. 21(5), 627\u2013661 (2013)","journal-title":"J. Comput. Secur."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM CCS 2004, pp. 132\u2013145 (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3572771","volume":"55","author":"M Buser","year":"2023","unstructured":"Buser, M., et al.: A survey on exotic signatures for post-quantum blockchain: Challenges & research directions. ACM Comput. Surv. 55, 1\u201332 (2023)","journal-title":"ACM Comput. Surv."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199\u2013203. Springer, Boston, MA (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18"},{"key":"11_CR13","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"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"3416","DOI":"10.1109\/COMST.2018.2842460","volume":"20","author":"M Conti","year":"2018","unstructured":"Conti, M., Kumar, E.S., Lal, C., Ruj, S.: A survey on security and privacy issues of bitcoin. IEEE Commun. Surv. Tutorials 20(4), 3416\u20133452 (2018)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"11_CR15","unstructured":"Damg\u00e5rd, I.: On $$\\sigma $$-protocols. Lecture Notes, University of Aarhus, Department for Computer Science, pp. 84 (2010)"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"R. del Pino and S. Katsumata. A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II, pp. 306\u2013336 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_11","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. Cryptology ePrint Archive, Report 2023\/186","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"11_CR18","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":"11_CR19","unstructured":"Fuchsbauer, G., Wolf, M.: (concurrently secure) blind schnorr from schnorr. IACR Cryptol. ePrint Arch., page 1676"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-17659-4_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Hauck","year":"2019","unstructured":"Hauck, E., Kiltz, E., Loss, J.: A modular treatment of blind signatures from identification schemes. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 345\u2013375. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_12"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-56880-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Hauck","year":"2020","unstructured":"Hauck, E., Kiltz, E., Loss, J., Nguyen, N.K.: Lattice-based blind signatures, revisited. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 500\u2013529. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_18"},{"key":"11_CR22","unstructured":"Hendrickson, S., Iyengar, J., Pauly, T., Valdez, S., Wood, C.A.: Private access tokens. internet-draft draft-private-access-tokens-01"},{"key":"11_CR23","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 2022, Part IV, vol. 13794, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_10","DOI":"10.1007\/978-3-031-22972-5_10"},{"key":"11_CR24","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 2022, Part II, vol. 13178, pp. 468\u2013497. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_16","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Lai, Y.F., LeGrow, J.T., Qin, L.: CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist. In: Handschuh, H., Lysyanskaya, A. (eds.) Crypto, vol. 14083. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-38548-3_24","DOI":"10.1007\/978-3-031-38548-3_24"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-981-99-8724-5_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2023","author":"S Katsumata","year":"2023","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 2023. LNCS, vol. 14439, pp. 383\u2013417. Springer, Singapore (2023)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-34618-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Khalili","year":"2019","unstructured":"Khalili, M., Slamanig, D., Dakhilalian, M.: Structure-preserving signatures on\u00a0equivalence classes from standard assumptions. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_3"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-17373-8_30","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"S Meiklejohn","year":"2010","unstructured":"Meiklejohn, S., Shacham, H., Freeman, D.M.: Limitations on transformations from composite-order to prime-order groups: the case of round-optimal blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 519\u2013538. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_30"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45600-7_1","volume-title":"Information and Communications Security","author":"CP Schnorr","year":"2001","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"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-28914-9_8","volume-title":"Theory of Cryptography","author":"JH Seo","year":"2012","unstructured":"Seo, J.H., Cheon, J.H.: Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 133\u2013150. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_8"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II, vol. 13276, pp. 782\u2013811. Springer, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-031-07085-3_27","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"11_CR32","unstructured":"VPN by Google one, explained. https:\/\/one.google.com\/about\/vpn\/howitworks"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Yi, X. and Lam, K.Y.: A new blind ECDSA scheme for bitcoin transaction anonymity. In: ASIACCS 19, pp. 613\u2013620 (2019)","DOI":"10.1145\/3321705.3329816"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57718-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T07:03:47Z","timestamp":1728025427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57718-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577208","9783031577185"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57718-5_11","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":"13 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}