{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:28:53Z","timestamp":1776443333811,"version":"3.51.2"},"publisher-location":"Cham","reference-count":92,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031307300","type":"print"},{"value":"9783031307317","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30731-7_6","type":"book-chapter","created":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T14:03:09Z","timestamp":1680789789000},"page":"129-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["SoK: Anonymous Credentials"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4425-4240","authenticated-orcid":false,"given":"Saqib A.","family":"Kakvi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7877-9075","authenticated-orcid":false,"given":"Keith M.","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Putman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4010-773X","authenticated-orcid":false,"given":"Elizabeth A.","family":"Quaglia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,7]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-19379-8_26","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T Acar","year":"2011","unstructured":"Acar, T., Nguyen, L.: Revocation for delegatable anonymous credentials. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 423\u2013440. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_26"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Alam\u00e9lou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A code-based group signature scheme. Des. Codes Cryptogr. 469\u2013493 (2016). https:\/\/doi.org\/10.1007\/s10623-016-0276-6","DOI":"10.1007\/s10623-016-0276-6"},{"key":"6_CR3","unstructured":"Alp\u00e1r, G., van den Broek, F., Hampiholi, B., Jacobs, B., Lueks, W., Ringers, S.: Irma: practical, decentralized and privacy-friendly identity management using smartphones. In: 10th Workshop on Hot Topics in Privacy Enhancing Technologies (HotPETs 2017) (2017)"},{"key":"6_CR4","unstructured":"Alp\u00e1r, G., Jacobs, B.: Credential design in attribute-based identity management (2013)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Angin, P., et al.: An entity-centric approach for privacy and identity management in cloud computing. In: 2010 29th IEEE Symposium on Reliable Distributed Systems, pp. 177\u2013183. IEEE (2010)","DOI":"10.1109\/SRDS.2010.28"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"G Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255\u2013270. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_16"},{"key":"6_CR7","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. LNCS, vol. 11273, pp. 405\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_14"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., et al.: Accumulators with applications to anonymity-pre-serving revocation. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 301\u2013315. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.13"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/11861386_4","volume-title":"Security Protocols","author":"E Bangerter","year":"2006","unstructured":"Bangerter, E., Camenisch, J., Lysyanskaya, A.: A cryptographic framework for the controlled release of certified data. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2004. LNCS, vol. 3957, pp. 20\u201342. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11861386_4"},{"key":"6_CR10","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":"6_CR11","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: Non-interactive anonymous credentials. IACR Cryptol. ePrint Arch. 2007, 384 (2007)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-78524-8_20","volume-title":"Theory of Cryptography","author":"M Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and noninteractive anonymous credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 356\u2013374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_20"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Bemmann, K., et al.: Fully-featured anonymous credentials with reputation system. In: Proceedings of the 13th International Conference on Availability, Reliability and Security. ARES 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3230833.3234517","DOI":"10.1145\/3230833.3234517"},{"key":"6_CR14","unstructured":"Bichsel, P., et al.: D2. 2 architecture for attribute-based credential technologies-final version. ABC4TRUST project deliverable (2014). https:\/\/abc4trust.eu\/index.php\/pub (2014)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-15317-4_24","volume-title":"Security and Cryptography for Networks","author":"P Bichsel","year":"2010","unstructured":"Bichsel, P., Camenisch, J., Neven, G., Smart, N.P., Warinschi, B.: Get shorty via group signatures without encryption. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 381\u2013398. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_24"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Blazy, O., Gaborit, P., Schrek, J., Sendrier, N.: A code-based blind signature. In: 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25\u201330 June 2017, pp. 2718\u20132722 (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8007023","DOI":"10.1109\/ISIT.2017.8007023"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-319-93387-0_12","volume-title":"Applied Cryptography and Network Security","author":"J Bl\u00f6mer","year":"2018","unstructured":"Bl\u00f6mer, J., Bobolz, J.: Delegatable attribute-based anonymous credentials from dynamically malleable signatures. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 221\u2013239. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_12"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Bobolz, J., Diemert, D., Eidens, F.: Updatable anonymous credentials and applications to incentive systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1671\u20131685 (2019)","DOI":"10.1145\/3319535.3354223"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-92548-2_9","volume-title":"Cryptology and Network Security","author":"J Bobolz","year":"2021","unstructured":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., Samelin, K.: Issuer-hiding attribute-based credentials. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 158\u2013178. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_9"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-72540-4_12","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"X Boyen","year":"2007","unstructured":"Boyen, X.: Mesh signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 210\u2013227. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_12"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-73458-1_29","volume-title":"Information Security and Privacy","author":"S Brands","year":"2007","unstructured":"Brands, S., Demuynck, L., De Decker, B.: A practical system for globally revoking the unlinkable pseudonyms of unknown users. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 400\u2013415. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_29"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-85886-7_32","volume-title":"Information Security","author":"P Camacho","year":"2008","unstructured":"Camacho, P., Hevia, A., Kiwi, M., Opazo, R.: Strong accumulators from collision-resistant hashing. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 471\u2013486. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85886-7_32"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Dubovitskaya, M.: Practical uc-secure delegatable credentials with attributes and their application to blockchain. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 683\u2013699 (2017)","DOI":"10.1145\/3133956.3134025"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Hajny, J.: Scalable revocation scheme for anonymous credentials based on n-times unlinkable proofs. In: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, pp. 123\u2013133 (2016)","DOI":"10.1145\/2994620.2994625"},{"key":"6_CR27","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-37282-7_4","volume-title":"Policies and Research in Identity Management","author":"J Camenisch","year":"2013","unstructured":"Camenisch, J., Dubovitskaya, M., Lehmann, A., Neven, G., Paquin, C., Preiss, F.-S.: Concepts and languages for privacy-preserving attribute-based authentication. In: Fischer-H\u00fcbner, S., de Leeuw, E., Mitchell, C. (eds.) IDMAN 2013. IAICT, vol. 396, pp. 34\u201352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37282-7_4"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Gro\u00df, T.: Efficient attributes for anonymous credentials. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 345\u2013356 (2008)","DOI":"10.1145\/1455770.1455814"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 481\u2013500. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_27"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93\u2013118. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_7"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5"},{"key":"6_CR32","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":"6_CR33","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/0-387-33406-8_3","volume-title":"Security and Privacy in Dynamic Environments","author":"J Camenisch","year":"2006","unstructured":"Camenisch, J., Sommer, D., Zimmermann, R.: A general certification framework with applications to privacy-enhancing certificate infrastructures. In: Fischer-H\u00fcbner, S., Rannenberg, K., Yngstr\u00f6m, L., Lindskog, S. (eds.) SEC 2006. IIFIP, vol. 201, pp. 25\u201337. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/0-387-33406-8_3"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 21\u201330 (2002)","DOI":"10.1145\/586111.586114"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_5"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Chase, M., Meiklejohn, S., Zaverucha, G.: Algebraic macs and keyed-verification anonymous credentials. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1205\u20131216 (2014)","DOI":"10.1145\/2660267.2660328"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Chase, M., Perrin, T., Zaverucha, G.: The signal private group system and anonymous credentials supporting efficient verifiable encryption. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1445\u20131459 (2020)","DOI":"10.1145\/3372297.3417887"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Security without identification: transaction systems to make big brother obsolete. Commun. ACM 28(10), 1030\u20131044 (1985). https:\/\/doi.org\/10.1145\/4372.4373","DOI":"10.1145\/4372.4373"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (eds.) Advances in Cryptology\u2013EUROCRYPT 1991. EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Berlin, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22","DOI":"10.1007\/3-540-46416-6_22"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Chen, L., Li, J.: VLR group signatures with indisputable exculpability and efficient revocation. Int. J. Inf. Priv. Secur. Integr. 2 1(2\u20133), 129\u2013159 (2010)","DOI":"10.1504\/IJIPSI.2012.046130"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Chu, C.K., Liu, J.K., Huang, X., Zhou, J.: Verifier-local revocation group signatures with time-bound keys. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, pp. 26\u201327 (2012)","DOI":"10.1145\/2414456.2414470"},{"key":"6_CR42","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 \u2013 PKC 2022. PKC 2022. LNCS, vol. 13177, pp. 409\u2013438. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_15","DOI":"10.1007\/978-3-030-97121-2_15"},{"key":"6_CR43","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":"6_CR44","unstructured":"Crites, E.C., Lysyanskaya, A.: Mercurial signatures for variable-length messages. IACR Cryptol. ePrint Arch. 2020, 979 (2020)"},{"key":"6_CR45","unstructured":"Damg\u00e5rd, I., Triandopoulos, N.: Supporting non-membership proofs with bilinear-map accumulators. IACR Cryptol. ePrint Arch. 2008, 538 (2008)"},{"issue":"3","key":"6_CR46","first-page":"164","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. Enhanc. Technol. 2018(3), 164\u2013180 (2018)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"6_CR47","unstructured":"Doesburg, J., Jacobs, B., Ringers, S.: Using IRMA for small scale digital elections (2020)"},{"key":"6_CR48","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: Crystals - dilithium: digital signatures from module lattices. IACR Cryptol. ePrint Arch. 2017, 633 (2017)"},{"key":"6_CR49","doi-asserted-by":"crossref","unstructured":"F\u00f6rster, D., Kargl, F., L\u00f6hr, H.: PUCA: a pseudonym scheme with user-controlled anonymity for vehicular ad-hoc networks (VANET). In: 2014 IEEE Vehicular Networking Conference (VNC), pp. 25\u201332. IEEE (2014)","DOI":"10.1109\/VNC.2014.7013305"},{"key":"6_CR50","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"},{"issue":"2","key":"6_CR51","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":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45811-5_29","volume-title":"Information Security","author":"MT Goodrich","year":"2002","unstructured":"Goodrich, M.T., Tamassia, R., Hasi\u0107, J.: An efficient dynamic and distributed cryptographic accumulator$$^{*}$$. In: Chan, A.H., Gligor, V. (eds.) ISC 2002. LNCS, vol. 2433, pp. 372\u2013388. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45811-5_29"},{"key":"6_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17373-8_23","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 395\u2013412. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_23"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Hajny, J., Malina, L.: Anonymous credentials with practical revocation. In: 2012 IEEE First AESS European Conference on Satellite Telecommunications (ESTEL), pp. 1\u20136. IEEE (2012)","DOI":"10.1109\/ESTEL.2012.6400081"},{"key":"6_CR55","unstructured":"Hampiholi, B., Jacobs, B.: Trusted self-enrolment for attribute-based credentials on mobile phones. In: Proceedings of the IFIP Summer School 2015, Edinburgh, 16\u201321 August 2015 (2015)"},{"key":"6_CR56","doi-asserted-by":"crossref","unstructured":"Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and their application to anonymous credentials. In: International Conference on the Theory and Application of Cryptology and Information Security. pp. 491\u2013511. Springer (2014)","DOI":"10.1007\/978-3-662-45611-8_26"},{"key":"6_CR57","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. LNCS, vol. 8873, pp. 491\u2013511. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_26"},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"H\u00f6lzl, M., Roland, M., Mir, O., Mayrhofer, R.: Bridging the gap in privacy-preserving revocation: practical and scalable revocation of mobile eIDs. In: Proceedings of the 33rd Annual ACM Symposium on Applied Computing, pp. 1601\u20131609 (2018)","DOI":"10.1145\/3167132.3167303"},{"key":"6_CR59","unstructured":"IBM: Iemix (2022). https:\/\/github.com\/IBM\/idemix"},{"key":"6_CR60","unstructured":"ISO: Information technology - security techniques - anonymous digital signatures - part 2: Mechanisms using a group public key. ISO 20008\u20132:2013, International Organization for Standardization, Geneva, Switzerland (2013). https:\/\/www.iso.org\/standard\/56916.html"},{"key":"6_CR61","unstructured":"ISO: Information technology - security techniques - anonymous entity authentication - part 2: Mechanisms using a group public key. ISO 20009\u20132:2013, International Organization for Standardization, Geneva, Switzerland (2013). https:\/\/www.iso.org\/standard\/56913.html"},{"key":"6_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-75551-7_8","volume-title":"Privacy Enhancing Technologies","author":"PC Johnson","year":"2007","unstructured":"Johnson, P.C., Kapadia, A., Tsang, P.P., Smith, S.W.: Nymble: anonymous ip-address blocking. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 113\u2013133. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75551-7_8"},{"key":"6_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-67816-0_14","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"N Kaaniche","year":"2017","unstructured":"Kaaniche, N., Laurent, M., Rocher, P.-O., Kiennert, C., Garcia-Alfaro, J.: $$\\cal{PCS}$$, a privacy-preserving certification scheme. In: Garcia-Alfaro, J., Navarro-Arribas, G., Hartenstein, H., Herrera-Joancomart\u00ed, J. (eds.) ESORICS\/DPM\/CBT -2017. LNCS, vol. 10436, pp. 239\u2013256. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67816-0_14"},{"key":"6_CR64","unstructured":"Khader, D.: Attribute based group signatures. IACR Cryptol. ePrint Arch. 2007, 159 (2007)"},{"key":"6_CR65","doi-asserted-by":"crossref","unstructured":"Kumar, V., Li, H., Park, J.M., Bian, K., Yang, Y.: Group signatures with probabilistic revocation: a computationally-scalable approach for providing privacy-preserving authentication. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1334\u20131345 (2015)","DOI":"10.1145\/2810103.2813602"},{"key":"6_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-24712-5_1","volume-title":"Communications and Multimedia Security","author":"J Lapon","year":"2011","unstructured":"Lapon, J., Kohlweiss, M., De Decker, B., Naessens, V.: Analysis of revocation strategies for anonymous idemix credentials. In: De Decker, B., Lapon, J., Naessens, V., Uhl, A. (eds.) CMS 2011. LNCS, vol. 7025, pp. 3\u201317. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24712-5_1"},{"key":"6_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-72738-5_17","volume-title":"Applied Cryptography and Network Security","author":"J Li","year":"2007","unstructured":"Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 253\u2013269. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72738-5_17"},{"key":"6_CR68","unstructured":"Li, J., Kim, K.: Attribute-based ring signatures. IACR Cryptol. ePrint Arch. 2008, 394 (2008)"},{"key":"6_CR69","doi-asserted-by":"crossref","unstructured":"Lin, C., He, D., Zhang, H., Shao, L., Huang, X.: Privacy-enhancing decentralized anonymous credential in smart grids. Comput. Stand. Interfaces 75, 103505 (2021)","DOI":"10.1016\/j.csi.2020.103505"},{"key":"6_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-31284-7_14","volume-title":"Applied Cryptography and Network Security","author":"H Lipmaa","year":"2012","unstructured":"Lipmaa, H.: Secure accumulators from Euclidean rings without trusted setup. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 224\u2013240. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31284-7_14"},{"key":"6_CR71","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-319-18467-8_31","volume-title":"ICT Systems Security and Privacy Protection","author":"W Lueks","year":"2015","unstructured":"Lueks, W., Alp\u00e1r, G., Hoepman, J.H., Vullers, P.: Fast revocation of attribute-based credentials for both users and verifiers. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 463\u2013478. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18467-8_31"},{"key":"6_CR72","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Attribute-based signatures: achieving attribute-privacy and collusion-resistance. IACR Cryptol. ePrint Arch. 2008, 328 (2008)"},{"key":"6_CR73","doi-asserted-by":"crossref","unstructured":"Mir, O., Slamanig, D., Bauer, B., Mayrhofer, R.: Practical delegatable anonymous credentials from equivalence class signatures. Cryptology ePrint Archive (2022)","DOI":"10.56553\/popets-2023-0093"},{"key":"6_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-00468-1_26","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"T Nakanishi","year":"2009","unstructured":"Nakanishi, T., Fujii, H., Hira, Y., Funabiki, N.: Revocable group signature schemes with constant costs for signing and verifying. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 463\u2013480. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_26"},{"key":"6_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"6_CR76","unstructured":"Paquin, C., Zaverucha, G.: U-prove cryptographic specification v1. 1. Technical report, Microsoft Corporation (2011)"},{"issue":"3","key":"6_CR77","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3338854","volume":"19","author":"HSG Pussewalage","year":"2019","unstructured":"Pussewalage, H.S.G., Oleshchuk, V.A.: An anonymous delegatable attribute-based credential scheme for a collaborative e-health environment. ACM Trans. Internet Technol. (TOIT) 19(3), 1\u201322 (2019)","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"6_CR78","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70972-7_1","volume-title":"Financial Cryptography and Data Security","author":"S Ringers","year":"2017","unstructured":"Ringers, S., Verheul, E., Hoepman, J.-H.: An efficient self-blindable attribute-based credential scheme. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 3\u201320. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_1"},{"key":"6_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"issue":"1","key":"6_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-020-09365-w","volume":"34","author":"RD Rothblum","year":"2021","unstructured":"Rothblum, R.D., Sealfon, A., Sotiraki, K.: Toward non-interactive zero-knowledge proofs for NP from LWE. J. Cryptol. 34(1), 1\u201335 (2021). https:\/\/doi.org\/10.1007\/s00145-020-09365-w","journal-title":"J. Cryptol."},{"key":"6_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-02384-2_13","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"SF Shahandashti","year":"2009","unstructured":"Shahandashti, S.F., Safavi-Naini, R.: Threshold attribute-based signatures and their application to anonymous credential systems. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 198\u2013216. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_13"},{"key":"6_CR82","unstructured":"Sporny, M., Longley, D., Chadwick, D.: Verifiable credentials data model v1.1. Technical report, World Wide Web Consortium: Verifiable Credentials Working Group (2022). https:\/\/www.w3.org\/TR\/2022\/REC-vc-data-model-20220303\/"},{"key":"6_CR83","unstructured":"Sujing, Z., Dongdai, L.: A shorter group signature with verifier-location revocation and backward unlinkability. Technical report, Cryptology ePrint Archive: Report 2006\/100 (2006)"},{"key":"6_CR84","unstructured":"TCG: Trusted platform module library part 1: Architecture. Technical report Revision 01.53, Trusted Computing Group (2019)"},{"key":"6_CR85","doi-asserted-by":"crossref","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Blacklistable anonymous credentials: blocking misbehaving users without TTPs. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 72\u201381 (2007)","DOI":"10.1145\/1315245.1315256"},{"key":"6_CR86","doi-asserted-by":"crossref","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: PEREA: towards practical TTP-free revocation in anonymous authentication. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 333\u2013344 (2008)","DOI":"10.1145\/1455770.1455813"},{"issue":"4","key":"6_CR87","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1880022.1880033","volume":"13","author":"PP Tsang","year":"2010","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: BLAC: revoking repeatedly misbehaving anonymous users without relying on TTPs. ACM Trans. Inf. Syst. Secur. (TISSEC) 13(4), 1\u201333 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"6_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-45682-1_31","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"ER Verheul","year":"2001","unstructured":"Verheul, E.R.: Self-blindable credential certificates from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 533\u2013551. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_31"},{"key":"6_CR89","unstructured":"Verheul, E.R.: Practical backward unlinkable revocation in fido, German e-id, idemix and u-prove. IACR Cryptol. ePrint Arch. 2016, 217 (2016)"},{"key":"6_CR90","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-37282-7_5","volume-title":"Policies and Research in Identity Management","author":"P Vullers","year":"2013","unstructured":"Vullers, P., Alp\u00e1r, G.: Efficient selective disclosure on smart cards using idemix. In: Fischer-H\u00fcbner, S., de Leeuw, E., Mitchell, C. (eds.) IDMAN 2013. IAICT, vol. 396, pp. 53\u201367. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37282-7_5"},{"issue":"7","key":"6_CR91","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1093\/ietfec\/e91-a.7.1831","volume":"91","author":"J Zhang","year":"2008","unstructured":"Zhang, J., Ma, L., Sun, R., Wang, Y.: More efficient VLR group signature satisfying exculpability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(7), 1831\u20131835 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"6_CR92","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-34129-8_39","volume-title":"Information and Communications Security","author":"Y Zhang","year":"2012","unstructured":"Zhang, Y., Feng, D.: Efficient attribute proofs in anonymous credential using attribute-based cryptography. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 408\u2013415. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34129-8_39"}],"container-title":["Lecture Notes in Computer Science","Security Standardisation Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30731-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T21:13:27Z","timestamp":1729199607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30731-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031307300","9783031307317"],"references-count":92,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30731-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Security Standardisation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/affiliated.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}