{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:48:05Z","timestamp":1765961285068,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030568795"},{"type":"electronic","value":"9783030568801"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-56880-1_7","type":"book-chapter","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T15:04:50Z","timestamp":1597244690000},"page":"186-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Faster\u00a0Enumeration-Based\u00a0Lattice\u00a0Reduction: Root\u00a0Hermite\u00a0Factor\u00a0$$k^{1\/(2k)}$$\u00a0Time\u00a0$$k^{k\/8+o(k)}$$"],"prefix":"10.1007","author":[{"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[]},{"given":"Shi","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[]},{"given":"Weiqiang","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"7_CR1","unstructured":"Albrecht, M.R., et al.: Inaccurate security claims in NTRUprime, May 2016. https:\/\/groups.google.com\/forum\/#!topic\/cryptanalytic-algorithms\/BoSRL0uHIjM"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-98113-0_19","volume-title":"Security and Cryptography for Networks","author":"MR Albrecht","year":"2018","unstructured":"Albrecht, M.R., et al.: Estimate all the LWE, NTRU schemes!. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 351\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_19"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"7_CR4","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. Cryptology ePrint Archive, Report 2019\/1161 (2019). https:\/\/eprint.iacr.org\/2019\/1161"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-70694-8_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"MR Albrecht","year":"2017","unstructured":"Albrecht, M.R., G\u00f6pfert, F., Virdia, F., Wunderer, T.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 297\u2013322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Li, J., Nguyen, P.Q., Stephens-Davidowitz, N.: Slide reduction, revisited - filling the gaps in SVP approximation. CoRR, abs\/1908.03724 (2019)","DOI":"10.1007\/978-3-030-56880-1_10"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-03326-2_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"Y Aono","year":"2018","unstructured":"Aono, Y., Nguyen, P.Q., Shen, Y.: Quantum lattice enumeration and tweaking discrete pruning. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 405\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_14"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"key":"7_CR10","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Progressive BKZ library (2018). http:\/\/www2.nict.go.jp\/security\/pbkzcode\/index.html"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N. and Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R., (ed.) 27th SODA, pp. 10\u201324. ACM-SIAM, January 2016","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-030-03326-2_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"S Bai","year":"2018","unstructured":"Bai, S., Stehl\u00e9, D., Wen, W.: Measuring, simulating and exploiting the head concavity phenomenon in BKZ. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 369\u2013404. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_13"},{"key":"7_CR14","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e8te du chiffrement compl\u00e8tement homomorphe. Ph.D. thesis, Paris 7 (2013)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"7_CR16","unstructured":"The FPLLL development team. BKZ reduction strategy (preprocessing, pruning, etc.) (2017). https:\/\/github.com\/fplll\/strategizer"},{"key":"7_CR17","unstructured":"The FPLLL development team. FPLLL, a lattice reduction library (2019). https:\/\/github.com\/fplll\/fplll"},{"key":"7_CR18","unstructured":"The FPLLL development team. FPyLLL, a Python interface to fplll (2019). https:\/\/github.com\/fplll\/fpylll"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-12868-9_103","volume-title":"Computer Algebra","author":"U Fincke","year":"1983","unstructured":"Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol. 162, pp. 194\u2013202. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12868-9_103"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 207\u2013216. ACM Press, May 2008","DOI":"10.1145\/1374376.1374408"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_10"},{"key":"7_CR26","unstructured":"Hanrot, G., Stehl\u00e9, D.: Worst-case Hermite-Korkine-Zolotarev reduced lattice bases. ArXiv, abs\/0801.3331 (2008)"},{"key":"7_CR27","unstructured":"Hanrot, G., Stehl\u00e9, D.: A complete worst-case analysis of Kannan\u2019s shortest lattice vector algorithm Full version of [HS07, HS08] (2010). http:\/\/perso.ens-lyon.fr\/damien.stehle\/downloads\/KANNAN_EXTENDED.pdf"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: 15th ACM STOC, pp. 193\u2013206. ACM Press, April 1983","DOI":"10.1145\/800061.808749"},{"key":"7_CR29","unstructured":"Laarhoven, T.: Search problems in cryptography. Ph.D. thesis, Eindhoven University of Technology (2015)"},{"issue":"12","key":"7_CR30","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(12), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-79063-3_14","volume-title":"Post-Quantum Cryptography","author":"T Laarhoven","year":"2018","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 292\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead. In: Indyk, P. (ed.) 26th SODA, pp. 276\u2013294. ACM-SIAM, January 2015","DOI":"10.1137\/1.9781611973730.21"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31"},{"key":"7_CR34","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02295-1_2","volume-title":"The LLL Algorithm","author":"PQ Nguyen","year":"2010","unstructured":"Nguyen, P.Q.: Hermite\u2019s constant and lattice algorithms. In: Nguyen, P., Vall\u00e9e, B. (eds.) The LLL Algorithm. Information Security and Cryptography. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_2"},{"key":"7_CR35","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":"7_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"7_CR37","unstructured":"Schneider, M., Gama, N.: Darmstadt SVP challenges (2010). https:\/\/www.latticechallenge.org\/svp-challenge\/index.php"},{"key":"7_CR38","unstructured":"Shoup, V.: Number theory library 11.3.1 (NTL) for C++ (2018). http:\/\/www.shoup.net\/ntl\/"},{"issue":"3","key":"7_CR39","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in Python. Nat. Methods 17(3), 261\u2013272 (2020)","journal-title":"Nat. Methods"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Yang, Y., L\u00e9o, D.: Second order statistical behavior of LLL and BKZ. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 3\u201322. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_1","DOI":"10.1007\/978-3-319-72565-9_1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-56880-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T18:31:33Z","timestamp":1723401093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-56880-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030568795","9783030568801"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-56880-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2020\/index.html","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"371","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":"85","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":"23% - 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":"2.82","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":"19.43","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}