{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:45:20Z","timestamp":1776296720458,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":70,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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-981-96-0888-1_1","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:10:49Z","timestamp":1733821849000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Security Proofs of\u00a0Existing Equivalence Class Signature Schemes"],"prefix":"10.1007","author":[{"given":"Balthazar","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Georg","family":"Fuchsbauer","sequence":"additional","affiliation":[]},{"given":"Fabian","family":"Regen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. Structure-preserving signatures and commitments to group elements. In Tal Rabin, editor, CRYPTO\u00a02010, volume 6223 of LNCS, pages 209\u2013236. Springer, Heidelberg, August 2010.","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Masayuki Abe, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. Optimal structure-preserving signatures in asymmetric bilinear groups. In Phillip Rogaway, editor, CRYPTO\u00a02011, volume 6841 of LNCS, pages 649\u2013666. Springer, Heidelberg, August 2011.","DOI":"10.1007\/978-3-642-22792-9_37"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Masayuki Abe, Jens Groth, and Miyako Ohkubo. Separating short structure-preserving signatures from non-interactive assumptions. In Dong\u00a0Hoon Lee and Xiaoyun Wang, editors, ASIACRYPT\u00a02011, volume 7073 of LNCS, pages 628\u2013646. Springer, Heidelberg, December 2011.","DOI":"10.1007\/978-3-642-25385-0_34"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Xavier Boyen. Short signatures without random oracles. In Christian Cachin and Jan Camenisch, editors, EUROCRYPT\u00a02004, volume 3027 of LNCS, pages 56\u201373. Springer, Heidelberg, May 2004.","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Xavier Boyen. Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology, 21(2):149\u2013177, April 2008.","DOI":"10.1007\/s00145-007-9005-7"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Xavier Boyen, and Eu-Jin Goh. Hierarchical identity based encryption with constant size ciphertext. In Ronald Cramer, editor, EUROCRYPT\u00a02005, volume 3494 of LNCS, pages 440\u2013456. Springer, Heidelberg, May 2005.","DOI":"10.1007\/11426639_26"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, and Hovav Shacham. Randomizable proofs and delegatable anonymous credentials. In Shai Halevi, editor, CRYPTO\u00a02009, volume 5677 of LNCS, pages 108\u2013125. Springer, Heidelberg, August 2009.","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Jan Bobolz, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. Privacy-preserving incentive systems with highly efficient point-collection. In Hung-Min Sun, Shiuh-Pyng Shieh, Guofei Gu, and Giuseppe Ateniese, editors, ASIACCS 20, pages 319\u2013333. ACM Press, October 2020.","DOI":"10.1145\/3320269.3384769"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Balthazar Bauer, Georg Fuchsbauer, and Julian Loss. A classification of computational assumptions in the algebraic group model. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0II, volume 12171 of LNCS, pages 121\u2013151. Springer, Heidelberg, August 2020.","DOI":"10.1007\/978-3-030-56880-1_5"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Balthazar Bauer, Georg Fuchsbauer, and Antoine Plouviez. The one-more discrete logarithm assumption in the generic group model. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT\u00a02021, Part\u00a0IV, volume 13093 of LNCS, pages 587\u2013617. Springer, Heidelberg, December 2021.","DOI":"10.1007\/978-3-030-92068-5_20"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Balthazar Bauer, Georg Fuchsbauer, and Fabian Regen. On proving equivalence class signatures secure from non-interactive assumptions. In Qiang Tang and Vanessa Teague, editors, PKC\u00a02024, Part\u00a0I, volume 14601 of LNCS, pages 3\u201336. Springer, Heidelberg, April 2024.","DOI":"10.1007\/978-3-031-57718-5_1"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Michael Backes, Lucjan Hanzlik, Kamil Kluczniak, and Jonas Schneider.Signatures with flexible public key: Introducing equivalence classes for public keys. In Thomas Peyrin and Steven Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0II, volume 11273 of LNCS, pages 405\u2013434. Springer, Heidelberg, December 2018.","DOI":"10.1007\/978-3-030-03329-3_14"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Xavier Bultel, Pascal Lafourcade, Russell W.\u00a0F. Lai, Giulio Malavolta, Dominique Schr\u00f6der, and Sri Aravinda\u00a0Krishnan Thyagarajan. Efficient invisible and unlinkable sanitizable signatures. In Dongdai Lin and Kazue Sako, editors, PKC\u00a02019, Part\u00a0I, volume 11442 of LNCS, pages 159\u2013189. Springer, Heidelberg, April 2019.","DOI":"10.1007\/978-3-030-17253-4_6"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Paulo S. L.\u00a0M. Barreto, Ben Lynn, and Michael Scott. On the selection of pairing-friendly groups. In Mitsuru Matsui and Robert\u00a0J. Zuccherato, editors, SAC 2003, volume 3006 of LNCS, pages 17\u201325. Springer, Heidelberg, August 2004.","DOI":"10.1007\/978-3-540-24654-1_2"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Mihir Bellare, Chanathip Namprempre, David Pointcheval, and Michael Semanko.The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. Journal of Cryptology, 16(3):185\u2013215, June 2003.","DOI":"10.1007\/s00145-002-0120-1"},{"key":"1_CR16","unstructured":"Sean Bowe. BLS12-381: New zk-SNARK elliptic curve construction, 2017. https:\/\/electriccoin.co\/blog\/new-snark-curve\/."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda, Mariana Raykova, and Karn Seth. Anonymous counting tokens. In Jian Guo and Ron Steinfeld, editors, ASIACRYPT\u00a02023, Part\u00a0II, volume 14439 of LNCS, pages 245\u2013278. Springer, Heidelberg, December 2023.","DOI":"10.1007\/978-981-99-8724-5_8"},{"key":"1_CR18","unstructured":"Christian Badertscher, Mahdi Sedaghat, and Hendrik Waldner.Unlinkable policy-compliant signatures for compliant and decentralized anonymous payments.Cryptology ePrint Archive, Paper 2023\/1070, 2023. https:\/\/eprint.iacr.org\/2023\/1070."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Aisling Connolly, J\u00e9r\u00f4me Deschamps, Pascal Lafourcade, and Octavio Perez-Kempner. Protego: Efficient, revocable and auditable anonymous credentials with applications to Hyperledger Fabric. In Takanori Isobe and Santanu Sarkar, editors, INDOCRYPT 2022, volume 13774 of LNCS, pages 249\u2013271. Springer, 2022.","DOI":"10.1007\/978-3-031-22912-1_11"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Matteo Campanelli, Antonio Faonio, Dario Fiore, Ana\u00efs Querol, and Hadri\u00e1n Rodr\u00edguez. Lunar: A toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT\u00a02021, Part\u00a0III, volume 13092 of LNCS, pages 3\u201333. Springer, Heidelberg, December 2021.","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau and Dominik Hartmann. Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0III, volume 12172 of LNCS, pages 768\u2013798. Springer, Heidelberg, August 2020.","DOI":"10.1007\/978-3-030-56877-1_27"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Psi Vesely, and Nicholas\u00a0P. Ward. Marlin: Preprocessing zkSNARKs with universal and updatable SRS.In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 738\u2013768. Springer, Heidelberg, May 2020.","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. A signature scheme with efficient protocols. In Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, SCN 02, volume 2576 of LNCS, pages 268\u2013289. Springer, Heidelberg, September 2003.","DOI":"10.1007\/3-540-36413-7_20"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Elizabeth\u00a0C. Crites and Anna Lysyanskaya. Delegatable anonymous credentials from mercurial signatures. In Mitsuru Matsui, editor, CT-RSA\u00a02019, volume 11405 of LNCS, pages 535\u2013555. Springer, Heidelberg, March 2019.","DOI":"10.1007\/978-3-030-12612-4_27"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Elizabeth\u00a0C. Crites and Anna Lysyanskaya. Mercurial signatures for variable-length messages. PoPETs, 2021(4):441\u2013463, October 2021.","DOI":"10.2478\/popets-2021-0079"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Aisling Connolly, Pascal Lafourcade, and Octavio Perez-Kempner. Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes. In Goichiro Hanaoka, Junji Shikata, and Yohei Watanabe, editors, PKC 2022, Part I, volume 13177 of LNCS, pages 409\u2013438. Springer, 2022.","DOI":"10.1007\/978-3-030-97121-2_15"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Remi Clarisse and Olivier Sanders. Group signature without random oracles from randomizable signatures. In Khoa Nguyen, Wenling Wu, Kwok-Yan Lam, and Huaxiong Wang, editors, ProvSec 2020, volume 12505 of LNCS, pages 3\u201323. Springer, Heidelberg, November\u00a0\/\u00a0December 2020.","DOI":"10.1007\/978-3-030-62576-4_1"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"David Derler, Christian Hanser, and Daniel Slamanig. A new approach to efficient revocable attribute-based anonymous credentials. In Jens Groth, editor, 15th IMA International Conference on Cryptography and Coding, volume 9496 of LNCS, pages 57\u201374. Springer, Heidelberg, December 2015.","DOI":"10.1007\/978-3-319-27239-9_4"},{"key":"1_CR29","unstructured":"David Derler and Daniel Slamanig. Fully-anonymous short dynamic group signatures without encryption. Cryptology ePrint Archive, Report 2016\/154, 2016.https:\/\/eprint.iacr.org\/2016\/154."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"David Derler and Daniel Slamanig. Highly-efficient fully-anonymous dynamic group signatures. In Jong Kim, Gail-Joon Ahn, Seungjoo Kim, Yongdae Kim, Javier L\u00f3pez, and Taesoo Kim, editors, ASIACCS 18, pages 551\u2013565. ACM Press, April 2018.","DOI":"10.1145\/3196494.3196507"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Alex Escala, Gottfried Herold, Eike Kiltz, Carla R\u00e0fols, and Jorge Villar.An algebraic framework for Diffie-Hellman assumptions. In Ran Canetti and Juan\u00a0A. Garay, editors, CRYPTO\u00a02013, Part\u00a0II, volume 8043 of LNCS, pages 129\u2013147. Springer, Heidelberg, August 2013.","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Alex Escala, Gottfried Herold, Eike Kiltz, Carla R\u00e0fols, and Jorge\u00a0Luis Villar. An algebraic framework for Diffie-Hellman assumptions. Journal of Cryptology, 30(1):242\u2013288, January 2017.","DOI":"10.1007\/s00145-015-9220-6"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer and Romain Gay. Weakly secure equivalence-class signatures from standard assumptions. In Michel Abdalla and Ricardo Dahab, editors, PKC\u00a02018, Part\u00a0II, volume 10770 of LNCS, pages 153\u2013183. Springer, Heidelberg, March 2018.","DOI":"10.1007\/978-3-319-76581-5_6"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, and Claudio Orlandi.Access control encryption for equality, comparison, and more. In Serge Fehr, editor, PKC\u00a02017, Part\u00a0II, volume 10175 of LNCS, pages 88\u2013118. Springer, Heidelberg, March 2017.","DOI":"10.1007\/978-3-662-54388-7_4"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, Chethan Kamath, and Daniel Slamanig.Practical round-optimal blind signatures in the standard model from weaker assumptions. In Vassilis Zikas and Roberto De Prisco, editors, SCN 16, volume 9841 of LNCS, pages 391\u2013408. Springer, Heidelberg, August\u00a0\/\u00a0September 2016.","DOI":"10.1007\/978-3-319-44618-9_21"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, and Daniel Slamanig. Practical round-optimal blind signatures in the standard model. In Rosario Gennaro and Matthew J.\u00a0B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, volume 9216 of LNCS, pages 233\u2013253. Springer, Heidelberg, August 2015.","DOI":"10.1007\/978-3-662-48000-7_12"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Christian Hanser, and Daniel Slamanig. Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. Journal of Cryptology, 32(2):498\u2013546, April 2019.","DOI":"10.1007\/s00145-018-9281-4"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer, Eike Kiltz, and Julian Loss. The algebraic group model and its applications. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0II, volume 10992 of LNCS, pages 33\u201362. Springer, Heidelberg, August 2018.","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer and David Pointcheval. Proofs on encrypted values in bilinear groups and an application to anonymity of signatures. In Hovav Shacham and Brent Waters, editors, PAIRING 2009, volume 5671 of LNCS, pages 132\u2013149. Springer, Heidelberg, August 2009.","DOI":"10.1007\/978-3-642-03298-1_10"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer. Commuting signatures and verifiable encryption. In Kenneth\u00a0G. Paterson, editor, EUROCRYPT\u00a02011, volume 6632 of LNCS, pages 224\u2013245. Springer, Heidelberg, May 2011.","DOI":"10.1007\/978-3-642-20465-4_14"},{"key":"1_CR41","unstructured":"Georg Fuchsbauer. Breaking existential unforgeability of a signature scheme from asiacrypt 2014. Cryptology ePrint Archive, Report 2014\/892, 2014. https:\/\/eprint.iacr.org\/2014\/892."},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer and Damien Vergnaud. Fair blind signatures without random oracles. In Daniel\u00a0J. Bernstein and Tanja Lange, editors, AFRICACRYPT 10, volume 6055 of LNCS, pages 16\u201333. Springer, Heidelberg, May 2010.","DOI":"10.1007\/978-3-642-12678-9_2"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Romain Gay, Dennis Hofheinz, Lisa Kohl, and Jiaxin Pan. More efficient (almost) tightly secure structure-preserving signatures. In Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0II, volume 10821 of LNCS, pages 230\u2013258. Springer, Heidelberg, April\u00a0\/\u00a0May 2018.","DOI":"10.1007\/978-3-319-78375-8_8"},{"key":"1_CR44","unstructured":"Scott Griffy and Anna Lysyanskaya. Pacific: Privacy-preserving automated contact tracing scheme featuring integrity against cloning. Cryptology ePrint Archive, Paper 2023\/371, 2023. https:\/\/eprint.iacr.org\/2023\/371."},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Daniel Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In Lance Fortnow and Salil\u00a0P. Vadhan, editors, 43rd ACM STOC, pages 99\u2013108. ACM Press, June 2011.","DOI":"10.1145\/1993636.1993651"},{"key":"1_CR46","unstructured":"Ariel Gabizon, Zachary\u00a0J. Williamson, and Oana Ciobotaru. PLONK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953, 2019."},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Lucjan Hanzlik. Non-interactive blind signatures for random messages. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT\u00a02023, Part\u00a0V, volume 14008 of LNCS, pages 722\u2013752. Springer, Heidelberg, April 2023.","DOI":"10.1007\/978-3-031-30589-4_25"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Chlo\u00e9 H\u00e9bant, Duong\u00a0Hieu Phan, and David Pointcheval. Linearly-homomorphic signatures and scalable mix-nets. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC\u00a02020, Part\u00a0II, volume 12111 of LNCS, pages 597\u2013627. Springer, Heidelberg, May 2020.","DOI":"10.1007\/978-3-030-45388-6_21"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Christian Hanser, Max Rabkin, and Dominique Schr\u00f6der.Verifiably encrypted signatures: Security revisited and a new construction. In G\u00fcnther Pernul, Peter Y.\u00a0A. Ryan, and Edgar\u00a0R. Weippl, editors, ESORICS\u00a02015, Part\u00a0I, volume 9326 of LNCS, pages 146\u2013164. Springer, Heidelberg, September 2015.","DOI":"10.1007\/978-3-319-24174-6_8"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Christian Hanser and Daniel Slamanig. Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In Palash Sarkar and Tetsu Iwata, editors, ASIACRYPT\u00a02014, Part\u00a0I, volume 8873 of LNCS, pages 491\u2013511. Springer, Heidelberg, December 2014.","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Lucjan Hanzlik and Daniel Slamanig. With a little help from my friends: Constructing practical anonymous credentials. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 2004\u20132023. ACM Press, November 2021.","DOI":"10.1145\/3460120.3484582"},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"Mojtaba Khalili, Daniel Slamanig, and Mohammad Dakhilalian.Structure-preserving signatures on equivalence classes from standard assumptions. In Steven\u00a0D. Galbraith and Shiho Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III, volume 11923 of LNCS, pages 63\u201393. Springer, Heidelberg, December 2019.","DOI":"10.1007\/978-3-030-34618-8_3"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In Ronald Cramer, editor, TCC\u00a02012, volume 7194 of LNCS, pages 169\u2013189. Springer, Heidelberg, March 2012.","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa, Janno Siim, and Michal Zajac. Counting vampires: From univariate sumcheck to updatable ZK-SNARK. Cryptology ePrint Archive, Paper 2022\/406, 2022.","DOI":"10.1007\/978-3-031-22966-4_9"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Ueli\u00a0M. Maurer. Abstract models of computation in cryptography (invited paper). In Nigel\u00a0P. Smart, editor, 10th IMA International Conference on Cryptography and Coding, volume 3796 of LNCS, pages 1\u201312. Springer, Heidelberg, December 2005.","DOI":"10.1007\/11586821_1"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Omid Mir, Balthazar Bauer, Scott Griffy, Anna Lysyanskaya, and Daniel Slamanig. Aggregate signatures with versatile randomization and issuer-hiding multi-authority anonymous credentials. In Weizhi Meng, Christian\u00a0Damsgaard Jensen, Cas Cremers, and Engin Kirda, editors, ACM CCS 2023, pages 30\u201344. ACM Press, November 2023.","DOI":"10.1145\/3576915.3623203"},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Mary Maller, Sean Bowe, Markulf Kohlweiss, and Sarah Meiklejohn. Sonic: Zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 2111\u20132128. ACM Press, November 2019.","DOI":"10.1145\/3319535.3339817"},{"key":"1_CR58","doi-asserted-by":"crossref","unstructured":"Paz Morillo, Carla R\u00e0fols, and Jorge\u00a0Luis Villar. The kernel matrix Diffie-Hellman assumption. In Jung\u00a0Hee Cheon and Tsuyoshi Takagi, editors, ASIACRYPT\u00a02016, Part\u00a0I, volume 10031 of LNCS, pages 729\u2013758. Springer, Heidelberg, December 2016.","DOI":"10.1007\/978-3-662-53887-6_27"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Omid Mir, Daniel Slamanig, Balthazar Bauer, and Ren\u00e9 Mayrhofer.Practical delegatable anonymous credentials from equivalence class signatures. Proc. Priv. Enhancing Technol., 2023(3):488\u2013513, 2023.","DOI":"10.56553\/popets-2023-0093"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Moni Naor. On cryptographic assumptions and challenges (invited talk).In Dan Boneh, editor, CRYPTO\u00a02003, volume 2729 of LNCS, pages 96\u2013109. Springer, Heidelberg, August 2003.","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"1_CR61","doi-asserted-by":"crossref","unstructured":"V.\u00a0I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165\u2013172, 1994.","DOI":"10.1007\/BF02113297"},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Colin Putman and Keith\u00a0M. Martin. Selective delegation of attributes in mercurial signature credentials. In Elizabeth\u00a0A. Quaglia, editor, IMACC 2023, volume 14421 of LNCS, pages 181\u2013196. Springer, 2023.","DOI":"10.1007\/978-3-031-47818-5_10"},{"key":"1_CR63","unstructured":"David Pointcheval. Linearly-homomorphic signatures for short randomizable proofs of subset membership. In Eighth International Joint Conference on Electronic Voting (E-Vote-ID\u201923), 2023."},{"key":"1_CR64","doi-asserted-by":"crossref","unstructured":"David Pointcheval. Efficient universally-verifiable electronic voting with everlasting privacy. Cryptology ePrint Archive, 2024.","DOI":"10.1007\/978-3-031-71070-4_15"},{"key":"1_CR65","doi-asserted-by":"crossref","unstructured":"Carla R\u00e0fols and Arantxa Zapico. An algebraic framework for universal and updatable SNARKs. In Tal Malkin and Chris Peikert, editors, CRYPTO\u00a02021, Part\u00a0I, volume 12825 of LNCS, pages 774\u2013804, Virtual Event, August 2021. Springer, Heidelberg.","DOI":"10.1007\/978-3-030-84242-0_27"},{"key":"1_CR66","doi-asserted-by":"crossref","unstructured":"Victor Shoup. Lower bounds for discrete logarithms and related problems. In Walter Fumy, editor, EUROCRYPT\u201997, volume 1233 of LNCS, pages 256\u2013266. Springer, Heidelberg, May 1997.","DOI":"10.1007\/3-540-69053-0_18"},{"key":"1_CR67","unstructured":"Yumi Sakemi, Tetsutaro Kobayashi, Tsunekazu Saito, and Riad\u00a0S. Wahby.Pairing-Friendly Curves. Internet-Draft draft-irtf-cfrg-pairing-friendly-curves-11, Internet Engineering Task Force, November 2022. Work in Progress."},{"key":"1_CR68","doi-asserted-by":"crossref","unstructured":"Rui Shi, Yang Yang, Huamin Feng, Feng Yuan, Huiqin Xie, and Jianyi Zhang. Prirpt: Practical blockchain-based privacy-preserving reporting system with rewards. Journal of Systems Architecture, 143:102985, 2023.","DOI":"10.1016\/j.sysarc.2023.102985"},{"key":"1_CR69","unstructured":"Eva Wisse, Pietro Tedeschi, Savio Sciancalepore, and Roberto Di Pietro.A 2rid-anonymous direct authentication and remote identification of commercial drones. IEEE Internet of Things Journal, 2023."},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Yonghua Zhan, Bixia Yi, Yang Yang, Rui Shi, Chen Dong, and Minming Huang.A privilege-constrained sanitizable signature scheme for e-health systems. Journal of Systems Architecture, 142:102939, 2023.","DOI":"10.1016\/j.sysarc.2023.102939"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0888-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:35:07Z","timestamp":1733823307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}