{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:44:15Z","timestamp":1767321855021,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562053","type":"print"},{"value":"9789819562060","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-981-95-6206-0_9","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:39:41Z","timestamp":1767321581000},"page":"166-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Speedy Error Reconciliation"],"prefix":"10.1007","author":[{"given":"Kaibo","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiaozhuo","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Peixin","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Xuwen","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Yunlv","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"9_CR1","unstructured":"Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., Cammarota, R.: Software and hardware implementation of lattice-cased cryptography schemes. Center for Embedded Cyber-Physical Systems, pp. 1\u201343 (2017)"},{"issue":"2","key":"9_CR2","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."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"GL Long","year":"2001","unstructured":"Long, G.L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64(2), 022307 (2001)","journal-title":"Phys. Rev. A"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"6","key":"9_CR5","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 (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 1\u201323. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Crypt."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: Frodo: Take off the ring! practical, quantum-secure key exchange from lwe. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1006\u20131018 (2016)","DOI":"10.1145\/2976749.2978425"},{"key":"9_CR9","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key $$\\{$$Exchange\u2014A$$\\}$$ new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327\u2013343 (2016)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: Crystals-kyber: a cca-secure module-lattice-based kem. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Ducas, L., Durmus, A.: Ring-lwe in polynomial rings. In: International Workshop on Public Key Cryptography, pp. 34\u201351. Springer (2012)","DOI":"10.1007\/978-3-642-30057-8_3"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gueron, S., Schlieker, F.: Speeding up r-lwe post-quantum key exchange. In: Nordic Conference on Secure IT Systems, pp. 187\u2013198. Springer (2016)","DOI":"10.1007\/978-3-319-47560-8_12"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Theory of Cryptography Conference, pp. 209\u2013224. Springer (2016)","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, D., Lee, J., Song, Y.: Lizard: Cut off the tail! a practical post-quantum public-key encryption from lwe and lwr. In: International Conference on Security and Cryptography for Networks, pp. 160\u2013177. Springer (2018)","DOI":"10.1007\/978-3-319-98113-0_9"},{"key":"9_CR15","unstructured":"Ding, J., Xie, X., Lin, X.: A simple provably secure key exchange scheme based on the learning with errors problem. Cryptology ePrint Archive (2012)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Lattice cryptography for the internet. In: International Workshop on Post-Quantum Cryptography, pp. 197\u2013219. Springer (2014)","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"9_CR17","unstructured":"Jin, Z., Zhao, Y.: Optimal key consensus in presence of noise. arXiv preprint arXiv:1611.06150 (2016)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. In: Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, pp. 365\u2013390 (2022)","DOI":"10.1145\/3549993.3550007"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Katz, J., Vaikuntanathan, V.: Smooth projective hashing and password-based authenticated key exchange from lattices. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 636\u2013652. Springer (2009)","DOI":"10.1007\/978-3-642-10366-7_37"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Naehrig, M., Stebila, D.: Post-quantum key exchange for the tls protocol from the ring learning with errors problem. In: 2015 IEEE Symposium on Security and Privacy, pp. 553\u2013570. IEEE (2015)","DOI":"10.1109\/SP.2015.40"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.P., Karmakar, A., Sinha\u00a0Roy, S., Vercauteren, F.: Saber: Module-lwr based key exchange, cpa-secure encryption and cca-secure kem. In: International Conference on Cryptology in Africa, pp. 282\u2013305. Springer (2018)","DOI":"10.1007\/978-3-319-89339-6_16"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Wang, B., Gu, X., Yang, Y.: Saber on esp32. In: International Conference on Applied Cryptography and Network Security, pp. 421\u2013440. Springer (2020)","DOI":"10.1007\/978-3-030-57808-4_21"},{"key":"9_CR23","unstructured":"Bos, J.W., Renes, J., van Vredendaal, C.: Post-quantum cryptography with contemporary co-processors: Beyond kronecker, sch\u00f6nhage-strassen & nussbaumer. Cryptology ePrint Archive (2020)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Boyd, C., Davies, G.T., de\u00a0Kock, B., Gellert, K., Jager, T., Millerjord, L.: Symmetric key exchange with full forward security and robust synchronization. In: Advances in Cryptology\u2013ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6\u201310, 2021, Proceedings, Part IV, pp. 681\u2013710. Springer (2021)","DOI":"10.1007\/978-3-030-92068-5_23"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TDSC.2021.3129512","volume":"20","author":"Q Wang","year":"2021","unstructured":"Wang, Q., Wang, D., Cheng, C., He, D.: Quantum2fa: efficient quantum-resistant two-factor authentication scheme for mobile devices. IEEE Trans. Dependable Secure Comput. 20(1), 193\u2013208 (2021)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Saarinen, M.J.O.: Hila5: On reliability, reconciliation, and error correction for ring-lwe encryption. In: International conference on selected areas in cryptography, pp. 192\u2013212. Springer (2017)","DOI":"10.1007\/978-3-319-72565-9_10"},{"key":"9_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2021.103549","volume":"79","author":"S Akleylek","year":"2022","unstructured":"Akleylek, S., Seyhan, K.: Module learning with rounding based key agreement scheme with modified reconciliation. Comput. Stand. Interfaces 79, 103549 (2022)","journal-title":"Comput. Stand. Interfaces"},{"key":"9_CR28","unstructured":"D\u2019Anvers, J.P., Verbauwhede, I., et\u00a0al.: On the impact of decryption failures on the security of lwe\/lwr based schemes (2018)"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.P., Rossi, M., Virdia, F.: (one) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 3\u201333. Springer (2020)","DOI":"10.1007\/978-3-030-45727-3_1"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.P., Batsleer, S.: Multitarget decryption failure attacks and their application to saber and kyber. In: IACR International Conference on Public-Key Cryptography, pp. 3\u201333. Springer (2022)","DOI":"10.1007\/978-3-030-97121-2_1"},{"key":"9_CR31","doi-asserted-by":"crossref","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, pp. 575\u2013584 (2013)","DOI":"10.1145\/2488608.2488680"},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the r\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31(2), 610\u2013640 (2018)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6206-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:39:43Z","timestamp":1767321583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6206-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562053","9789819562060"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6206-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}