{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:40:27Z","timestamp":1767321627044,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":25,"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_8","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:38:25Z","timestamp":1767321505000},"page":"142-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tighter Security Proof of\u00a0Falcon $$^{+}$$ in\u00a0the\u00a0Quantum Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Jiacheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Haodong","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qianheng","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC \u201996), pp. 99\u2013108. STOC \u201996. ACM Press, Philadelphia, May 22\u201324 1996","DOI":"10.1145\/237814.237838"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"JH Astad","year":"1999","unstructured":"Astad, J.H., Impagliazzo, R., Michael, L.A.L.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131364 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved Security Proofs in Lattice-Based Cryptography: Using the R\u00e9nyi Divergence Rather Than the Statistical Distance. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 3\u201324. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_1","DOI":"10.1007\/978-3-662-48797-6_1"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993)","DOI":"10.1145\/168588.168596"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-49096-9_9","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 209\u2013224. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_9"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random Oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Stehle, D.: Crystals - kyber: A cca-secure module-lattice-based kem. In: IEEE European Symposium on Security and Privacy (2018). https:\/\/eprint.iacr.org\/2017\/634","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"8_CR8","unstructured":"Canonne, C.L.: A short note on an inequality between kl and tv (2023). https:\/\/arxiv.org\/abs\/2202.07198"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"van Erven, T., Harremoes, P.: R\u00e9nyi divergence and kullback-leibler divergence. IEEE Trans. Inf. Theory 60(7), 3797\u20133820 (2014). http:\/\/dx.doi.org\/10.1109\/TIT.2014.2320500","DOI":"10.1109\/TIT.2014.2320500"},{"key":"8_CR10","unstructured":"Espitau, T., Niot, G., Sun, C., Tibouchi, M.: SQUIRRELS \u2014 Square Unstructured Integer Euclidean Lattice Signature. Technical report, National Institute of Standards and Technology, Gaithersburg, MD, USA (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures. https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"8_CR11","unstructured":"Fouque, P.A., et al.: Falcon: fast-fourier lattice-based compact signatures over ntru (2020). https:\/\/falcon-sign.info\/falcon.pdf"},{"key":"8_CR12","unstructured":"Gajland, P., Janneck, J., Kiltz, E.: A closer look at falcon. Cryptology ePrint Archive, Paper 2024\/1769 (2024). https:\/\/eprint.iacr.org\/2024\/1769"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM, New York (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., H\u00f6velmanns, K., H\u00fclsing, A., Majenz, C.: Tight adaptive reprogramming in the QROM. In: Proceedings of ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, pp. 637\u2013667. Springer, Berlin (2021)","DOI":"10.1007\/978-3-030-92062-3_22"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"J Hoffstein","year":"2003","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Third Algorithmic Number Theory Symposium (ANTS). LNCS, vol. 1423, pp. 267\u2013288. Springer (June 1998)","DOI":"10.1007\/BFb0054868"},{"key":"8_CR18","unstructured":"Kimball, K.: Announcing request for nominations for public-key post-quantum cryptographic algorithms. Technical report, National Institute of Standards and Technology (2016). https:\/\/www.federalregister.gov\/d\/2016-30615"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-55220-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D., Steinfeld, R.: GGHLite: more efficient multilinear maps from ideal lattices. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 239\u2013256. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_14"},{"key":"8_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_18","volume-title":"Hardness of k-lwe and applications in traitor tracing","author":"S Ling","year":"2014","unstructured":"Ling, S., Phan, D.H., Stehl\u00e9, D., Steinfeld, R.: Hardness of k-lwe and applications in traitor tracing. Springer, Heidelberg (2014)"},{"key":"8_CR21","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/17445760500355678","volume":"21","author":"M Nagy","year":"2006","unstructured":"Nagy, M., Akl, S.G.: Quantum computation and quantum information. Int. J. Parallel Emergent Distrib. Syst. 21(1), 1\u201359 (2006)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"8_CR23","unstructured":"NIST: Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society, Piscataway (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-26059-4_23","volume-title":"Provable Security","author":"K Takashima","year":"2015","unstructured":"Takashima, K., Takayasu, A.: Tighter security for efficient lattice cryptography via the R\u00e9nyi divergence of optimized orders. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 412\u2013431. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26059-4_23"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:38:27Z","timestamp":1767321507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6206-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562053","9789819562060"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6206-0_8","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"}}]}}