{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:59:37Z","timestamp":1778903977432,"version":"3.51.4"},"publisher-location":"Cham","reference-count":60,"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_1","type":"book-chapter","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T22:01:17Z","timestamp":1712959277000},"page":"3-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Proving Equivalence Class Signatures Secure from\u00a0Non-interactive Assumptions"],"prefix":"10.1007","author":[{"given":"Balthazar","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Fuchsbauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Regen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11555827_10","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G Ateniese","year":"2005","unstructured":"Ateniese, G., Chou, D.H., de Medeiros, B., Tsudik, G.: Sanitizable signatures. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 159\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_10"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-14623-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M Abe","year":"2010","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209\u2013236. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_12"},{"key":"1_CR3","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":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-25385-0_34","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M Abe","year":"2011","unstructured":"Abe, M., Groth, J., Ohkubo, M.: Separating short structure-preserving signatures from non-interactive assumptions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 628\u2013646. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_34"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03356-8_7","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M Belenkiy","year":"2009","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable proofs and delegatable anonymous credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 108\u2013125. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_7"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., Striecks, C.: Privacy-preserving incentive systems with highly efficient point-collection. In: Sun, H.-M., Shieh, S.-P., Gu, G., Ateniese, G. (eds.) ASIACCS 2020, October 2020, pp. 319\u2013333. ACM Press (2020)","DOI":"10.1145\/3320269.3384769"},{"issue":"5","key":"1_CR7","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":"1_CR8","unstructured":"Bauer, B., Fuchsbauer, G., Regen, F.: On security proofs of existing equivalence class signature schemes. Cryptology ePrint Archive, Paper 2024\/183 (2024). https:\/\/eprint.iacr.org\/2024\/183"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-03329-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"M Backes","year":"2018","unstructured":"Backes, M., Hanzlik, L., Kluczniak, K., Schneider, J.: Signatures with flexible public key: introducing equivalence classes for public keys. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 405\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_14"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-662-49896-5_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"C Bader","year":"2016","unstructured":"Bader, C., Jager, T., Li, Y., Sch\u00e4ge, S.: On the impossibility of tight cryptographic reductions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 273\u2013304. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_10"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-17253-4_6","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"X Bultel","year":"2019","unstructured":"Bultel, X., Lafourcade, P., Lai, R.W.F., Malavolta, G., Schr\u00f6der, D., Thyagarajan, S.A.K.: Efficient invisible and unlinkable sanitizable signatures. In: Lin, D., Sako, K. (eds.) PKC 2019, Part I. LNCS, vol. 11442, pp. 159\u2013189. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_6"},{"key":"1_CR12","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":"1_CR13","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Raykova, M., Seth, K.: Anonymous counting tokens. IACR Cryptology ePrint Archive, p. 320 (2023, to appear at Asiacrypt 2023)","DOI":"10.1007\/978-981-99-8724-5_8"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA may not be equivalent to factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 59\u201371. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054117"},{"key":"1_CR15","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":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-030-12612-4_27","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"EC Crites","year":"2019","unstructured":"Crites, E.C., Lysyanskaya, A.: Delegatable anonymous credentials from mercurial signatures. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 535\u2013555. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_27"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Crites, E.C., Lysyanskaya, A.: Mercurial signatures for variable-length messages. In: PoPETs, vol. 2021, no. 4, pp. 441\u2013463 (2021)","DOI":"10.2478\/popets-2021-0079"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Connolly, A., Lafourcade, P., Perez-Kempner, O.: Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) Public-Key Cryptography, PKC 2022, Part I. LNCS vol. 13177, pp. 409\u2013438. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_15","DOI":"10.1007\/978-3-030-97121-2_15"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J-S Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46035-7_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J-S Coron","year":"2002","unstructured":"Coron, J.-S.: Optimal security proofs for PSS and other signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 272\u2013287. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_18"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-62576-4_1","volume-title":"Provable and Practical Security","author":"R Clarisse","year":"2020","unstructured":"Clarisse, R., Sanders, O.: Group signature without random oracles from randomizable signatures. In: Nguyen, K., Wu, W., Lam, K.Y., Wang, H. (eds.) ProvSec 2020. LNCS, vol. 12505, pp. 3\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62576-4_1"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-662-53644-5_21","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2016","unstructured":"Damg\u00e5rd, I., Haagh, H., Orlandi, C.: Access control encryption: enforcing information flow with cryptography. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 547\u2013576. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_21"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-27239-9_4","volume-title":"Cryptography and Coding","author":"D Derler","year":"2015","unstructured":"Derler, D., Hanser, C., Slamanig, D.: A new approach to efficient revocable attribute-based anonymous credentials. In: Groth, J. (ed.) IMACC 2015. LNCS, vol. 9496, pp. 57\u201374. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27239-9_4"},{"key":"1_CR24","unstructured":"Derler, D., Slamanig, D.: Fully-anonymous short dynamic group signatures without encryption. Cryptology ePrint Archive, Report 2016\/154 (2016). https:\/\/eprint.iacr.org\/2016\/154"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Derler, D., Slamanig, D.: Highly-efficient fully-anonymous dynamic group signatures. In: Kim, J., Ahn, G.-J., Kim, S., Kim, Y., L\u00f3pez, J., Kim, T. (eds.) ASIACCS 18, April 2018, pp. 551\u2013565. ACM Press (2018)","DOI":"10.1145\/3196494.3196507"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","volume":"30","author":"A Escala","year":"2017","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.L.: An algebraic framework for Diffie-Hellman assumptions. J. Cryptol. 30(1), 242\u2013288 (2017)","journal-title":"J. Cryptol."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-38348-9_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Fischlin","year":"2013","unstructured":"Fischlin, M., Fleischhacker, N.: Limitations of the meta-reduction technique: the case of Schnorr signatures. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 444\u2013460. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_27"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-76581-5_6","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Gay, R.: Weakly secure equivalence-class signatures from standard assumptions. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 153\u2013183. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_6"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-662-54388-7_4","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"G Fuchsbauer","year":"2017","unstructured":"Fuchsbauer, G., Gay, R., Kowalczyk, L., Orlandi, C.: Access control encryption for equality, comparison, and more. In: Fehr, S. (ed.) PKC 2017, Part II. LNCS, vol. 10175, pp. 88\u2013118. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_4"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-44618-9_21","volume-title":"Security and Cryptography for Networks","author":"G Fuchsbauer","year":"2016","unstructured":"Fuchsbauer, G., Hanser, C., Kamath, C., Slamanig, D.: Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 391\u2013408. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_21"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-44618-9_21","volume-title":"Security and Cryptography for Networks","author":"G Fuchsbauer","year":"2016","unstructured":"Fuchsbauer, G., Hanser, C., Kamath, C., Slamanig, D.: Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Zikas, V., De Prisco, R. (eds.) SCN 2016, Part II. LNCS, vol. 9841, pp. 391\u2013408. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_21"},{"issue":"2","key":"1_CR33","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","volume":"32","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498\u2013546 (2019)","journal-title":"J. Cryptol."},{"key":"1_CR34","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":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-662-45611-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"N Fleischhacker","year":"2014","unstructured":"Fleischhacker, N., Jager, T., Schr\u00f6der, D.: On tight security proofs for Schnorr signatures. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part I. LNCS, vol. 8873, pp. 512\u2013531. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_27"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-03298-1_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"G Fuchsbauer","year":"2009","unstructured":"Fuchsbauer, G., Pointcheval, D.: Proofs on encrypted values in bilinear groups and an application to anonymity of signatures. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 132\u2013149. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_10"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-13190-5_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Fischlin","year":"2010","unstructured":"Fischlin, M., Schr\u00f6der, D.: On the impossibility of three-move blind signature schemes. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 197\u2013215. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_10"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-20465-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G Fuchsbauer","year":"2011","unstructured":"Fuchsbauer, G.: Commuting signatures and verifiable encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 224\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_14"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-85174-5_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S Garg","year":"2008","unstructured":"Garg, S., Bhaskar, R., Lokam, S.V.: Improved bounds on security reductions for discrete log based signatures. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 93\u2013107. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_6"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Hanzlik, L.: Non-interactive blind signatures for random messages. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 722\u2013752. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_25","DOI":"10.1007\/978-3-031-30589-4_25"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-30057-8_5","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"D Hofheinz","year":"2012","unstructured":"Hofheinz, D., Jager, T., Knapp, E.: Waters signatures with optimal security reduction. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 66\u201383. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_5"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-70936-7_18","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2007","unstructured":"Hazay, C., Katz, J., Koo, C.-Y., Lindell, Y.: Concurrently-secure blind signatures without random oracles or setup assumptions. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 323\u2013341. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_18"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-030-45388-6_21","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C H\u00e9bant","year":"2020","unstructured":"H\u00e9bant, C., Phan, D.H., Pointcheval, D.: Linearly-homomorphic signatures and scalable mix-nets. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part II. LNCS, vol. 12111, pp. 597\u2013627. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_21"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-24174-6_8","volume-title":"Computer Security \u2013 ESORICS 2015","author":"C Hanser","year":"2015","unstructured":"Hanser, C., Rabkin, M., Schr\u00f6der, D.: Verifiably encrypted signatures: security revisited and a new construction. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015, Part I. LNCS, vol. 9326, pp. 146\u2013164. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_8"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-662-45611-8_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"C Hanser","year":"2014","unstructured":"Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part I. LNCS, vol. 8873, pp. 491\u2013511. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_26"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Hanzlik, L., Slamanig, D.: With a little help from my friends: constructing practical anonymous credentials. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, November 2021, pp. 2004\u20132023. ACM Press (2021)","DOI":"10.1145\/3460120.3484582"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-29011-4_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"SA Kakvi","year":"2012","unstructured":"Kakvi, S.A., Kiltz, E.: Optimal security proofs for full domain hash, revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 537\u2013553. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_32"},{"key":"1_CR48","unstructured":"Koblitz, N., Menezes, A.: Critical perspectives on provable security: fifteen years of \u201canother look\u201d papers. Cryptology ePrint Archive, Report 2019\/1336 (2019). https:\/\/eprint.iacr.org\/2019\/1336"},{"key":"1_CR49","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, Part III. LNCS, vol. 11923, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_3"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Mir, O., Bauer, B., Griffy, S., Lysyanskaya, A., Slamanig, D.: Aggregate signatures with versatile randomization and issuer-hiding multi-authority anonymous credentials. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 30\u201344. ACM (2023)","DOI":"10.1145\/3576915.3623203"},{"issue":"3","key":"1_CR52","doi-asserted-by":"publisher","first-page":"488","DOI":"10.56553\/popets-2023-0093","volume":"2023","author":"O Mir","year":"2023","unstructured":"Mir, O., Slamanig, D., Bauer, B., Mayrhofer, R.: Practical delegatable anonymous credentials from equivalence class signatures. Proc. Priv. Enhancing Technol. 2023(3), 488\u2013513 (2023)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"1_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"issue":"2","key":"1_CR54","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"VI Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes 55(2), 165\u2013172 (1994)","journal-title":"Math. Notes"},{"issue":"3","key":"1_CR55","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":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11593447_1","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P Paillier","year":"2005","unstructured":"Paillier, P., Vergnaud, D.: Discrete-log-based signatures may not be equivalent\u00a0to\u00a0discrete\u00a0log. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 1\u201320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_1"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-29011-4_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y Seurin","year":"2012","unstructured":"Seurin, Y.: On the exact security of Schnorr-type signatures in the Random Oracle Model. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 554\u2013571. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_33"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-75539-3_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"O Sanders","year":"2021","unstructured":"Sanders, O., Traor\u00e9, J.: EPID with malicious revocation. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 177\u2013200. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_8"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T11:03:05Z","timestamp":1728039785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57718-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577208","9783031577185"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57718-5_1","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"}}]}}