Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0103123

Quantum message authentication codes

Howard Barnum

Published Mar 21, 2001• 13 citations
arXivHTMLPDF

Abstract

This paper has been withdrawn because of an error in the proof of Lemma 1. Without Lemma 1, the result of the main theorem (with the same proof, but omitting the use of Lemma 1 to extend things to general attacks) only holds for attacks in which the attacker applies a tensor product of Pauli matrices (for qubits) or generalized Pauli matrices. The resulting theorem is still relevant for quantum message authentication, but the very strong result claimed in earlier versions of this paper does not hold. These matters will be addressed further in joint work with Claude Crepeau, Daniel Gottesman, Adam Smith, and Alain Tapp. Thanks to them and to Debbie Leung for spotting the error.

DOI
10.48550/arxiv.quant-ph/0103123

Related papers

The Universal Composable Security of Quantum Message Authentication with Key Recyling

Patrick M. Hayden, Debbie Leung, Dominic Mayers

Barnum, Crepeau, Gottesman, Tapp, and Smith (quant-ph/0205128) proposed methods for authentication of quantum messages. The first method is an interactive protocol (TQA') based on teleportation. The second method is a noninteractive protocol (QA) in which the sender first encrypts the message using a protocol QEnc and then encodes the quantum ciphertext with an error correcting code chosen secretly from a set (a purity test code (PTC)). Encryption was shown to be necessary for authentication. We augment the protocol QA with an extra step which recycles the entire encryption key provided QA accepts the message. We analyze the resulting integrated protocol for quantum authentication and key generation, which we call QA+KG. Our main result is a proof that QA+KG is universal composably (UC) secure in the Ben-Or-Mayers model (quant-ph/0409062). More specifically, this implies the UC-security of (a) QA, (b) recycling of the encryption key in QA, and (c) key-recycling of the encryption scheme QEnc by appending PTC. For an m-qubit message, encryption requires 2m bits of key; but PTC can be performed using only O(log m) + O(log e) bits of key for probability of failure e. Thus, we reduce the key required for both QA and QEnc, from linear to logarithmic net consumption, at the expense of one bit of back communication which can happen any time after the conclusion of QA and before reusing the key. UC-security of QA also extends security to settings not obvious from quant-ph/0205128. Our security proof structure is inspired by and similar to that of quant-ph/0205128, reducing the security of QA to that of TQA'. In the process, we define UC-secure entanglement, and prove the UC-security of the entanglement generating protocol given in quant-ph/0205128, which could be of independent interest.

arXiv:1610.09434•Oct 29, 2016•21 citations

Quantum cryptography without a quantum channel

Marcos Curty, David J. Santos

This paper has been withdrawn by the authors because the results obtained have been reported earlier by other authors.

arXiv:quant-ph/0101079•Jan 17, 2001•1 citation

A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma

Marco Tomamichel

We prove a strong converse for quantum communication over Pauli channels within the class of stabilizer codes. If a code whose code space is a full joint eigenspace of a stabilizer group transmits above the coherent information of its own input state, its entanglement fidelity decays exponentially in the block length; the encoder may be any isometry onto that space and the decoder any channel. For memoryless channels this determines the $\varepsilon$-quantum capacity of the class for every $\varepsilon < 1$, so that tolerating a constant error buys no rate; for antidegradable channels, such as the depolarizing channel with error probability $p \in [1/4, 3/4]$, that capacity is zero, while for $p \in [1/4,1/2)$ partial-transposition bounds provably cannot certify a strong converse. The proof uses neither additivity assumptions nor semidefinite relaxations: optimal decoding succeeds precisely on an event in a product probability space, so the blowing-up lemma of Ahlswede, Gács and Körner applies, and the side information it produces is charged against the coherent information. The argument also constrains near-deterministic decoding for codes of any kind, and we isolate the encoder-side statement that would extend it to all of them.

quant-pharXiv:2607.23450•Jul 28, 2026•4 citations

On the classical authentication in Quantum Key Distribution

Edoardo Signorini, Guglielmo Morgari, Francesco Stocco

•Jan 1, 2023•0 citations

Authentication of Quantum Messages

Patrick M. Hayden, Debbie Leung, Dominic Mayers

Message authentication is a cryptographic task that allows the receiver to reject a message that is forged or has been tampered with. A protocol to authenticate quantum messages was proposed by Barnum, Crépeau, Gottesman, Tapp, and Smith [1] and stand-alone security was proved. Here, we are concerned with universal composable security (which requires a protocol to be essentially indistinguishable from the ideal functionality and ensures overall security when the protocol is part of any larger scheme). We show that the protocol in [1] is universal composably secure, and that most of the required key can be reused with universal composable security.

Imaging and Applied Optics•Jan 1, 2011•4 citations

Quantum Lego and XP Stabilizer Codes

Ruohan Shen, Yixu Wang, ChunJun Cao

We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their XP symmetries provided the resulting code is XP. We provide an efficient classical algorithm for tracking these symmetries under tensor contraction or conjoining. This constitutes a partial extension of the algorithm implied by the Gottesman-Knill theorem beyond Pauli stabilizer states and Clifford operations. Because conjoining transformations generate quantum operations that are universal, the XP symmetries obtained from these algorithms do not uniquely identify the resulting tensors in general. Using this extended framework, we provide examples of novel XP stabilizer codes with a higher distance than existing non-trivial XP regular codes and a [[8,1,2]] Pauli stabilizer code with a fault-tolerant T gate. For XP regular codes, we also construct a tensor-network-based maximum likelihood decoder for any independently and identically distributed single qubit error channel using weight enumerators.

arXiv:2310.19538•Quantum•Oct 6, 2025•13 citations
This paper has been withdrawn because of an error in the proof of Lemma 1. Without Lemma 1, the result of the main theorem (with the same proof, but omitting the use of Lemma 1 to extend things to general attacks) only holds for attacks in which the attacker applies a tensor product of Pauli matrices (for qubits) or generalized Pauli matrices. The resulting theorem is still relevant for quantum message authentication, but the very strong result claimed in earlier versions of this paper does not hold. These matters will be addressed further in joint work with Claude Crepeau, Daniel Gottesman, Adam Smith, and Alain Tapp. Thanks to them and to Debbie Leung for spotting the error.
Barnum, Crepeau, Gottesman, Tapp, and Smith (quant-ph/0205128) proposed methods for authentication of quantum messages. The first method is an interactive protocol (TQA') based on teleportation. The second method is a noninteractive protocol (QA) in which the sender first encrypts the message using a protocol QEnc and then encodes the quantum ciphertext with an error correcting code chosen secretly from a set (a purity test code (PTC)). Encryption was shown to be necessary for authentication. We augment the protocol QA with an extra step which recycles the entire encryption key provided QA accepts the message. We analyze the resulting integrated protocol for quantum authentication and key generation, which we call QA+KG. Our main result is a proof that QA+KG is universal composably (UC) secure in the Ben-Or-Mayers model (quant-ph/0409062). More specifically, this implies the UC-security of (a) QA, (b) recycling of the encryption key in QA, and (c) key-recycling of the encryption scheme QEnc by appending PTC. For an m-qubit message, encryption requires 2m bits of key; but PTC can be performed using only O(log m) + O(log e) bits of key for probability of failure e. Thus, we reduce the key required for both QA and QEnc, from linear to logarithmic net consumption, at the expense of one bit of back communication which can happen any time after the conclusion of QA and before reusing the key. UC-security of QA also extends security to settings not obvious from quant-ph/0205128. Our security proof structure is inspired by and similar to that of quant-ph/0205128, reducing the security of QA to that of TQA'. In the process, we define UC-secure entanglement, and prove the UC-security of the entanglement generating protocol given in quant-ph/0205128, which could be of independent interest.
We prove a strong converse for quantum communication over Pauli channels within the class of stabilizer codes. If a code whose code space is a full joint eigenspace of a stabilizer group transmits above the coherent information of its own input state, its entanglement fidelity decays exponentially in the block length; the encoder may be any isometry onto that space and the decoder any channel. For memoryless channels this determines the ε\varepsilonε-quantum capacity of the class for every ε<1\varepsilon < 1ε<1, so that tolerating a constant error buys no rate; for antidegradable channels, such as the depolarizing channel with error probability p∈[1/4,3/4]p \in [1/4, 3/4]p∈[1/4,3/4], that capacity is zero, while for p∈[1/4,1/2)p \in [1/4,1/2)p∈[1/4,1/2) partial-transposition bounds provably cannot certify a strong converse. The proof uses neither additivity assumptions nor semidefinite relaxations: optimal decoding succeeds precisely on an event in a product probability space, so the blowing-up lemma of Ahlswede, Gács and Körner applies, and the side information it produces is charged against the coherent information. The argument also constrains near-deterministic decoding for codes of any kind, and we isolate the encoder-side statement that would extend it to all of them.
Message authentication is a cryptographic task that allows the receiver to reject a message that is forged or has been tampered with. A protocol to authenticate quantum messages was proposed by Barnum, Crépeau, Gottesman, Tapp, and Smith [1] and stand-alone security was proved. Here, we are concerned with universal composable security (which requires a protocol to be essentially indistinguishable from the ideal functionality and ensures overall security when the protocol is part of any larger scheme). We show that the protocol in [1] is universal composably secure, and that most of the required key can be reused with universal composable security.
We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their XP symmetries provided the resulting code is XP. We provide an efficient classical algorithm for tracking these symmetries under tensor contraction or conjoining. This constitutes a partial extension of the algorithm implied by the Gottesman-Knill theorem beyond Pauli stabilizer states and Clifford operations. Because conjoining transformations generate quantum operations that are universal, the XP symmetries obtained from these algorithms do not uniquely identify the resulting tensors in general. Using this extended framework, we provide examples of novel XP stabilizer codes with a higher distance than existing non-trivial XP regular codes and a [[8,1,2]] Pauli stabilizer code with a fault-tolerant T gate. For XP regular codes, we also construct a tensor-network-based maximum likelihood decoder for any independently and identically distributed single qubit error channel using weight enumerators.