{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:19Z","timestamp":1784638879568,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_1","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:48Z","timestamp":1784635488000},"page":"3-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Post-quantum EPID Signatures From VOLE-in-the-Head"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0412-3191","authenticated-orcid":false,"given":"Zuming","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7937-3779","authenticated-orcid":false,"given":"Yanhong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8373-9200","authenticated-orcid":false,"given":"Deng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9459-502X","authenticated-orcid":false,"given":"Neng","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"1_CR1","unstructured":"ISO\/IEC 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). https:\/\/www.iso.org\/standard\/56916.html"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Argo, S.,\u00a0G\u00fcneysu, T.,\u00a0Jeudy, C.,\u00a0Land, G.,\u00a0Roux-Langlois, A.,\u00a0Sanders, O.: Practical post-quantum signatures for privacy. In: CCS 2024, pp. 1523\u20131537. ACM (2024)","DOI":"10.1145\/3658644.3670297"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Avanzi, R.,\u00a0Chakraborty, B.,\u00a0List, E.: The large block cipher family vistrutah. IACR Cryptol. ePrint Arch. 976 (2025). To appear in ToSC 2026","DOI":"10.46586\/tosc.v2025.i3.1-150"},{"key":"1_CR5","unstructured":"Baum, C., et al.: Faest: algorithm specifications. Technical report, National Institute of Standards and Technology (2023). https:\/\/faest.info\/faest-spec-v2.0.pdf"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: One tree to rule them all: optimizing GGM trees and owfs for post-quantum signatures. In: ASIACRYPT 2024. LNCS, vol. 15484, pp. 463\u2013493. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_15","DOI":"10.1007\/978-981-96-0875-1_15"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In: CRYPTO 2023. LNCS, vol. 14085, pp. 581\u2013615. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.,\u00a0H\u00fclsing, A.,\u00a0K\u00f6lbl, S.,\u00a0Niederhagen, R.,\u00a0Rijneveld, J.,\u00a0Schwabe, P.: The sphincs$$ ^{\\text{+}}$$ signature framework. In: ACM CCS 2019,, pp. 2129\u20132146. ACM (2019)","DOI":"10.1145\/3319535.3363229"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-12612-4_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 251\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_13"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Brickell, E.,\u00a0Li, J.: Enhanced privacy id: a direct anonymous attestation scheme with enhanced revocation capabilities. In: WPES 2007, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1314333.1314337"},{"issue":"1","key":"1_CR12","first-page":"3","volume":"1","author":"E Brickell","year":"2011","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. Int. J. Inf. Priv. Secur. Integr. 1(1), 3\u201333 (2011)","journal-title":"Int. J. Inf. Priv. Secur. Integr."},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Dependable Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.,\u00a0Camenisch, J.,\u00a0Chen, L.: Direct anonymous attestation. In: CCS 2004, pp. 132\u2013145. ACM (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Chen, L.,\u00a0Dong, C., Kassem, N.E., Newton, C.J.P.,\u00a0Wang, Y.: Hash-based direct anonymous attestation. In: PQCrypto 2023. LNCS, vol. 14154, pp. 565\u2013600. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_21","DOI":"10.1007\/978-3-031-40003-2_21"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Chen, L.,\u00a0Dong, C., Kassem, N.E., Newton, C.J.P.,\u00a0Wang, Y.: A new hash-based enhanced privacy ID signature scheme. In: PQCrypto 2024. LNCS, vol. 14771, pp. 37\u201371. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_2","DOI":"10.1007\/978-3-031-62743-9_2"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Chen, L., Dong, C., Newton, C.J.P., Wang, Y.: Sphinx-in-the-head: group signatures from symmetric primitives. ACM Trans. Priv. Secur. 27(1), 11:1\u201311:35 (2024)","DOI":"10.1145\/3638763"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Chen, L.,\u00a0Xu, Z.,\u00a0Tu, T.,\u00a0Wang, Z.: Lattice-based privacy enhanced identity protocol for SDO services. In: ICSIP 2023, pp. 609\u2013613. IEEE (2023)","DOI":"10.1109\/ICSIP57908.2023.10270826"},{"key":"1_CR20","unstructured":"Costan, V.,\u00a0Devadas, S.: Intel SGX explained. IACR Cryptol. ePrint Arch. 86 (2016)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Daemen, J.,\u00a0Rijmen, V.: The Design of Rijndael, vol.\u00a02. Springer, Heidelberg (2002)","DOI":"10.1007\/978-3-662-04722-4"},{"key":"1_CR22","first-page":"2018","volume":"2","author":"F Dall","year":"2018","unstructured":"Dall, F., et al.: Cachequote: efficiently recovering long-term secrets of sgx epid via cache attacks. IACR Trans. Cryptogr. Hardware Embed. Syst. 2, 2018 (2018)","journal-title":"IACR Trans. Cryptogr. Hardware Embed. Syst."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-16715-2_7","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"D Derler","year":"2015","unstructured":"Derler, D., Hanser, C., Slamanig, D.: Revisiting cryptographic accumulators, additional properties and relations to other primitives. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 127\u2013144. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_7"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-79063-3_20","volume-title":"Post-Quantum Cryptography","author":"D Derler","year":"2018","unstructured":"Derler, D., Ramacher, S., Slamanig, D.: Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 419\u2013440. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_20"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-95312-6_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"A Faonio","year":"2022","unstructured":"Faonio, A., Fiore, D., Nizzardo, L., Soriente, C.: Subversion-resilient enhanced privacy ID. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 562\u2013588. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_23"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Ishai, Y.,\u00a0Kushilevitz, E.,\u00a0Ostrovsky, R.,\u00a0Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC 2007, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Jeudy, C.,\u00a0Sanders, O.: Worst-case lattice sampler with truncated gadgets and applications. IACR Cryptol. ePrint Arch. 1952 (2024)","DOI":"10.1007\/978-981-95-5099-9_7"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Jeudy, C.,\u00a0Sanders, O.: Improved lattice blind signatures from recycled entropy. In: CRYPTO 2025. LNCS, vol. 16000, pp. 477\u2013513. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_16","DOI":"10.1007\/978-3-032-01855-7_16"},{"key":"1_CR31","unstructured":"Jeudy, C.,\u00a0Sanders, O.: Lattice epid with efficient revocation. IACR Cryptol. ePrint Arch. 1225 (2025)"},{"issue":"1\u201310","key":"1_CR32","first-page":"119","volume":"1","author":"S Johnson","year":"2016","unstructured":"Johnson, S., Scarlata, V., Rozas, C., Brickell, E., Mckeen, F., et al.: Intel software guard extensions: epid provisioning and attestation services. White Paper 1(1\u201310), 119 (2016)","journal-title":"White Paper"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-41702-4_2","volume-title":"Information Security Theory and Practice","author":"N EL Kassem","year":"2020","unstructured":"EL Kassem, N., Fiolhais, L., Martins, P., Chen, L., Sousa, L.: A lattice-based enhanced privacy ID. In: Laurent, M., Giannetsos, T. (eds.) WISTP 2019. LNCS, vol. 12024, pp. 15\u201331. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41702-4_2"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Katz, J.,\u00a0Kolesnikov, V.,\u00a0Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: CCS 2018, pp. 525\u2013537. ACM (2018)","DOI":"10.1145\/3243734.3243805"},{"issue":"3","key":"1_CR35","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00145-023-09470-6","volume":"36","author":"B Libert","year":"2023","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. J. Cryptol. 36(3), 23 (2023)","journal-title":"J. Cryptol."},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-84252-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"F Liu","year":"2021","unstructured":"Liu, F., Isobe, T., Meier, W.: Cryptanalysis of full LowMC and LowMC-M with algebraic techniques. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 368\u2013401. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_13"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Liu, F.,\u00a0Sarkar, S.,\u00a0Wang, G.,\u00a0Meier, W.,\u00a0Isobe, T.: Algebraic meet-in-the-middle attack on lowmc. In: ASIACRYPT 2022. LNCS, vol. 13791, pp. 225\u2013255. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_8","DOI":"10.1007\/978-3-031-22963-3_8"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V.,\u00a0Seiler, G.,\u00a0Steuer, P.: The lazer library: lattice-based zero knowledge and succinct proofs for quantum-safe privacy. In: CCS 2024, pp. 3125\u20133137. ACM (2024)","DOI":"10.1145\/3658644.3690330"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Ouyang, Y.,\u00a0Tang, D.,\u00a0Xu, Y.: Code-based zero-knowledge from vole-in-the-head and their applications: simpler, faster, and smaller. In: ASIACRYPT 2024. LNCS, vol. 15488, pp. 436\u2013470. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_14","DOI":"10.1007\/978-981-96-0935-2_14"},{"key":"1_CR40","unstructured":"Prest, T., et al.: Falcon. Technical Report, NIST (2022)"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Sanders, O.: EPID with efficient proof of non-revocation. In: ASIA CCS 2022, pp. 1126\u20131138. ACM (2022)","DOI":"10.1145\/3488932.3517392"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-75539-3_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"O Sanders","year":"2021","unstructured":"Sanders, O., Traor\u00e9, J.: EPID with malicious revocation. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 177\u2013200. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_8"},{"issue":"4","key":"1_CR43","doi-asserted-by":"publisher","first-page":"143","DOI":"10.46586\/tosc.v2023.i4.143-165","volume":"2023","author":"Y Sun","year":"2023","unstructured":"Sun, Y., Cui, J., Wang, M.: Improved attacks on lowmc with algebraic techniques. IACR Trans. Symm. Cryptol. 2023(4), 143\u2013165 (2023)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Yang, K.,\u00a0Sarkar, P.,\u00a0Weng, C.,\u00a0Wang, X.: Quicksilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: CCS 2021, pp. 2986\u20133001. ACM (2021)","DOI":"10.1145\/3460120.3484556"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:55Z","timestamp":1784635495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}