{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:30:39Z","timestamp":1767141039296,"version":"build-2238731810"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"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\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["820445"],"award-info":[{"award-number":["820445"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10623-022-01017-3","type":"journal-article","created":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T07:03:32Z","timestamp":1646895812000},"page":"881-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dispelling myths on superposition attacks: formal security model and attack analyses"],"prefix":"10.1007","volume":"90","author":[{"given":"Luka","family":"Music","sequence":"first","affiliation":[]},{"given":"C\u00e9line","family":"Chevalier","sequence":"additional","affiliation":[]},{"given":"Elham","family":"Kashefi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,10]]},"reference":[{"issue":"7779","key":"1017_CR1","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute F., Arya K., Babbush R., Bacon D., Bardin J.C., Barends R., Biswas R., Boixo S., Brandao F.G.S.L., Buell D.A., Burkett B., Chen Y., Chen Z., Chiaro B., Collins R., Courtney W., Dunsworth A., Farhi E., Foxen B., Fowler A., Gidney C., Giustina M., Graff R., Guerin K., Habegger S., Harrigan M.P., Hartmann M.J., Ho A., Hoffmann M., Huang T., Humble T.S., Isakov S.V., Jeffrey E., Jiang Z., Kafri D., Kechedzhi K., Kelly J., Klimov P.V., Knysh S., Korotkov A., Kostritsa F., Landhuis D., Lindmark M., Lucero E., Lyakh D., Mandr\u00e0 S., McClean J.R., McEwen M., Megrant A., Mi X., Michielsen K., Mohseni M., Mutus J., Naaman O., Neeley M., Neill C., Niu M.Y., Ostby E., Petukhov A., Platt J.C., Quintana C., Rieffel E.G., Roushan P., Rubin N.C., Sank D., Satzinger K.J., Smelyanskiy V., Sung K.J., Trevithick M.D., Vainsencher A., Villalonga B., White T., Yao Z.J., Yeh P., Zalcman A., Neven H., Martinis J.M.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019). https:\/\/doi.org\/10.1038\/s41586-019-1666-5.","journal-title":"Nature"},{"key":"1017_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-40084-1_21","volume-title":"Advances in Cryptology-CRYPTO 2013","author":"D Boneh","year":"2013","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-CRYPTO 2013, pp. 361\u2013379. Springer, Berlin (2013)."},{"key":"1017_CR3","doi-asserted-by":"crossref","unstructured":"B\u00fcscher N., Demmler D., Karvelas N., Katzenbeisser S., Kr\u00e4mer J., Rathee D., Schneider T., Struck P.: Secure two-party computation in a post-quantum world. In: 18th International Conference on Applied Cryptography and Network Security (ACNS\u201920) (2020). URL http:\/\/tubiblio.ulb.tu-darmstadt.de\/119789\/","DOI":"10.1007\/978-3-030-57808-4_23"},{"key":"1017_CR4","doi-asserted-by":"publisher","unstructured":"Chi-Chih Yao, A.: Quantum circuit complexity. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 352\u2013361 (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366852","DOI":"10.1109\/SFCS.1993.366852"},{"key":"1017_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-42033-7_8","volume-title":"Advances in Cryptology-ASIACRYPT 2013","author":"S Coretti","year":"2013","unstructured":"Coretti S., Maurer U., Tackmann B.: Constructing confidential channels from authenticated channels-public-key encryption revisited. In: Sako K., Sarkar P. (eds.) Advances in Cryptology-ASIACRYPT 2013, pp. 134\u2013153. Springer, Berlin (2013)."},{"key":"1017_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-04268-8_9","volume-title":"Information Theoretic Security","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd I., Funder J., Nielsen J.B., Salvail J.B., Salvail L.: Superposition attacks on cryptographic protocols. In: Padr\u00f3 C. (ed.) Information Theoretic Security, pp. 142\u2013161. Springer International Publishing, Cham (2014)."},{"issue":"1907","key":"1017_CR7","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch D., Jozsa R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A 439(1907), 553\u2013558 (1992).","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"1017_CR8","first-page":"406","volume-title":"Advances in Cryptology-ASIACRYPT 2014","author":"V Dunjko","year":"2014","unstructured":"Dunjko V., Fitzsimons J.F., Portmann C., Renner R.: Composable security of delegated quantum computation. In: Sarkar P., Iwata T. (eds.) Advances in Cryptology-ASIACRYPT 2014, pp. 406\u2013425. Springer, Berlin (2014)."},{"issue":"2","key":"1017_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00696109","volume":"2","author":"PH Eberhard","year":"1989","unstructured":"Eberhard P.H., Ross R.R.: Quantum field theory cannot provide faster-than-light communication. Found. Phys. Lett. 2(2), 127\u2013149 (1989). https:\/\/doi.org\/10.1007\/BF00696109.","journal-title":"Found. Phys. Lett."},{"key":"1017_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-662-53015-3_3","volume-title":"Advances in Cryptology-CRYPTO 2016","author":"T Gagliardoni","year":"2016","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-CRYPTO 2016, pp. 60\u201389. Springer, Berlin (2016)."},{"issue":"1","key":"1017_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1038\/ncomms1348","volume":"2","author":"I Gerhardt","year":"2011","unstructured":"Gerhardt I., Liu Q., Lamas-Linares A., Skaar J., Kurtsiefer C., Makarov V.: Full-field implementation of a perfect eavesdropper on a quantum cryptography system. Nat. Commun. 2(1), 349 (2011). https:\/\/doi.org\/10.1038\/ncomms1348.","journal-title":"Nat. Commun."},{"key":"1017_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1209\/0295-5075\/6\/2\/001","volume":"6","author":"GC Ghirardi","year":"1988","unstructured":"Ghirardi G.C., Grassi R., Rimini A., Weber T.: Experiments of the EPR type involving CP-violation do not allow faster-than-light communication between distant observers. EPL (Europhys. Lett.) 6, 95 (1988). https:\/\/doi.org\/10.1209\/0295-5075\/6\/2\/001.","journal-title":"EPL (Europhys. Lett.)"},{"issue":"04","key":"1017_CR13","doi-asserted-by":"publisher","first-page":"1550028","DOI":"10.1142\/S0219749915500288","volume":"13","author":"S Hallgren","year":"2015","unstructured":"Hallgren S., Smith A., Song F.: Classical cryptographic protocols in a quantum world. Int. J. Quant. Inform. 13(04), 1550028 (2015).","journal-title":"Int. J. Quant. Inform."},{"key":"1017_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology-CRYPTO 2016","author":"M Kaplan","year":"2016","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-CRYPTO 2016, pp. 207\u2013237. Springer, Berlin (2016)."},{"key":"1017_CR15","doi-asserted-by":"publisher","first-page":"050304","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, 050304 (2002). https:\/\/doi.org\/10.1103\/PhysRevA.65.050304.","journal-title":"Phys. Rev. A"},{"key":"1017_CR16","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov V., Schneider T.: Improved garbled circuit: free XOR gates and applications. In: Aceto L., Damg\u00e5rd I., Goldberg L.A., Halld\u00f3rsson M.M., Ing\u00f3lfsd\u00f3ttir A., Walukiewicz I. (eds.) Automata, Languages and Programming. Springer, Berlin (2008)."},{"issue":"2","key":"1017_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell Y., Pinkas B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8.","journal-title":"J. Cryptol."},{"issue":"9","key":"1017_CR18","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1631\/FITEE.1700039","volume":"18","author":"M Liu","year":"2017","unstructured":"Liu M., Kr\u00e4mer J., Hu Y., Buchmann J.A.: Quantum security analysis of a lattice-based oblivious transfer protocol. Front. Inf. Technol. Electron. Eng. 18(9), 1348\u20131369 (2017). https:\/\/doi.org\/10.1631\/FITEE.1700039.","journal-title":"Front. Inf. Technol. Electron. Eng."},{"issue":"2","key":"1017_CR19","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1103\/physreva.56.1154","volume":"56","author":"HK Lo","year":"1997","unstructured":"Lo H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56(2), 1154\u20131162 (1997). https:\/\/doi.org\/10.1103\/physreva.56.1154.","journal-title":"Phys. Rev. A"},{"key":"1017_CR20","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D Mayers","year":"1997","unstructured":"Mayers D.: Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78, 3414\u20133417 (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.78.3414.","journal-title":"Phys. Rev. Lett."},{"key":"1017_CR21","unstructured":"Mossayebi, S., Schack, R.: Concrete security against adversaries with quantum superposition access to encryption and decryption oracles. arXiv e-prints arXiv:1609.03780 (2016)"},{"key":"1017_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62576-4_16","volume-title":"Provable and Practical Security","author":"L Music","year":"2020","unstructured":"Music L., Chevalier C., Kashefi E.: Dispelling myths on superposition attacks: formal security model and attack analyses. In: Nguyen K., Wu W., Lam K.Y., Wang H. (eds.) Provable and Practical Security. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62576-4_16."},{"key":"1017_CR23","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)."},{"key":"1017_CR24","doi-asserted-by":"crossref","unstructured":"Portmann, C.: Quantum authentication with key recycling. In: Advances in Cryptology-EUROCRYPT 2017, In: Proceedings, Part III, Lecture Notes in Computer Science, vol. 10212, pp. 339\u2013368. Springer (2017). Online arXiv:1610.03422","DOI":"10.1007\/978-3-319-56617-7_12"},{"issue":"04","key":"1017_CR25","doi-asserted-by":"publisher","first-page":"1450041","DOI":"10.1142\/S0219749914500415","volume":"13","author":"L Salvail","year":"2015","unstructured":"Salvail L., Schaffner C., Sot\u00e1kov\u00e1 M.: Quantifying the leakage of quantum protocols for classical two-party cryptography. Int. J. Quant. Inform. 13(04), 1450041 (2015). https:\/\/doi.org\/10.1142\/S0219749914500415.","journal-title":"Int. J. Quant. Inform."},{"issue":"4","key":"1017_CR26","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon C.E.: Communication theory of secrecy systems. Bell. Syst. Tech. J. 28(4), 656\u2013715 (1949).","journal-title":"Bell. Syst. Tech. J."},{"key":"1017_CR27","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS \u201994, p. 124-134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1017_CR28","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-13190-5_25","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"D Unruh","year":"2010","unstructured":"Unruh D.: Universally composable quantum multi-party computation. In: Gilbert H. (ed.) Advances in Cryptology-EUROCRYPT 2010, pp. 486\u2013505. Springer, Berlin (2010)."},{"key":"1017_CR29","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology-EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh D.: Computationally binding quantum commitments. In: Fischlin M., Coron J.S. (eds.) Advances in Cryptology-EUROCRYPT 2016, pp. 497\u2013527. Springer, Berlin (2016)."},{"key":"1017_CR30","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS \u201986, p. 162-167. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"updated-by":[{"DOI":"10.1007\/s10623-022-01042-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000}}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01017-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01017-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01017-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T04:09:36Z","timestamp":1652674176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01017-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,10]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01017-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,10]]},"assertion":[{"value":"27 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10623-022-01042-2","URL":"https:\/\/doi.org\/10.1007\/s10623-022-01042-2","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}