{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:40:02Z","timestamp":1778852402801,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE39- 0015"],"award-info":[{"award-number":["ANR-18-CE39- 0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE39- 0015"],"award-info":[{"award-number":["ANR-18-CE39- 0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE39- 0015"],"award-info":[{"award-number":["ANR-18-CE39- 0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French Programme d\u2019Investissement d\u2019Avenir","award":["RISQ P141580"],"award-info":[{"award-number":["RISQ P141580"]}]},{"name":"French Programme d\u2019Investissement d\u2019Avenir","award":["RISQ P141580"],"award-info":[{"award-number":["RISQ P141580"]}]},{"name":"French Programme d\u2019Investissement d\u2019Avenir","award":["RISQ P141580"],"award-info":[{"award-number":["RISQ P141580"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10623-025-01664-2","type":"journal-article","created":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T09:28:28Z","timestamp":1751794108000},"page":"4355-4402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On security notions for encryption in a quantum world"],"prefix":"10.1007","volume":"93","author":[{"given":"C\u00e9line","family":"Chevalier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehsan","family":"Ebrahimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quoc-Huy","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"key":"1664_CR1","unstructured":"Abdolmaleki B., Chevalier C., Ebrahimi E., Malavolta G., Vu Q.-H.: On Quantum Simulation-Soundness. Cryptology ePrint Archive, Paper 2023\/1702. https:\/\/eprint.iacr.org\/2023\/1702 (2023)."},{"key":"1664_CR2","doi-asserted-by":"publisher","unstructured":"Alagic G., Gagliardoni T., Majenz C.: Unforgeable quantum encryption. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology\u2014EUROCRYPT\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 10822, pp. 489\u2013519. Springer, Tel Aviv, Israel (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_16.","DOI":"10.1007\/978-3-319-78372-7_16"},{"key":"1664_CR3","doi-asserted-by":"publisher","unstructured":"Alagic G., Majenz C., Russell A., Song F.: Quantum-access-secure message authentication via blind-unforgeability. In: Canteaut A., Ishai Y. (eds.) Advances in Cryptology\u2014EUROCRYPT\u00a02020, Part\u00a0III. Lecture Notes in Computer Science, vol. 12107, pp. 788\u2013817. Springer, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_27.","DOI":"10.1007\/978-3-030-45727-3_27"},{"key":"1664_CR4","doi-asserted-by":"publisher","unstructured":"Alamati N., Maram V.: Quantum CCA-secure PKE, revisited. In: Tang Q., Teague V. (eds.) PKC\u00a02024: 27th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0IV. Lecture Notes in Computer Science, vol. 14604, pp. 193\u2013226. Springer, Sydney, NSW, Australia (2024). https:\/\/doi.org\/10.1007\/978-3-031-57728-4_7.","DOI":"10.1007\/978-3-031-57728-4_7"},{"key":"1664_CR5","doi-asserted-by":"publisher","unstructured":"Anand M.V., Targhi E.E., Tabia G.N., Unruh D.: Post-quantum security of the CBC, CFB, OFB, CTR, and XTS modes of operation. In: Takagi, T. (ed.) Post-Quantum Cryptography\u20147th International Workshop, PQCrypto 2016, pp. 44\u201363. Springer, Fukuoka, Japan (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_4.","DOI":"10.1007\/978-3-319-29360-8_4"},{"key":"1664_CR6","doi-asserted-by":"publisher","unstructured":"Bellare M., Desai A., Jokipii E., Rogaway P.: A concrete security treatment of symmetric encryption. In: 38th Annual Symposium on Foundations of Computer Science, pp. 394\u2013403. IEEE Computer Society Press, Miami Beach, Florida (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646128.","DOI":"10.1109\/SFCS.1997.646128"},{"key":"1664_CR7","doi-asserted-by":"publisher","unstructured":"Bellare M., Desai A., Pointcheval D., Rogaway P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk H. (ed.) Advances in Cryptology\u2014CRYPTO\u201998. Lecture Notes in Computer Science, vol. 1462, pp. 26\u201345. Springer, Santa Barbara, CA, USA (1998). https:\/\/doi.org\/10.1007\/BFb0055718.","DOI":"10.1007\/BFb0055718"},{"key":"1664_CR8","unstructured":"Bellare M., Sahai A.: Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization. Cryptology ePrint Archive, Report 2006\/228 (2006). https:\/\/eprint.iacr.org\/2006\/228."},{"issue":"4","key":"1664_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00145-008-9026-x","volume":"21","author":"M Bellare","year":"2008","unstructured":"Bellare M., Namprempre C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. J. Cryptol. 21(4), 469\u2013491 (2008). https:\/\/doi.org\/10.1007\/s00145-008-9026-x.","journal-title":"J. Cryptol."},{"key":"1664_CR10","unstructured":"Bhaumik R., Bonnetain X., Chailloux A., Leurent G., Naya-Plasencia M., Schrottenloher A., Seurin Y.: QCB: Efficient Quantum-secure Authenticated Encryption. Cryptology ePrint Archive, Report 2020\/1304 (2020). https:\/\/eprint.iacr.org\/2020\/1304."},{"key":"1664_CR11","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 ASIACRYPT\u00a02011. Lecture Notes in Computer Science, vol. 7073, pp. 41\u201369. Springer, Seoul, South Korea (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3.","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"1664_CR12","doi-asserted-by":"publisher","unstructured":"Boneh D., Zhandry M.: Quantum-secure message authentication codes. In: Johansson T., Nguyen P.Q. (eds.) Advances in Cryptolog\u2014EUROCRYPT\u00a02013. Lecture Notes in Computer Science, vol. 7881, pp. 592\u2013608. Springer, Athens, Greece (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_35.","DOI":"10.1007\/978-3-642-38348-9_35"},{"key":"1664_CR13","doi-asserted-by":"publisher","unstructured":"Boneh D., Zhandry M.: Secure signatures and chosen ciphertext security in a quantum computing world. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02013, Part\u00a0II. Lecture Notes in Computer Science, vol. 8043, pp. 361\u2013379. Springer, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_21.","DOI":"10.1007\/978-3-642-40084-1_21"},{"key":"1664_CR14","doi-asserted-by":"publisher","unstructured":"Carstens T.V., Ebrahimi E., Tabia G.N., Unruh D.: Relationships between quantum IND-CPA notions. In: Nissim K., Waters B. (eds.) TCC\u00a02021: 19th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 13042, pp. 240\u2013272. Springer, Raleigh, NC, USA (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_9.","DOI":"10.1007\/978-3-030-90459-3_9"},{"key":"1664_CR15","unstructured":"Czajkowski J., Majenz C., Schaffner C., Zur S.: Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability. Cryptology ePrint Archive, Report 2019\/428 (2019). https:\/\/eprint.iacr.org\/2019\/428."},{"key":"1664_CR16","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I., Funder J., Nielsen J.B., Salvail L.: Superposition attacks on cryptographic protocols. In: Padr\u00f3, C. (ed.) ICITS 13: 7th International Conference on Information Theoretic Security. Lecture Notes in Computer Science, vol. 8317, pp. 142\u2013161. Springer, Singapore (2014). https:\/\/doi.org\/10.1007\/978-3-319-04268-8_9.","DOI":"10.1007\/978-3-319-04268-8_9"},{"issue":"2","key":"1664_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev D., Dwork C., Naor M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000).","journal-title":"SIAM J. Comput."},{"key":"1664_CR18","unstructured":"Don J., Fehr S., Majenz C., Schaffner C.: Online-Extractability in the Quantum Random-Oracle Model. Cryptology ePrint Archive, Report 2021\/280 (2021). https:\/\/eprint.iacr.org\/2021\/280."},{"key":"1664_CR19","doi-asserted-by":"publisher","unstructured":"Gagliardoni T., H\u00fclsing A., Schaffner C.: Semantic security and indistinguishability in the quantum world. In: Robshaw M., Katz J. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02016, Part\u00a0III. Lecture Notes in Computer Science, vol. 9816, pp. 60\u201389. Springer, Santa Barbara, CA, USA (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_3.","DOI":"10.1007\/978-3-662-53015-3_3"},{"key":"1664_CR20","doi-asserted-by":"crossref","unstructured":"Gagliardoni T., Kr\u00e4mer J., Struck P.: Quantum indistinguishability for public key encryption. In: Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20\u201322, 2021, Proceedings 12, pp. 463\u2013482 (2021). Springer.","DOI":"10.1007\/978-3-030-81293-5_24"},{"key":"1664_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004) https:\/\/doi.org\/10.1017\/CBO9780511721656."},{"issue":"2","key":"1664_CR22","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984).","journal-title":"J. Comput. Syst. Sci."},{"key":"1664_CR23","doi-asserted-by":"publisher","unstructured":"Grover L.K.: A fast quantum mechanical algorithm for database search. In: 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM Press, Philadephia, PA, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866.","DOI":"10.1145\/237814.237866"},{"issue":"4","key":"1664_CR24","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J., Impagliazzo R., Levin L.A., Luby M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999).","journal-title":"SIAM J. Comput."},{"key":"1664_CR25","doi-asserted-by":"publisher","unstructured":"Hofheinz D., H\u00f6velmanns K., Kiltz E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai Y., Reyzin L. (eds.) TCC\u00a02017: 15th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 10677, pp. 341\u2013371. Springer, Baltimore, MD, USA (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12.","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"1664_CR26","doi-asserted-by":"publisher","unstructured":"Hosoyamada A., Iwata T.: 4-round Luby-Rackoff construction is a qPRP. In: Galbraith S.D., Moriai S. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02019, Part\u00a0I. Lecture Notes in Computer Science, vol. 11921, pp. 145\u2013174. Springer, Kobe, Japan (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_6.","DOI":"10.1007\/978-3-030-34578-5_6"},{"key":"1664_CR27","doi-asserted-by":"publisher","unstructured":"Kaplan M., Leurent G., Leverrier A., Naya-Plasencia M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02016, Part\u00a0II. Lecture Notes in Computer Science, vol. 9815, pp. 207\u2013237. Springer, Santa Barbara, CA, USA (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8.","DOI":"10.1007\/978-3-662-53008-5_8"},{"issue":"5","key":"1664_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.050304","volume":"65","author":"E Kashefi","year":"2002","unstructured":"Kashefi E., Kent A., Vedral V., Banaszek K.: Comparison of quantum oracles. Phys. Rev. A 65(5), 050304 (2002).","journal-title":"Phys. Rev. A"},{"key":"1664_CR29","doi-asserted-by":"crossref","unstructured":"Kr\u00e4mer J., Struck P.: On quantum ciphertext indistinguishability, recoverability, and oaep. In: International Conference on Post-Quantum Cryptography, pp. 286\u2013306 (2022). Springer.","DOI":"10.1007\/978-3-031-17234-2_14"},{"key":"1664_CR30","doi-asserted-by":"publisher","unstructured":"Liu X., Wang M.: QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model. In: Garay J. (ed.) PKC\u00a02021: 24th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 12710, pp. 3\u201326. Springer, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_1.","DOI":"10.1007\/978-3-030-75245-3_1"},{"key":"1664_CR31","unstructured":"Majenz C., Malavolta G., Walter M.: Permutation Superposition Oracles for Quantum Query Lower Bounds. Cryptology ePrint Archive, Paper 2024\/1140. https:\/\/eprint.iacr.org\/2024\/1140 (2024)."},{"key":"1664_CR32","unstructured":"Mossayebi S., Schack R.: Concrete security against adversaries with quantum superposition access to encryption and decryption oracles. arXiv preprint arXiv:1609.03780 (2016)."},{"key":"1664_CR33","doi-asserted-by":"publisher","unstructured":"Myers S., Shelat A.: Bit encryption is complete. In: 50th Annual Symposium on Foundations of Computer Science, pp. 607\u2013616. IEEE Computer Society Press, Atlanta, GA, USA (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.65.","DOI":"10.1109\/FOCS.2009.65"},{"key":"1664_CR34","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn Cambridge University Press, Cambridge (2011).","edition":"10"},{"key":"1664_CR35","doi-asserted-by":"publisher","unstructured":"Pass R., Shelat A., Vaikuntanathan V.: Relations among notions of non-malleability for encryption. In: Kurosawa K. (ed.) Advances in Cryptology\u2014ASIACRYPT\u00a02007. Lecture Notes in Computer Science, vol. 4833, pp. 519\u2013535. Springer, Kuching, Malaysia (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_32.","DOI":"10.1007\/978-3-540-76900-2_32"},{"key":"1664_CR36","doi-asserted-by":"publisher","unstructured":"Peikert C., Waters B.: Lossy trapdoor functions and their applications. In: Ladner R.E., Dwork C. (eds.) 40th Annual ACM Symposium on Theory of Computing, pp. 187\u2013196. ACM Press, Victoria, BC, Canada (2008). https:\/\/doi.org\/10.1145\/1374376.1374406.","DOI":"10.1145\/1374376.1374406"},{"key":"1664_CR37","doi-asserted-by":"publisher","unstructured":"Shan T., Ge J., Xue R.: QCCA-secure generic transformations in the quantum random oracle model. In: Boldyreva A., Kolesnikov V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 13940, pp. 36\u201364. Springer, Atlanta, GA, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_2.","DOI":"10.1007\/978-3-031-31368-4_2"},{"issue":"2","key":"1664_CR38","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). https:\/\/doi.org\/10.1137\/S0036144598347011.","journal-title":"SIAM Rev."},{"key":"1664_CR39","doi-asserted-by":"publisher","unstructured":"Simon D.R.: On the power of quantum computation. In: 35th Annual Symposium on Foundations of Computer Science, pp. 116\u2013123. IEEE Computer Society Press, Santa Fe, NM, USA (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365701.","DOI":"10.1109\/SFCS.1994.365701"},{"key":"1664_CR40","doi-asserted-by":"publisher","unstructured":"Unruh D.: Towards compressed permutation oracles. In: Guo J., Steinfeld R. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02023, Part\u00a0IV. Lecture Notes in Computer Science, vol. 14441, pp. 369\u2013400. Springer, Guangzhou, China (2023). https:\/\/doi.org\/10.1007\/978-981-99-8730-6_12.","DOI":"10.1007\/978-981-99-8730-6_12"},{"issue":"6","key":"1664_CR41","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2817206","volume":"62","author":"D Unruh","year":"2015","unstructured":"Unruh D.: Revocable quantum timed-release encryption. J. ACM 62(6), 49 (2015).","journal-title":"J. ACM"},{"key":"1664_CR42","doi-asserted-by":"crossref","unstructured":"Xagawa K., Yamakawa T.: (tightly) qcca-secure key-encapsulation mechanism in the quantum random oracle model. In: Post-Quantum Cryptography: 10th International Conference, PQCrypto 2019, Chongqing, China, May 8\u201310, 2019 Revised Selected Papers 10, pp. 249\u2013268 (2019). Springer.","DOI":"10.1007\/978-3-030-25510-7_14"},{"key":"1664_CR43","unstructured":"Zhandry M.: A Note on Quantum-Secure PRPs. Cryptology ePrint Archive, Report 2016\/1076 (2016). https:\/\/eprint.iacr.org\/2016\/1076."},{"key":"1664_CR44","doi-asserted-by":"publisher","unstructured":"Zhandry M.: How to construct quantum random functions. In: 53rd Annual Symposium on Foundations of Computer Science, pp. 679\u2013687. IEEE Computer Society Press, New Brunswick, NJ, USA (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.37.","DOI":"10.1109\/FOCS.2012.37"},{"key":"1664_CR45","doi-asserted-by":"publisher","unstructured":"Zhandry M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva A., Micciancio D. (eds.) Advances in Cryptology\u2014CRYPTO\u00a02019, Part\u00a0II. Lecture Notes in Computer Science, vol. 11693, pp. 239\u2013268. Springer, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9.","DOI":"10.1007\/978-3-030-26951-7_9"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01664-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01664-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01664-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T07:28:42Z","timestamp":1760513322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01664-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,6]]},"references-count":45,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1664"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01664-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,6]]},"assertion":[{"value":"16 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"A preliminary version of this manuscript has been published earlier in the Proceedings of INDOCRYPT 2022. Besides providing formal proofs for the theorems, this manuscript also extends the conference version with more technical contributions: (i) new notions of non-malleability for public-key encryption in the quantum setting (Sect. ); (ii) proofs of relations between indistinguishability and non-malleability (Sect. ); (iii) new results showing that bit encryption is complete in the quantum setting (Sect. ); (iv) separations between our notions and previous notions of [] (Sect.  and Sect. ). We also extend the introduction with more technical discussions on several approaches to the problem and compare them with ours.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Dual Publication"}}]}}