{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:10:45Z","timestamp":1778152245713,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911231","type":"print"},{"value":"9783031911248","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91124-8_13","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:22:57Z","timestamp":1745745777000},"page":"365-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-interactive Blind Signatures from\u00a0RSA Assumption and\u00a0More"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1941-693X","authenticated-orcid":false,"given":"Lucjan","family":"Hanzlik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5919-226X","authenticated-orcid":false,"given":"Eugenio","family":"Paracucchi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2086-8398","authenticated-orcid":false,"given":"Riccardo","family":"Zanotto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., Cheng, J., Goyal, R., Yadav, A.: Non-interactive blind signatures: post-quantum and stronger security. In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02024, Part\u00a0II. LNCS, vol. 15485, pp. 70\u2013104. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0888-1_3","DOI":"10.1007\/978-981-96-0888-1_3"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012: 19th Conference on Computer and Communications Security, pp. 784\u2013796. ACM Press (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"M Bellare","year":"1990","unstructured":"Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547\u2013557. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_48"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"13_CR7","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"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268\u2013289. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_20"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"13_CR10","unstructured":"Celi, S., Davidson, A., Valdez, S., Wood, C.A.: Privacy Pass Issuance Protocol. Internet-Draft draft-ietf-privacypass-protocol-16, Internet Engineering Task Force (2023). https:\/\/datatracker.ietf.org\/doc\/draft-ietf-privacypass-protocol\/16\/, work in Progress"},{"key":"13_CR11","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":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C Cocks","year":"2001","unstructured":"Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_32"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C Cocks","year":"2001","unstructured":"Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_32"},{"issue":"3","key":"13_CR14","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. Proc. Priv. Enhancing Technol. 2018(3), 164\u2013180 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-1-4757-0602-4_19","volume-title":"Advances in Cryptology","author":"S Even","year":"1983","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 205\u2013210. Springer, Boston, MA (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_19"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Gong, L., Reiter, M.K. (eds.) ACM CCS 98: 5th Conference on Computer and Communications Security, pp. 67\u201372. ACM Press (1998). https:\/\/doi.org\/10.1145\/288090.288108","DOI":"10.1145\/288090.288108"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Goldberg, S., Reyzin, L., Sagga, O., Baldimtsi, F.: Efficient noninteractive certification of RSA moduli and beyond. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 700\u2013727. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_24","DOI":"10.1007\/978-3-030-34618-8_24"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0022000084900709","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Hanzlik, L.: Non-interactive blind signatures for random messages. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 722\u2013752. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_25","DOI":"10.1007\/978-3-031-30589-4_25"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52\u201378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Lysyanskaya, A.: Security analysis of RSA-BSSA. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. LNCS, vol. 13940, pp. 251\u2013280. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_10","DOI":"10.1007\/978-3-031-31368-4_10"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: 40th Annual Symposium on Foundations of Computer Science, pp. 120\u2013130. IEEE Computer Society Press (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"key":"13_CR26","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005). https:\/\/eprint.iacr.org\/2005\/187"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"shelat, a., Shen, C.H.: Fast two-party secure computation with minimal assumptions. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013: 20th Conference on Computer and Communications Security, pp. 523\u2013534. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516698","DOI":"10.1145\/2508859.2516698"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Boneh, D.: Fast and simple constant-time hashing to the BLS12-381 elliptic curve. IACR Trans. Cryptographic Hardware Embed. Syst. 2019(4), 154\u2013179 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i4.154-179, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8348","DOI":"10.13154\/tches.v2019.i4.154-179"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-030-51280-4_24","volume-title":"Financial Cryptography and Data Security","author":"RS Wahby","year":"2020","unstructured":"Wahby, R.S., Boneh, D., Jeffrey, C., Poon, J.: An airdrop that preserves recipient privacy. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 444\u2013463. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_24"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91124-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:23:02Z","timestamp":1745745782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91124-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911231","9783031911248"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91124-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","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":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}