{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T15:56:01Z","timestamp":1764431761551,"version":"3.41.2"},"reference-count":24,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2024,12,3]]},"abstract":"<jats:p>  When sending quantum information over a channel, we want to ensure that the message remains intact. Quantum error correction and quantum authentication both aim to protect (quantum) information, but approach this task from two very different directions: error-correcting codes protect against probabilistic channel noise and are meant to be very robust against small errors, while authentication codes prevent adversarial attacks and are designed to be very sensitive against any error, including small ones.<\/jats:p>\n          <jats:p>  In practice, when sending an authenticated state over a noisy channel, one would have to wrap it in an error-correcting code to counterbalance the sensitivity of the underlying authentication scheme. We study the question of whether this can be done more efficiently by combining the two functionalities in a single code. To illustrate the potential of such a combination, we design the threshold code, a modification of the trap authentication code which preserves that code's authentication properties, but which is naturally robust against depolarizing channel noise. We show that the threshold code needs polylogarithmically fewer qubits to achieve the same level of security and robustness, compared to the naive composition of the trap code with any concatenated CSS code. We believe our analysis opens the door to combining more general error-correction and authentication codes, which could improve the practicality of the resulting scheme. <\/jats:p>","DOI":"10.62056\/ah2i5w7sf","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:00:52Z","timestamp":1736787652000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":1,"title":["An efficient combination of quantum error correction and authentication"],"prefix":"10.62056","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9238-8174","authenticated-orcid":false,"given":"Yfke","family":"Dulek","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00x7ekv49","id-type":"ROR","asserted-by":"publisher"}],"name":"CWI","place":["Netherlands"]},{"id":[{"id":"https:\/\/ror.org\/00zq3ce72","id-type":"ROR","asserted-by":"publisher"}],"name":"QuSoft","place":["Netherlands"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4627-9520","authenticated-orcid":false,"given":"Garazi","family":"Muguruza","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/04dkp9463","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Amsterdam","place":["Netherlands"],"department":["Informatics Institute"]},{"id":[{"id":"https:\/\/ror.org\/00zq3ce72","id-type":"ROR","asserted-by":"publisher"}],"name":"QuSoft","place":["Netherlands"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3792-9908","authenticated-orcid":false,"given":"Florian","family":"Speelman","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/04dkp9463","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Amsterdam","place":["Netherlands"],"department":["Informatics Institute"]},{"id":[{"id":"https:\/\/ror.org\/00zq3ce72","id-type":"ROR","asserted-by":"publisher"}],"name":"QuSoft","place":["Netherlands"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1:barnum_authentication_2002","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/SFCS.2002.1181969","article-title":"Authentication of quantum messages","author":"H. Barnum","year":"2002"},{"key":"ref2:FOCS:BCGHS06","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/FOCS.2006.68","article-title":"Secure Multiparty Quantum Computation with (Only) a Strict\n  Honest Majority","author":"Michael Ben-Or","year":"2006"},{"key":"ref3:C:GarYueZha17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-63715-0_12","article-title":"New Security Notions and Feasibility Results for\n  Authentication of Quantum Data","volume":"10402","author":"Sumegha Garg","year":"2017"},{"key":"ref4:aharonov_interactive_2008","article-title":"Interactive Proofs For Quantum Computations","author":"Dorit Aharonov","year":"2008","journal-title":"Preprint"},{"key":"ref5:C:DupNieSal10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-14623-7_37","article-title":"Secure Two-Party Quantum Evaluation of Unitaries against\n  Specious Adversaries","volume":"6223","author":"Fr\u00e9d\u00e9ric Dupuis","year":"2010"},{"key":"ref6:C:DupNieSal12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-642-32009-5_46","article-title":"Actively Secure Two-Party Evaluation of Any Quantum\n  Operation","volume":"7417","author":"Fr\u00e9d\u00e9ric Dupuis","year":"2012"},{"key":"ref7:EC:DGJMS20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-030-45727-3_25","article-title":"Secure Multi-party Quantum Computation with a Dishonest\n  Majority","volume":"12107","author":"Yfke Dulek","year":"2020"},{"key":"ref8:C:BroGutSte13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-40084-1_20","article-title":"Quantum One-Time Programs - (Extended Abstract)","volume":"8043","author":"Anne Broadbent","year":"2013"},{"key":"ref9:ICITS:BroWai16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-49175-2_4","article-title":"Efficient Simulation for Quantum Message Authentication","volume":"10015","author":"Anne Broadbent","year":"2016"},{"key":"ref10:FOCS:BJSW16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/FOCS.2016.13","article-title":"Zero-Knowledge Proof Systems for QMA","author":"Anne Broadbent","year":"2016"},{"key":"ref11:AC:ADSS17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-70694-8_16","article-title":"Quantum Fully Homomorphic Encryption with Verification","volume":"10624","author":"Gorjan Alagic","year":"2017"},{"key":"ref12:dulek_quantum_2018","series-title":"Leibniz International Proceedings in Informatics","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.TQC.2018.1","article-title":"Quantum ciphertext authentication and key recycling with the\n  trap code","author":"Yfke Dulek","year":"2018"},{"key":"ref13:hayden_universal_2016","article-title":"The Universal Composable Security of Quantum\n  Message Authentication with Key Recyling","author":"Patrick Hayden","year":"2016","journal-title":"Preprint"},{"key":"ref14:EC:Portmann17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-56617-7_12","article-title":"Quantum Authentication with Key Recycling","volume":"10212","author":"Christopher Portmann","year":"2017"},{"key":"ref15:EC:AlaGagMaj18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-78372-7_16","article-title":"Unforgeable Quantum Encryption","volume":"10822","author":"Gorjan Alagic","year":"2018"},{"key":"ref16:TCC:BMPZ19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-030-36030-6_12","article-title":"Composable and Finite Computational Security of Quantum\n  Message Transmission","volume":"11891","author":"Fabio Banfi","year":"2019"},{"key":"ref17:alagic_can_2021","doi-asserted-by":"publisher","first-page":"603","DOI":"10.22331\/q-2021-12-16-603","article-title":"Can you sign a quantum state?","volume":"5","author":"Gorjan Alagic","year":"2021","journal-title":"Quantum"},{"key":"ref18:maurer_abstract_2011","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27375-9_3","article-title":"Abstract Cryptography","author":"Ueli Maurer","year":"2011"},{"key":"ref19:goldberg_competitive_2001","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-44676-1_35","article-title":"Competitive Auctions for Multiple Digital Goods","author":"Andrew V. Goldberg","year":"2001"},{"key":"ref20:maurer_constructive_2012","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9","article-title":"Constructive Cryptography \u2013 A New Paradigm for\n  Security Definitions and Proofs","author":"Ueli Maurer","year":"2012"},{"key":"ref21:nielsen_quantum_2010","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1119\/1.1463744","volume-title":"Quantum computation and quantum information","author":"Michael A. Nielsen","year":"2010","ISBN":"https:\/\/id.crossref.org\/isbn\/9781107002173"},{"key":"ref22:preskill_lecture_1999","article-title":"Lecture notes for Physics 219: Quantum computation","author":"John Preskill","year":"1999","journal-title":"Caltech Lecture Notes"},{"key":"ref23:gottesman_class_1996","doi-asserted-by":"publisher","first-page":"1862","DOI":"10.1103\/PhysRevA.54.1862","article-title":"Class of quantum error-correcting codes saturating the\n  quantum Hamming bound","volume":"54","author":"Daniel Gottesman","year":"1996","journal-title":"Phys. Rev. A"},{"key":"ref24:terhal_quantum_2015","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1103\/RevModPhys.87.307","article-title":"Quantum Error Correction for Quantum Memories","volume":"87","author":"Barbara M. Terhal","year":"2015","journal-title":"Reviews of Modern Physics"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:12:34Z","timestamp":1736788354000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/4\/35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,13]]}},"URL":"https:\/\/doi.org\/10.62056\/ah2i5w7sf","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"type":"electronic","value":"3006-5496"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"2024-10-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc1-4-75"}}