{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:43:57Z","timestamp":1771479837039,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319637143","type":"print"},{"value":"9783319637150","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63715-0_12","type":"book-chapter","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T01:19:51Z","timestamp":1501204791000},"page":"342-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["New Security Notions and Feasibility Results for Authentication of Quantum Data"],"prefix":"10.1007","author":[{"given":"Sumegha","family":"Garg","sequence":"first","affiliation":[]},{"given":"Henry","family":"Yuen","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"12_CR1","unstructured":"Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations in Computer Science. Tsinghua University Press (2010)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"042106","DOI":"10.1063\/1.3094756","volume":"50","author":"A Ambainis","year":"2009","unstructured":"Ambainis, A., Bouda, J., Winter, A.: Nonmalleable encryption of quantum information. J. Math. Phys. 50(4), 042106 (2009)","journal-title":"J. Math. Phys."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Alagic, G., Majenz, C.: Quantum non-malleability and authentication (2016). arXiv preprint arXiv:1610.04214","DOI":"10.1007\/978-3-319-63715-0_11"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Barnum, H., Cr\u00e9peau, C., Gottesman, D., Smith, A., Tapp, A.: Authentication of quantum messages. In: 2002 The Proceedings of the 43rd Annual IEEE Foundations of Computer Science, pp. 449\u2013458. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181969"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Cr\u00e9peau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 249\u2013260. IEEE (2006)","DOI":"10.1109\/FOCS.2006.68"},{"key":"12_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). doi:10.1007\/978-3-642-25385-0_3"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1103\/RevModPhys.69.731","volume":"69","author":"CWJ Beenakker","year":"1997","unstructured":"Beenakker, C.W.J.: Random-matrix theory of quantum transport. Rev. Mod. Phys. 69(3), 731 (1997)","journal-title":"Rev. Mod. Phys."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Broadbent","year":"2013","unstructured":"Broadbent, A., Gutoski, G., Stebila, D.: Quantum one-time programs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 344\u2013360. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40084-1_20"},{"key":"12_CR9","unstructured":"Brandao, F.G.S.L., Harrow, A.W., Horodecki, M.: Local random quantum circuits are approximate polynomial-designs (2012). arXiv preprint arXiv:1208.0692"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-30576-7_21","volume-title":"Theory of Cryptography","author":"M Ben-Or","year":"2005","unstructured":"Ben-Or, M., Horodecki, M., Leung, D.W., Mayers, D., Oppenheim, J.: The universal composable security of quantum key distribution. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 386\u2013406. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-30576-7_21"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Wainewright, E.: Efficient simulation for quantum message authentication (2016). arXiv preprint arXiv:1607.03075","DOI":"10.1007\/978-3-319-49175-2_4"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-38348-9_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Zhandry, M.: Quantum-secure message authentication codes. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 592\u2013608. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38348-9_35"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-40084-1_21","volume-title":"Advances in Cryptology \u2013 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.) CRYPTO 2013. LNCS, vol. 8043, pp. 361\u2013379. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40084-1_21"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","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, L.: Superposition attacks on cryptographic protocols. In: Padr\u00f3, C. (ed.) ICITS 2013. LNCS, vol. 8317, pp. 142\u2013161. Springer, Cham (2014). doi:10.1007\/978-3-319-04268-8_9"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-642-32009-5_46","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F Dupuis","year":"2012","unstructured":"Dupuis, F., Nielsen, J.B., Salvail, L.: Actively secure two-party evaluation of any quantum operation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 794\u2013811. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32009-5_46"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/11535218_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Pedersen, T.B., Salvail, L.: A quantum cipher with near optimal key-recycling. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 494\u2013510. Springer, Heidelberg (2005). doi:10.1007\/11535218_30"},{"key":"12_CR17","unstructured":"Fehr, S., Salvail, L.: Quantum authentication and encryption with key recycling (2016). arXiv preprint arXiv:1610.05614"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Gagliardoni, T., H\u00fclsing, A., Schaffner, C.: Semantic security and indistinguishability in the quantum world (2015). arXiv preprint arXiv:1504.05255","DOI":"10.1007\/978-3-662-53015-3_3"},{"key":"12_CR19","unstructured":"Gottesman, D.: Uncloneable encryption (2002). arXiv preprint arXiv:quant-ph\/0210062"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Yuen, H., Zhandry, M.: New security notions and feasibility results for authentication of quantum data (2016). arXiv preprint arXiv:1607.07759","DOI":"10.1007\/978-3-319-63715-0_12"},{"key":"12_CR21","unstructured":"Hayden, P., Leung, D.W., Mayers, D.: The universal composable security of quantum message authentication with key recyling (2016). arXiv preprint arXiv:1610.09434"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding (2016). arXiv preprint arXiv:1602.05973","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Low, R.A.: Large deviation bounds for k-designs. In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol. 465, pp. 3289\u20133308. The Royal Society (2009)","DOI":"10.1098\/rspa.2009.0232"},{"key":"12_CR24","volume-title":"Asymptotic Theory of Finite Dimensional Normed Spaces: Isoperimetric Inequalities in Riemannian Manifolds","author":"VD Milman","year":"2009","unstructured":"Milman, V.D., Schechtman, G.: Asymptotic Theory of Finite Dimensional Normed Spaces: Isoperimetric Inequalities in Riemannian Manifolds. Springer, Heidelberg (2009)"},{"key":"12_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"issue":"4","key":"12_CR26","doi-asserted-by":"publisher","first-page":"042309","DOI":"10.1103\/PhysRevA.72.042309","volume":"72","author":"J Oppenheim","year":"2005","unstructured":"Oppenheim, J., Horodecki, M.: How to reuse a one-time pad and other notes on authentication, encryption, and protection of quantum information. Phys. Rev. A 72(4), 042309 (2005)","journal-title":"Phys. Rev. A"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-56617-7_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"C Portmann","year":"2017","unstructured":"Portmann, C.: Quantum authentication with key recycling. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 339\u2013368. Springer, Cham (2017). doi:10.1007\/978-3-319-56617-7_12"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-13190-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Unruh","year":"2010","unstructured":"Unruh, D.: Universally composable quantum multi-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 486\u2013505. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13190-5_25"},{"issue":"3","key":"12_CR29","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Webb, Z.: The clifford group forms a unitary 3-design (2015). arXiv preprint arXiv:1510.02769","DOI":"10.26421\/QIC16.15-16-8"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: Proceedings of the 53rd IEEE Symposium on Foundations of Computer Science (FOCS) (2012)","DOI":"10.1109\/FOCS.2012.37"},{"key":"12_CR32","unstructured":"Zhu, H.: Multiqubit clifford groups are unitary 3-designs (2015). arXiv preprint arXiv:1510.02619"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63715-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:33:07Z","timestamp":1750789987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63715-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319637143","9783319637150"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63715-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"29 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/conferences\/crypto2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}