{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:56:02Z","timestamp":1781567762804,"version":"3.54.5"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032195661","type":"print"},{"value":"9783032195678","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-19567-8_3","type":"book-chapter","created":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:41:25Z","timestamp":1781566885000},"page":"46-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vision: A Modular Framework for\u00a0Anonymous Credential Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-7899","authenticated-orcid":false,"given":"Anja","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4074-0348","authenticated-orcid":false,"given":"Andrey","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1686-8029","authenticated-orcid":false,"given":"Alexandros","family":"Zacharakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"3_CR1","unstructured":"Regulation (EU) 2024\/1183 of the European parliament and of the council of 11 April 2024 amending regulation (EU) no 910\/2014 as regards establishing the European digital identity framework (2014). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX:32014R0910. Accessed 18 Oct 2024"},{"key":"3_CR2","unstructured":"ISO\/IEC WD 24843: Information security\u2014attribute-based credentials. Working Draft ISO\/IEC WD 24843, International Organization for Standardization, 2025. Under development. A working group has prepared a draft"},{"key":"3_CR3","unstructured":"EU\u00a0FP7 Trust & Security\u00a0Program ABC4TRUST. Attribute-based credentials for trust. ABC4TRUST project (2014). https:\/\/abc4trust.eu\/"},{"key":"3_CR4","unstructured":"Amrein, P. (2025). https:\/\/github.com\/UbiqueInnovation\/zkattest-rs"},{"issue":"3","key":"3_CR5","first-page":"3","volume":"1","author":"DF Aranha","year":"2024","unstructured":"Aranha, D.F., Fotiadis, G., Guillevic, A.: A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level. CiC 1(3), 3 (2024)","journal-title":"CiC"},{"key":"3_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-38554-4_17","volume-title":"CRYPTO 2023, Part V","author":"W Beullens","year":"2023","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 518\u2013548. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17"},{"key":"3_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-031-78679-2_7","volume-title":"FC 2024, Part II","author":"J Bobolz","year":"2024","unstructured":"Bobolz, J., Diaz, J., Kohlweiss, M.: Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Clark, J., Shi, E. (eds.) FC 2024, Part II. LNCS, vol. 14745, pp. 121\u2013139. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78679-2_7"},{"key":"3_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"3_CR9","unstructured":"Boneh, D., Fisch, B., Gabizon, A., Williamson, Z.: A simple range proof from polynomial commitments. Technical report (2020). Accessed 12 Sept 2025"},{"key":"3_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"EUROCRYPT 2016, Part II","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"3_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-031-38545-2_13","volume-title":"CRYPTO 2023, Part II","author":"J Bootle","year":"2023","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Sorniotti, A.: A framework for practical anonymous credentials from lattices. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 384\u2013417. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_13"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-45572-3_1","volume-title":"Trust and Trustworthy Computing - Trust 2016","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Drijvers, M., Lehmann, A.: Anonymous attestation using the strong Diffie Hellman assumption revisited. In: Franz, M., Papadimitratos, P. (eds.) Trust 2016. LNCS, vol. 9824, pp. 1\u201320. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45572-3_1"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clonewars: efficient periodic n-times anonymous authentication. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. CCS \u201906, pp. 201\u2013210. Association for Computing Machinery, New York, NY, USA (2006)","DOI":"10.1145\/1180405.1180431"},{"key":"3_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-31301-6_1","volume-title":"SAC 2015","author":"J Camenisch","year":"2016","unstructured":"Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G.L., Neven, G., Pedersen, M.\u00d8.: Formal treatment of privacy-enhancing credential systems. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 3\u201324. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31301-6_1"},{"key":"3_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"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":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2075\u20132092. ACM Press (2019)","DOI":"10.1145\/3319535.3339820"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (2002)","DOI":"10.1145\/509907.509980"},{"key":"3_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-031-64381-1_4","volume-title":"AFRICACRYPT 24","author":"S Celi","year":"2024","unstructured":"Celi, S., Levin, S., Rowell, J.: CDLS: proving knowledge of committed discrete logarithms with soundness. In: Vaudenay, S., Petit, C. (eds.) AFRICACRYPT 24. LNCS, vol. 14861, pp. 69\u201393. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-64381-1_4"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chairattana-Apirom, R., D\u00f6ttling, N., Lysyanskaya, A., Tessaro, S.: Everlasting anonymous rate-limited tokens. Cryptology ePrint Archive, Paper 2025\/1030 (2025)","DOI":"10.1007\/978-981-95-5119-4_14"},{"key":"3_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"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":"3_CR23","doi-asserted-by":"crossref","unstructured":"Chase, M., Meiklejohn, S., Zaverucha, G.: Algebraic MACs and keyed-verification anonymous credentials. In: Ahn, G.-J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 1205\u20131216. ACM Press (2014)","DOI":"10.1145\/2660267.2660328"},{"key":"3_CR24","unstructured":"Chase, M., Orr\u00f9, M., Perrin, T., Zaverucha, G.: Proofs of discrete logarithm equality across groups. Cryptology ePrint Archive, Report 2022\/1593 (2022)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Davidson, A., Iyengar, J., Wood, C.A.: The Privacy Pass Architecture. RFC 9576 (2024)","DOI":"10.17487\/RFC9576"},{"key":"3_CR26","unstructured":"Desmoulins, N., Dumanois, A., Kane, S., Traor\u00e9, J.: Making BBS anonymous credentials eIDAS 2.0 compliant (2025). https:\/\/eprint.iacr.org\/2025\/619"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Dubois, A., Kloo\u00df, M., Lai, R.W.F., Woo, I.K.Y.: Lattice-based proof-friendly signatures from vanishing short integer solutions. Cryptology ePrint Archive, Paper 2025\/356 (2025)","DOI":"10.1007\/978-3-031-91820-9_15"},{"key":"3_CR28","unstructured":"European Commission: EU digital identity wallet home (n.d.). https:\/\/ec.europa.eu\/digital-building-blocks\/sites\/spaces\/EUDIGITALIDENTITYWALLET\/pages\/694487738\/EU+Digital+Identity+Wallet+Home. Accessed 07 Oct 2025"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-031-48621-0_16","volume-title":"Theory of Cryptography - TCC 2023, Part III","author":"A Faonio","year":"2023","unstructured":"Faonio, A., Fiore, D., Kohlweiss, M., Russo, L., Zajac, M.: From polynomial IOP and commitments to non-malleable zkSNARKs. In: Rothblum, G., Wee, H. (eds.) TCC 2023, Part III. LNCS, vol. 14371, pp. 455\u2013485. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_16"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Faz-Hern\u00e1ndez, A., Ladd, W., Maram, D.: ZkAttest: ring and group signatures on top of existing ECDSA keys. Cryptology ePrint Archive, Report 2021\/1183 (2021)","DOI":"10.1007\/978-3-030-99277-4_4"},{"key":"3_CR31","unstructured":"Frigo, M., shelat, A.: Anonymous credentials from ECDSA. Cryptology ePrint Archive, Report 2024\/2010 (2024)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Rodr\u00edguez, J., Krenn, S., Bernabe, J.B., Skarmeta, A.: Beyond selective disclosure: extending distributed p-abc implementations by commit-and-prove techniques. Comput. Netw. 248, 110498 (2024)","DOI":"10.1016\/j.comnet.2024.110498"},{"key":"3_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"EUROCRYPT 2016, Part II","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"3_CR34","unstructured":"Harchandani, L. (2025). https:\/\/github.com\/docknetwork\/crypto\/tree\/main\/equality_across_groups"},{"key":"3_CR35","unstructured":"Hesse, J., Singh, N., Sorniotti, A.: How to bind anonymous credentials to humans. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 3047\u20133064. USENIX Association, Anaheim, CA (2023)"},{"key":"3_CR36","unstructured":"ISO. Iso 20008-2:2013: Information technology - security techniques - anonymous digital signatures - part 2: mechanisms using a group public key. Standard, International Organization for Standardization, Geneva, CH (2013)"},{"key":"3_CR37","unstructured":"Kalos, V., Bernstein, G.M.: Bbs per verifier linkability. Internet Draft draft-irtf-cfrg-bbs-per-verifier-linkability-02, Internet Research Task Force, September 2025"},{"key":"3_CR38","unstructured":"Kalos, V., Bernstein, G.M.: Blind bbs signatures. Internet Draft draft-irtf-cfrg-bbs-blind-signatures-01, Internet Research Task Force, March 2025"},{"key":"3_CR39","unstructured":"Kilian, J.: Uses of Randomness in Algorithms and Protocols. MIT Press (1990)"},{"key":"3_CR40","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-031-91826-1_7","volume-title":"PKC 2025, Part III","author":"A Lehmann","year":"2025","unstructured":"Lehmann, A., \u00d6zbay, C.: Commit-and-prove system for vectors and applications to threshold signing. In: Jager, T., Pan, J. (eds.) PKC 2025, Part III. LNCS, vol. 15676, pp. 200\u2013232. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91826-1_7"},{"key":"3_CR41","unstructured":"Looker, T., Kalos, V., Whitehead, A., Lodder, M.: The BBS Signature Scheme. Internet-Draft draft-irtf-cfrg-bbs-signatures-09, Internet Engineering Task Force, July 2025. Work in Progress"},{"key":"3_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","volume-title":"CRYPTO 2022, Part II","author":"V Lyubashevsky","year":"2022","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3"},{"key":"3_CR43","unstructured":"Orr\u00f9, M.: Revisiting keyed-verification anonymous credentials. Cryptology ePrint Archive, Report 2024\/1552 (2024)"},{"issue":"1","key":"3_CR44","first-page":"23","volume":"2","author":"M Orr\u00f9","year":"2025","unstructured":"Orr\u00f9, M., Kadianakis, G., Maller, M., Zaverucha, G.: Beyond the circuit: how to minimize foreign arithmetic in ZKP circuits. CiC 2(1), 23 (2025)","journal-title":"CiC"},{"key":"3_CR45","unstructured":"Orr\u00f9, M.: Sigma protocols. Internet Draft draft-orru-zkproof-sigma-protocols-00, February 2025"},{"key":"3_CR46","unstructured":"Paquin, C., Policharla, G.-V., Zaverucha, G.: Crescent: stronger privacy for existing credentials. Cryptology ePrint Archive, Report 2024\/2013 (2024)"},{"key":"3_CR47","unstructured":"Patton, C.: [privacy-pass] arc, acs: dividing the work with CFRG (2025). https:\/\/mailarchive.ietf.org\/arch\/msg\/privacy-pass\/AgLCkR1I_DdP1Q9eSALbDGmkkVM\/. Mailing list post. Accessed 02 Apr 2026"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"key":"3_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-76953-0_17","volume-title":"CT-RSA 2018","author":"D Pointcheval","year":"2018","unstructured":"Pointcheval, D., Sanders, O.: Reassessing security of randomizable signatures. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 319\u2013338. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_17"},{"key":"3_CR50","unstructured":"Schlesinger, S., Katz, J.: Anonymous credit tokens. Internet-Draft draft-schlesinger-cfrg-act-00, Internet Engineering Task Force, August 2025. Work in Progress"},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-031-30589-4_24","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"S Tessaro","year":"2023","unstructured":"Tessaro, S., Zhu, C.: Revisiting BBS signatures. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 691\u2013721. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_24"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Woo, A.P.Y., Ozdemir, A., Sharp, C., Pornin, T., Grubbs, P.: Efficient proofs of possession for legacy signatures. In: Blanton, M., Enck, W., Nita-Rotaru, C. (eds.) 2025 IEEE Symposium on Security and Privacy, pp. 3291\u20133308. IEEE Computer Society Press (2025)","DOI":"10.1109\/SP61157.2025.00080"},{"key":"3_CR53","unstructured":"Yun, C., Wood, C.A.: Anonymous rate-limited credentials. Internet-Draft draft-yun-cfrg-arc-01, Internet Engineering Task Force, August 2025. Work in Progress"},{"key":"3_CR54","unstructured":"ZKProof Standards Committee: Plan for 2024\/2025 - zkproof standards (2024). https:\/\/docs.zkproof.org\/standards#plan-for-20242025. Accessed 10 Oct 2025"}],"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-032-19567-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:41:29Z","timestamp":1781566889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-19567-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032195661","9783032195678"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-19567-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","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":"Passau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ssr2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-passau.de\/ssr2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}