{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:07:39Z","timestamp":1781608059976,"version":"3.54.5"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018861","type":"print"},{"value":"9783032018878","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01887-8_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:21Z","timestamp":1755371841000},"page":"291-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Server-Aided Anonymous Credentials"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1990-1329","authenticated-orcid":false,"given":"Rutchathon","family":"Chairattana-Apirom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9811-1610","authenticated-orcid":false,"given":"Franklin","family":"Harding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-3550","authenticated-orcid":false,"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3751-8546","authenticated-orcid":false,"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","unstructured":"Architecture proposal for the german eIDAS implementation (2024). https:\/\/gitlab.opencode.de\/bmi\/eudi-wallet\/eidas-2.0-architekturkonzept\/-\/blob\/main\/architecture-proposal\/01- architecture-proposal.md. Accessed 13 Feb 2025"},{"key":"10_CR2","unstructured":"The European digital identity wallet architecture and reference framework (2024). https:\/\/eu-digital-identity-wallet.github.io\/eudi-doc-architecture-and-reference-framework\/1.4.0\/arf\/. Accessed 13 Feb 2025"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"Security and Cryptography for Networks","author":"MH Au","year":"2006","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 111\u2013125. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_8"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., Lysyanskaya, A.: Anonymous credentials light. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 1087\u20131098. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516687","DOI":"10.1145\/2508859.2516687"},{"key":"10_CR5","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R.: Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography. Technical report NIST Special Publication 800-56A, National Institute of Standards (NIST). https:\/\/nvlpubs.nist.gov\/nistpubs\/SpecialPublications\/ NIST.SP.800-56Ar3.pdf. Accessed 13 Feb 2025"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-69453-5_20","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"A Barki","year":"2017","unstructured":"Barki, A., Brunet, S., Desmoulins, N., Traor\u00e9, J.: Improved algebraic MACs and practical keyed-verification anonymous credentials. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 360\u2013380. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_20"},{"key":"10_CR7","unstructured":"Baum, C., et al.: Cryptographers\u2019 feedback on the EU digital identity\u2019s ARF (2024). https:\/\/github.com\/user-attachments\/files\/15904122\/cryptographers-feedback.pdf"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 1993, pp. 62\u201373. ACM Press (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-77870-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 33\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_2"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Safecurves: choosing safe curves for elliptic-curve cryptography. https:\/\/safecurves.cr.yp.to\/. Accessed 13 Feb 2025","DOI":"10.1007\/978-3-031-83490-5_7"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9005-7","journal-title":"J. Cryptol."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rethinking public key infrastructure and digital certificates\u2014 building in privacy. Ph.D. thesis, Eindhoven Inst. of Tech. The Netherlands (1999)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"10_CR14","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-22312-0_20","volume-title":"ICT Systems Security and Privacy Protection","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., Drijvers, M., Dzurenda, P., Hajny, J.: Fast keyed-verification anonymous credentials on standard smart cards. In: Dhillon, G., Karlsson, F., Hedstr\u00f6m, K., Z\u00faquete, A. (eds.) SEC 2019. IAICT, vol. 562, pp. 286\u2013298. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22312-0_20"},{"key":"10_CR15","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","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":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-31301-6_1","volume-title":"Selected Areas in Cryptography \u2013 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":"10_CR17","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":"10_CR18","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":"10_CR19","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":"10_CR20","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Atluri, V. (ed.) ACM CCS 2002, pp. 21\u201330. ACM Press (2002). https:\/\/doi.org\/10.1145\/586110.586114","DOI":"10.1145\/586110.586114"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Chairattana-Apirom, R., Harding, F., Lysyanskaya, A., Tessaro, S.: Server-aided anonymous credentials. Cryptology ePrint Archive, Paper 2025\/513 (2025). https:\/\/eprint.iacr.org\/2025\/513","DOI":"10.1007\/978-3-032-01887-8_10"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Pairing-free blind signatures from CDH assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 174\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_6","DOI":"10.1007\/978-3-031-68376-3_6"},{"key":"10_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2660267.2660328","DOI":"10.1145\/2660267.2660328"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Chase, M., Perrin, T., Zaverucha, G.: The Signal private group system and anonymous credentials supporting efficient verifiable encryption. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1445\u20131459. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417887","DOI":"10.1145\/3372297.3417887"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology","author":"D Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199\u2013203. Springer, Boston (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-90456-2_11","volume-title":"Theory of Cryptography","author":"N D\u00f6ttling","year":"2021","unstructured":"D\u00f6ttling, N., Hartmann, D., Hofheinz, D., Kiltz, E., Sch\u00e4ge, S., Ursu, B.: On the impossibility of purely algebraic signatures. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 317\u2013349. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_11"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Hardt, D.: The OAuth 2.0 Authorization Framework. RFC 6749 (2012). https:\/\/doi.org\/10.17487\/RFC6749. https:\/\/www.rfc-editor.org\/info\/rfc6749","DOI":"10.17487\/RFC6749"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Kastner, J., Loss, J., Renawi, O.: Concurrent security of anonymous credentials light, revisited. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 45\u201359. ACM Press (2023). https:\/\/doi.org\/10.1145\/3576915.3623184","DOI":"10.1145\/3576915.3623184"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Kondi, Y., Shelat, A.: Improved straight-line extraction in the random oracle model with applications to signature aggregation. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_10","DOI":"10.1007\/978-3-031-22966-4_10"},{"key":"10_CR31","unstructured":"Looker, T., Kalos, V., Whitehead, A., Lodder, M.: The BBS Signature Scheme. Internet-Draft draft-IRTF-CFRG-BBS-signatures-07, Internet Engineering Task Force (2024). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-bbs- signatures\/07\/. Work in Progress"},{"key":"10_CR32","unstructured":"Lysyanskaya, A.: Signature schemes and applications to cryptographic protocol design. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (2002)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., Rivest, R., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H., Adams, C. (eds.) Selected Areas in Cryptography. LNCS, vol.\u00a01758 (1999)","DOI":"10.1007\/3-540-46513-8_14"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Maurer, U.: Zero-knowledge proofs of knowledge for group homomorphisms. DCC 77(2-3), 663\u2013676 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0103-5","DOI":"10.1007\/s10623-015-0103-5"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Mirzamohammadi, O., et al.: Keyed-verification anonymous credentials with highly efficient partial disclosure. Cryptology ePrint Archive, Paper 2025\/041 (2025). https:\/\/eprint.iacr.org\/2025\/041","DOI":"10.62056\/aey7n59p1"},{"key":"10_CR36","unstructured":"Orange Innovation: The BBS# protocol: technical details. https:\/\/github.com\/eu-digital-identity-wallet\/eudi-doc- architecture-and-reference-framework\/issues\/193#issuecomment- 2179355934. Accessed 13 Feb 2025"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Tessaro, S., Zaverucha, G., Zhu, C.: Oblivious issuance of proofs. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 254\u2013287. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_8","DOI":"10.1007\/978-3-031-68400-5_8"},{"key":"10_CR38","unstructured":"Orr\u00f9, M.: Revisiting keyed-verification anonymous credentials. Cryptology ePrint Archive, Paper 2024\/1552 (2024). https:\/\/eprint.iacr.org\/2024\/1552"},{"key":"10_CR39","unstructured":"Paquin, C., Zaverucha, G.: U-prove cryptographic specification v1.1 (revision 3) (2013). https:\/\/www.microsoft.com\/en-us\/research\/publication\/u-prove-cryptographic-specification-v1-1-revision-3\/. Released under the Open Specification Promise. http:\/\/www.microsoft.com\/openspecifications\/en\/us\/programs\/osp\/default.aspx"},{"key":"10_CR40","unstructured":"Sakemi, Y., Kobayashi, T., Saito, T., Wahby, R.S.: Pairing-Friendly Curves. Internet-Draft draft-IRTF-CFRG-pairing-friendly-curves-11, Internet Engineering Task Force (2022). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves\/11\/. Work in Progress"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Tessaro, S., Zhu, C.: Revisiting BBS signatures. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 691\u2013721. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_24","DOI":"10.1007\/978-3-031-30589-4_24"},{"key":"10_CR42","unstructured":"Traor\u00e9, J., Dumanois, A.: BBS# and eIDAS 2.0.: making BBS anonymous credentials eIDAS 2.0 compliant. https:\/\/csrc.nist.gov\/csrc\/media\/presentations\/2024\/ wpec2024-3b3\/images-media\/wpec2024-3b3-slides-antoine- jacques--BBS-sharp-eIDAS2.pdf. Accessed 13 Feb 2025"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01887-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T13:37:36Z","timestamp":1760621856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}