{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:11:20Z","timestamp":1761397880775,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018052"},{"type":"electronic","value":"9783032018069"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-01806-9_3","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:05:51Z","timestamp":1761397551000},"page":"41-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Review of\u00a0Lattice Cryptography Attack Cost Model"],"prefix":"10.1007","author":[{"given":"Xi","family":"Hu","sequence":"first","affiliation":[]},{"given":"Yunfei","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Xiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Mavroeidis, V., Vishi, K., Zych, M.D., et al.: The impact of quantum computing on present cryptography. arXiv preprint arXiv:1804.00200 (2018)","DOI":"10.14569\/IJACSA.2018.090354"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11818175_8","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"O Regev","year":"2006","unstructured":"Regev, O.: Lattice-based cryptography. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 131\u2013141. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_8"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Santini, P., Cancellieri, G.: Post-quantum cryptography based on codes: state of the art and open challenges. In: 2017 AEIT International Annual Conference, pp. 1\u20136. IEEE (2017)","DOI":"10.23919\/AEIT.2017.8240549"},{"key":"3_CR5","volume-title":"Multivariate Public Key Cryptosystems","author":"JT Ding","year":"2006","unstructured":"Ding, J.T., Gower, J.E., Schmidt, D.S.: Multivariate Public Key Cryptosystems. Springer, New York (2006)"},{"key":"3_CR6","unstructured":"National Institute of Standards and Technology: FIPS 203. Module-Lattice-based Key-Encapsulation Mechanism Standard (2024)"},{"key":"3_CR7","unstructured":"National Institute of Standards and Technology: FIPS 204. Module-Lattice-Based Digital Signature Standard (2024)"},{"key":"3_CR8","unstructured":"National Institute of Standards and Technology: FIPS 205. Stateless Hash-Based Digital Signature Standard (2024)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-72565-9_1","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"Y Yu","year":"2018","unstructured":"Yu, Y., Ducas, L.: Second order statistical behavior of\u00a0LLL\u00a0and\u00a0BKZ. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 3\u201322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_1"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work?. In: CRYPTO 2023. LNCS, vol. 14084, pp. 37\u201369. Springer (2023)","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC 1997, pp. 284\u2013293. ACM (1997)","DOI":"10.1145\/258533.258604"},{"issue":"6","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16, 365\u2013411 (2007)","journal-title":"Comput. Complex."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: STOC 1983, pp. 193\u2013206. ACM (1983)","DOI":"10.1145\/800061.808749"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC 2001, pp. 601\u2013610. ACM (2001)","DOI":"10.1145\/380752.380857"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"ME Pohst","year":"1981","unstructured":"Pohst, M.E.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bull. 15(1), 37\u201344 (1981)","journal-title":"ACM SIGSAM Bull."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: STOC 2008, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"3_CR20","unstructured":"Alkim, E., Ducas, L., Poppelmann, T., et al.: Post-quantum key exchange-a new hope. In: USENIX Security 2016, pp. 327\u2013343 (2016)"},{"issue":"3","key":"3_CR21","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":"3_CR22","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":"3_CR23","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":"3_CR24","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":"3_CR25","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":"3_CR26","unstructured":"Leo, D., Eike, K., et al.: CRYSTALS-Dilithium - Algorithm Specifications and Supporting Documentation (Version 3.1) (2024). https:\/\/pq-crystals.org\/dilithium\/data\/dilithium-specification-round3-20210208.pdf"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., et al.: New directions in nearest neighbor searching with applications to lattice sieving. In: SODA 2016, pp. 10\u201324. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"3_CR28","unstructured":"Roberto, A., Joppe, B., et al.: CRYSTALS-Kyber (version 3.02) - Submission to round 3 of the NIST post-quantum project (2024). https:\/\/pq-crystals.org\/kyber\/data\/kyber-specification-round3-20210804.pdf"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"3_CR30","unstructured":"R\u00fcckert, M., Schneider, M.: Estimating the security of lattice-based cryptosystems. Cryptology ePrint Archive, Report 2010\/137 (2010)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: CRYPTO 2023. LNCS, vol. 14084, pp. 150\u2013176. Springer (2023)","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Espitau, T., Fouque, P.A., G\u00e9rard, F., et al.: Mitaka: a simpler, parallelizable, maskable variant of falcon. In: EUROCRYPT 2022. LNCS, vol. 13275, pp. 222\u2013253. Springer (2022)","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"3_CR33","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":"3_CR34","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":"3_CR35","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Terminating BKZ. Cryptology ePrint Archive, Report 2011\/198 (2011)"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Y., Aono, Y., Takagi, T.: Hardness evaluation for search LWE problem using progressive BKZ simulator. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101(12), 2162\u20132170 (2018)","DOI":"10.1587\/transfun.E101.A.2162"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-75245-3_4","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"EW Postlethwaite","year":"2021","unstructured":"Postlethwaite, E.W., Virdia, F.: On the success probability of solving unique SVP via BKZ. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 68\u201398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_4"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Ding, J.: Practical improvements on BKZ algorithm. In: CSCML 2023. LNCS, vol. 13914, pp. 273\u2013284. Springer (2023)","DOI":"10.1007\/978-3-031-34671-2_19"},{"key":"3_CR39","unstructured":"Xia, W., Wang, L., Gu, D., et al.: Improved Progressive BKZ with Lattice Sieving and a Two-Step Mode for Solving uSVP. Cryptology ePrint Archive, Report 2022\/1005 (2022)"},{"issue":"1","key":"3_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019s lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-76578-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time\u2013memory trade-offs for tuple lattice sieving. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 407\u2013436. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"3_CR42","unstructured":"Becker, A., Gama, N., Joux, A.: Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. Cryptology ePrint Archive, Report 2015\/522 (2015)"},{"key":"3_CR43","unstructured":"Player, R.: Parameter selection in lattice-based cryptography. Ph.D. thesis, Royal Holloway, University of London (2018)"},{"key":"3_CR44","unstructured":"Bi, L., Li, S., Liu, Y., et al.: Survey on practical security analysis of LWE problem. J. Cyber Secur. 4(2), 1\u201312 (2019). (in Chinese)"},{"key":"3_CR45","unstructured":"Bi, L.: Research on practical security of learning with errors problem. Ph.D. thesis, University of Chinese Academy of Sciences (2022). (in Chinese)"},{"key":"3_CR46","unstructured":"Li, S.: Lattice basis reduction algorithms and their applications. Ph.D. thesis, University of Chinese Academy of Sciences (2022). (in Chinese)"},{"key":"3_CR47","unstructured":"Bi, L., Lu, X., Wang, K.: Research status and development trend of lattice sieve methods. J. Cryptogr. 8(5), 735\u2013757 (2021). (in Chinese)"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-77886-6_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., Stevens, M., van Woerden, W.: Advanced lattice sieving on GPUs, with tensor cores. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 249\u2013279. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_9"},{"key":"3_CR49","unstructured":"Albrecht, M., Ducas, L.: Lattice attacks on NTRU and LWE: a history of refinements. Cryptology ePrint Archive, Report 2021\/799 (2021)"},{"issue":"2","key":"3_CR50","doi-asserted-by":"publisher","first-page":"362","DOI":"10.46586\/tches.v2025.i2.362-384","volume":"2025","author":"Z Zhao","year":"2025","unstructured":"Zhao, Z., Ding, J., Yang, B.-Y.: Sieving with streaming memory access. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(2), 362\u2013384 (2025)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-76578-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time\u2013memory trade-offs for tuple lattice sieving. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 407\u2013436. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Laarhoven, T., Mosca, M., Van De Pol, J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77, 375\u2013400 (2015)","DOI":"10.1007\/s10623-015-0067-5"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-56614-6_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Aono","year":"2017","unstructured":"Aono, Y., Nguyen, P.Q.: Random sampling revisited: lattice enumeration with discrete pruning. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 65\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_3"},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-56880-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Bai, S., Fouque, P.-A., Kirchner, P., Stehl\u00e9, D., Wen, W.: Faster\u00a0enumeration-based\u00a0lattice\u00a0reduction: root\u00a0Hermite\u00a0factor\u00a0$$k^{1\/(2k)}$$\u00a0time\u00a0$$k^{k\/8+o(k)}$$. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 186\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_7"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01806-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:06:06Z","timestamp":1761397566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01806-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032018052","9783032018069"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01806-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}