Quantum ciphertext authentication and key recycling with the trap code

Yfke Dulek, Florian Speelman

7 Downloads (Pure)

Abstract

We investigate quantum authentication schemes constructed from quantum error-correcting codes. We show that if the code has a property called purity testing, then the resulting authentication scheme guarantees the integrity of ciphertexts, not just plaintexts. On top of that, if the code is strong purity testing, the authentication scheme also allows the encryption key to be recycled, partially even if the authentication rejects. Such a strong notion of authentication is useful in a setting where multiple ciphertexts can be present simultaneously, such as in interactive or delegated quantum computation. With these settings in mind, we give an explicit code (based on the trap code) that is strong purity testing but, contrary to other known strong-purity-testing codes, allows for natural computation on ciphertexts.

Original languageEnglish
Title of host publication13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018
EditorsStacey Jeffery
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication date1 Jul 2018
Pages1-17
Article number1
ISBN (Electronic)9783959770804
DOIs
Publication statusPublished - 1 Jul 2018
Event13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018 - Sydney, Australia
Duration: 16 Jul 201818 Jul 2018

Conference

Conference13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018
Country/TerritoryAustralia
CitySydney
Period16/07/201818/07/2018
SeriesLeibniz International Proceedings in Informatics, LIPIcs
Volume111
ISSN1868-8969

Keywords

  • And phrases quantum authentication
  • Ciphertext authentication
  • Purity-testing codes
  • Quantum computing on encrypted data
  • Trap code

Fingerprint

Dive into the research topics of 'Quantum ciphertext authentication and key recycling with the trap code'. Together they form a unique fingerprint.

Cite this