{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:12:02Z","timestamp":1785831122195,"version":"3.56.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587535","type":"print"},{"value":"9783031587542","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58754-2_10","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T15:01:54Z","timestamp":1714230114000},"page":"256-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Provable Dual Attacks on\u00a0Learning with\u00a0Errors"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2549-951X","authenticated-orcid":false,"given":"Amaury","family":"Pouly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-9337","authenticated-orcid":false,"given":"Yixin","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Lattice Attacks on NTRU and LWE: A History of Refinements, p. 15-40. London Mathematical Society Lecture Note Series, Cambridge University Press (2021)","DOI":"10.1017\/9781108854207.004"},{"key":"10_CR2","unstructured":"Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding (2020). https:\/\/arxiv.org\/abs\/2002.07955"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved (provable) algorithms for the shortest vector problem via bounded distance decoding. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbr\u00fccken, Germany, 16\u201319 March 2021 (Virtual Conference). LIPIcs, vol.\u00a0187, pp. 4:1\u20134:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.4","DOI":"10.4230\/LIPIcs.STACS.2021.4"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in 2$$^{\\rm n}$$ time using discrete gaussian sampling: Extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 733\u2013742. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Aharonov, D., Regev, O.: Lattice problems in np $$\\cap $$ conp. J. ACM 52(5), 749\u2013765 (2005). https:\/\/doi.org\/10.1145\/1089023.1089025","DOI":"10.1145\/1089023.1089025"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 10\u201319. Association for Computing Machinery, New York (1998). https:\/\/doi.org\/10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-56614-6_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"MR Albrecht","year":"2017","unstructured":"Albrecht, M.R.: On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 103\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_4"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"key":"10_CR10","unstructured":"Albrecht, M.R., Shen, Y.: Quantum augmented dual attack. Cryptology ePrint Archive, Paper 2022\/656 (2022). https:\/\/eprint.iacr.org\/2022\/656"},{"key":"10_CR11","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange: a new hope. In: Proceedings of the 25th USENIX Conference on Security Symposium, SEC 2016, pp. 327\u2013343. USENIX Association, USA (2016)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 10\u201324. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 575\u2013584. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"10_CR16","unstructured":"Carrier, K., Shen, Y., Tillich, J.P.: Faster dual lattice attacks by using coding theory (2022). https:\/\/eprint.iacr.org\/2022\/1750"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Dadush, D., Regev, O., Stephens-Davidowitz, N.: On the closest vector problem with a distance guarantee. In: 2014 IEEE 29th Conference on Computational Complexity (CCC), pp. 98\u2013109 (2014). https:\/\/doi.org\/10.1109\/CCC.2014.18","DOI":"10.1109\/CCC.2014.18"},{"key":"10_CR18","unstructured":"Debris, T., Ducas, L., Resch, N., Tillich, J.P.: Smoothing codes and lattices: systematic study and new bounds. Cryptology ePrint Archive, Paper 2022\/615 (2022). https:\/\/eprint.iacr.org\/2022\/615"},{"key":"10_CR19","unstructured":"Debris-Alazard, T., Remaud, M., Tillich, J.P.: Quantum reduction of finding short code vectors to the decoding problem. Cryptology ePrint Archive, Paper 2021\/752 (2021). https:\/\/eprint.iacr.org\/2021\/752"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work? IACR Cryptol. ePrint Arch., p.\u00a0302 (2023). https:\/\/eprint.iacr.org\/2023\/302","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"10_CR21","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum. CoRR quant-ph\/9607014 (1996). http:\/\/arxiv.org\/abs\/quant-ph\/9607014"},{"issue":"10","key":"10_CR22","doi-asserted-by":"publisher","first-page":"3401","DOI":"10.1109\/TIT.2005.855591","volume":"51","author":"U Erez","year":"2005","unstructured":"Erez, U., Litsyn, S., Zamir, R.: Lattices which are good for (almost) everything. IEEE Trans. Inf. Theory 51(10), 3401\u20133416 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.855591","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-030-65277-7_20","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"T Espitau","year":"2020","unstructured":"Espitau, T., Joux, A., Kharchenko, N.: On a dual\/hybrid approach to small secret LWE. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 440\u2013462. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_20"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. STOC 2008. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-92068-5_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"Q Guo","year":"2021","unstructured":"Guo, Q., Johansson, T.: Faster dual lattice attacks for\u00a0solving LWE with\u00a0applications to\u00a0CRYSTALS. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 33\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_2"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45061-0_25","volume-title":"Automata, Languages and Programming","author":"P H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 291\u2013299. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_25"},{"key":"10_CR27","unstructured":"Jaques, S., Rattew, A.G.: QRAM: a survey and critique (2023)"},{"key":"10_CR28","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 937\u2013941. Society for Industrial and Applied Mathematics, USA (2000)"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005). https:\/\/doi.org\/10.1137\/S0097539703436345","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10_CR30","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/18.641543","volume":"43","author":"HA Loeliger","year":"1997","unstructured":"Loeliger, H.A.: Averaging bounds for lattices and linear codes. IEEE Trans. Inf. Theory 43(6), 1767\u20131773 (1997). https:\/\/doi.org\/10.1109\/18.641543","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10_CR31","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1017\/S0305004100033302","volume":"54","author":"AM Macbeath","year":"1958","unstructured":"Macbeath, A.M., Rogers, C.A.: Siegel\u2019s mean value theorem in the geometry of numbers. Math. Proc. Cambridge Philos. Soc. 54(2), 139\u2013151 (1958). https:\/\/doi.org\/10.1017\/S0305004100033302","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"MATZOV: Report on the Security of LWE: Improved Dual Lattice Attack, April 2022. https:\/\/doi.org\/10.5281\/zenodo.6412487","DOI":"10.5281\/zenodo.6412487"},{"key":"10_CR33","unstructured":"Meyer-Hilfiger, C., Tillich, J.P.: Rigorous foundations for dual attacks in coding theory. Cryptology ePrint Archive, Paper 2023\/1460, Accepted to TCC (2023). https:\/\/eprint.iacr.org\/2023\/1460"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-Based Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1468\u20131480. Society for Industrial and Applied Mathematics, USA (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Montanaro, A.: Quantum speedup of Monte Carlo methods. Proc. Royal Soc. Math. Phys. Eng. Sci. 471(2181), 20150301 (2015). https:\/\/doi.org\/10.1098\/rspa.2015.0301","DOI":"10.1098\/rspa.2015.0301"},{"issue":"2","key":"10_CR38","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.009","journal-title":"J. Math. Cryptol."},{"key":"10_CR39","unstructured":"Pouly, A., Shen, Y.: Provable dual attacks on learning with errors. Cryptology ePrint Archive, Paper 2023\/1508 (2023). https:\/\/eprint.iacr.org\/2023\/1508"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 84\u201393. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF02392493","volume":"94","author":"CA Rogers","year":"1955","unstructured":"Rogers, C.A.: Mean values over the space of lattices. Acta Math. 94, 249\u2013287 (1955). https:\/\/doi.org\/10.1007\/BF02392493","journal-title":"Acta Math."},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2), 201\u2013224 (1987)","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Siegel, C.L.: A mean value theorem in geometry of numbers. Ann. Math. 46(2), 340 (1945). https:\/\/doi.org\/10.2307\/1969027. https:\/\/www.jstor.org\/stable\/1969027?origin=crossref","DOI":"10.2307\/1969027"},{"key":"10_CR45","unstructured":"Stephens-Davidowitz, N.: On the Gaussian measure over lattices. Ph.d. thesis, New York University (2017)"},{"issue":"6","key":"10_CR46","doi-asserted-by":"publisher","first-page":"3630","DOI":"10.1109\/TIT.2019.2901497","volume":"65","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Ling, C.: Lattice gaussian sampling by Markov chain Monte Carlo: bounded distance decoding and trapdoor sampling. IEEE Trans. Inf. Theory 65(6), 3630\u20133645 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2901497","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR47","doi-asserted-by":"publisher","unstructured":"Zamir, R., Nazer, B., Kochman, Y., Bistritz, I.: Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory. Cambridge University Press (2014). https:\/\/doi.org\/10.1017\/CBO9781139045520","DOI":"10.1017\/CBO9781139045520"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58754-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:04:20Z","timestamp":1777248260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58754-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587535","9783031587542"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58754-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}