{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:00:11Z","timestamp":1770742811020,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031491863","type":"print"},{"value":"9783031491870","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49187-0_29","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T12:02:36Z","timestamp":1701345756000},"page":"578-595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved BKW Algorithm for\u00a0Solving LWE with\u00a0Small Secrets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9053-2171","authenticated-orcid":false,"given":"Yu","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"29_CR1","unstructured":"Lattice-estimator. https:\/\/github.com\/malb\/lattice-estimator. Accessed 4 Oct 2023"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10623-013-9864-x","volume":"74","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J.C., et al.: On the complexity of the BKW algorithm on LWE. Des. Codes Cryptogr. 74, 325\u2013354 (2015). https:\/\/doi.org\/10.1007\/s10623-013-9864-x","journal-title":"Des. Codes Cryptogr."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-54631-0_25","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"MR Albrecht","year":"2014","unstructured":"Albrecht, M.R., Faug\u00e8re, J.-C., Fitzpatrick, R., Perret, L.: Lazy modulus switching for the BKW algorithm on LWE. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 429\u2013445. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_25"},{"key":"29_CR4","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J.C., et al.: On the complexity of the Arora-Ge algorithm against LWE. In: SCC 2012 \u2013 Third International Conference on Symbolic Computation and Cryptography, pp. 93\u201399. Urdiales C., Spain (2012)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-12160-4_18","volume-title":"Information Security and Cryptology \u2013 ICISC 2013","author":"MR Albrecht","year":"2014","unstructured":"Albrecht, M.R., Fitzpatrick, R., G\u00f6pfert, F.: On the efficacy of solving LWE by reduction to Unique-SVP. In: Lee, H.-S., Han, D.-G. (eds.) ICISC 2013. LNCS, vol. 8565, pp. 293\u2013310. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12160-4_18"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A.T., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50, 506\u2013519 (2003). https:\/\/doi.org\/10.1145\/792538.792543","journal-title":"J. ACM"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12095-015-0149-2","volume":"8","author":"S Bogos","year":"2016","unstructured":"Bogos, S., Tram\u00e8r, F., Vaudenay, S.: On solving LPN using BKW and variants. Cryptogr. Commun. 8, 331\u2013369 (2016). https:\/\/doi.org\/10.1007\/s12095-015-0149-2","journal-title":"Cryptogr. Commun."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-662-53887-6_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Bogos","year":"2016","unstructured":"Bogos, S., Vaudenay, S.: Optimization of $$\\sf LPN$$ solving algorithms. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 703\u2013728. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_26"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Ducas, L., Kiltz, E., et al.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 97\u2013106. Palm Springs, CA, USA (2014). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-65277-7_19","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"A Budroni","year":"2020","unstructured":"Budroni, A., Guo, Q., Johansson, T., M\u00e5rtensson, E., Wagner, P.S.: Making the BKW algorithm practical for LWE. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 417\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_19"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Budroni, A., M\u00e5rtensson, E.: Improved estimation of key enumeration with applications to solving LWE. In: 2023 IEEE International Symposium on Information Theory, pp. 495\u2013500. Taipei, Taiwan (2023)","DOI":"10.1109\/ISIT54713.2023.10206474"},{"key":"29_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":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-84252-9_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"X Dong","year":"2021","unstructured":"Dong, X., Hua, J., Sun, S., Li, Z., Wang, X., Hu, L.: Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 278\u2013308. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_10"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-46800-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Duc","year":"2015","unstructured":"Duc, A., Tram\u00e8r, F., Vaudenay, S.: Better algorithms for LWE and LWR. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 173\u2013202. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_8"},{"key":"29_CR18","doi-asserted-by":"publisher","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work? In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14083, pp. 37\u201369. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_2","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-89339-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"J-P D\u2019Anvers","year":"2018","unstructured":"D\u2019Anvers, J.-P., Karmakar, A., Sinha Roy, S., Vercauteren, F.: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 282\u2013305. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_16"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11832072_24","volume-title":"Security and Cryptography for Networks","author":"\u00c9 Levieil","year":"2006","unstructured":"Levieil, \u00c9., Fouque, P.-A.: An improved LPN algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 348\u2013359. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_24"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). https:\/\/dl.acm.org\/doi\/book\/10.5555\/1834954","DOI":"10.1145\/1536414.1536440"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-45611-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"Q Guo","year":"2014","unstructured":"Guo, Q., Johansson, T., L\u00f6ndahl, C.: Solving LPN using covering codes. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 1\u201320. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_1"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-319-70694-8_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Q Guo","year":"2017","unstructured":"Guo, Q., Johansson, T., M\u00e5rtensson, E., Stankovski, P.: Coded-BKW with sieving. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 323\u2013346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_12"},{"issue":"8","key":"29_CR24","doi-asserted-by":"publisher","first-page":"5243","DOI":"10.1109\/TIT.2019.2906233","volume":"65","author":"Q Guo","year":"2019","unstructured":"Guo, Q., Johansson, T., M\u00e5rtensson, E., et al.: On the asymptotics of solving the LWE problem using coded-BKW with sieving. IEEE Trans. Inf. Theory 65(8), 5243\u20135259 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2906233","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-47989-6_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Q Guo","year":"2015","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: Coded-BKW: solving LWE using lattice codes. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 23\u201342. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_2"},{"key":"29_CR26","doi-asserted-by":"publisher","unstructured":"Guo, Q., M\u00e5rtensson, E., Stankovski Wagner, P.: On the sample complexity of solving LWE using BKW-style algorithms. In: 2021 IEEE International Symposium on Information Theory, pp. 2405\u20132410. IEEE Press (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9518190","DOI":"10.1109\/ISIT45174.2021.9518190"},{"issue":"2","key":"29_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12095-022-00597-0","volume":"15","author":"Q Guo","year":"2023","unstructured":"Guo, Q., M\u00e5rtensson, E., Stankovski Wagner, P.: Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms. Cryptogr. Commun. 15(2), 331\u2013350 (2023). https:\/\/doi.org\/10.1007\/s12095-022-00597-0","journal-title":"Cryptogr. Commun."},{"key":"29_CR28","unstructured":"Kirchner, P.: Improved generalized birthday attack. IACR Cryptol. ePrint Arch. 2011, 377 (2011). https:\/\/api.semanticscholar.org\/CorpusID:15196823"},{"key":"29_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_21"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: an update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 293\u2013309. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_19"},{"issue":"6","key":"29_CR31","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/18.641543","volume":"43","author":"HA Loeliger","year":"1991","unstructured":"Loeliger, H.A.: Averaging bounds for lattices and linear codes. IEEE Trans. Inf. Theory 43(6), 1767\u20131773 (1991). https:\/\/doi.org\/10.1109\/18.641543","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR32","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"29_CR33","doi-asserted-by":"publisher","unstructured":"M\u00e5rtensson, E.: The asymptotic complexity of coded-BKW with sieving using increasing reduction factors. In: 2019 IEEE International Symposium on Information Theory, pp. 2579\u20132583. IEEE Press (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849218","DOI":"10.1109\/ISIT.2019.8849218"},{"key":"29_CR34","doi-asserted-by":"publisher","unstructured":"Neyman, J., Pearson, E.S.: On the problem of the most efficient tests of statistical hypotheses. In: Kotz, S., Johnson, N.L. (eds.) Breakthroughs in Statistics. Springer Series in Statistics. Springer, New York, NY (1933). https:\/\/doi.org\/10.1007\/978-1-4612-0919-5_6","DOI":"10.1007\/978-1-4612-0919-5_6"},{"key":"29_CR35","doi-asserted-by":"publisher","unstructured":"Qian, X., Liu, J., Gu, C., et al.: An improved BKW algorithm for LWE with binary uniform errors. In: 5th International Conference on Computer and Communication Systems, pp. 87\u201392. Shanghai, China (2020). https:\/\/doi.org\/10.1109\/ICCCS49078.2020.9118492","DOI":"10.1109\/ICCCS49078.2020.9118492"},{"issue":"6","key":"29_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2005). https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J. ACM"},{"key":"29_CR37","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":"29_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"},{"key":"29_CR39","unstructured":"Multinomial distribution. https:\/\/www.britannica.com\/science\/multinomial-distribution. Accessed 26 July 2023"},{"key":"29_CR40","doi-asserted-by":"publisher","unstructured":"Zamir, R., Feder, M.: On lattice quantization noise. In: 1994 Proceedings of IEEE Data Compression Conference, pp. 380\u2013389. Snowbird, UT, USA (1994). https:\/\/doi.org\/10.1109\/DCC.1994.305946","DOI":"10.1109\/DCC.1994.305946"},{"key":"29_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-49890-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Zhang","year":"2016","unstructured":"Zhang, B., Jiao, L., Wang, M.: Faster algorithms for solving LPN. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 168\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_7"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49187-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:36:00Z","timestamp":1744148160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49187-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031491863","9783031491870"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49187-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc23.cs.rug.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}