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/0307095

Quantum authentication scheme based on algebraic coding

Rex A. C. Medeiros, Francisco de Assis, Júior, Bernardo L., Aércio F. Lima

Published Jul 14, 2003• 4 citations
arXivHTMLPDF

Abstract

This paper presents a simple, but efficient class of non-interactive protocols for quantum authentication of $m$-length clas sical messages. The message is encoded using a classical linear algebraic code $C[n,m,t]$. We assume that Alice and Bob share a classical secret key, $x_{AB}$, of $n$ bits. Alice creates $n$ qubits based on the code word and the key, that indicates the bases used to create each qubit. The quantum states are sent to Bob through a noiseless quantum channel. We calculate the failure probability of the protocol considering several types of attacks.

DOI
10.48550/arxiv.quant-ph/0307095

Related papers

Authentication of quantum messages

Howard Barnum, Claude Crépeau, Daniel Gottesman +2 more

Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.

arXiv:quant-ph/0205128•Annual Symposium on Foundations of Computer Science•Jun 26, 2003•282 citations

A quantum authenticated encryption scheme

Xin Lü, Zhi Ma, Dengguo Feng

Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.

International Conference on Signal Processing•Jun 28, 2005•3 citations

Quantum Symmetric Cryptosystem Based on Algebraic Codes

Ali Amerimehr, Massoud Hadian Dehkordi

A quantum cryptosystem based on algebraic codes, which uses single photons as quantum message carriers, is given. The cryptosystem is equipped with authentication, data integrity, and non-repudiation. There is no need for a parallel classical channel since public conversation is omitted. Indeed by using a suitable algebraic error-correcting code, Alice and Bob do not need to share a string of common bases. Therefore, they already share only one secret key for encryption. The secret key can be reused many times also in a noisy environment. The encryption and the decryption are similar, so the cryptosystem can be thought symmetric. Analysis shows that the cryptosystem is secure, low cost, and more practical compared with the previous ones.

IEEE Communications Letters•Jun 20, 2018•5 citations

QKD Quantum Channel Authentication

Jon T. Kosloski

Several simple yet secure protocols to authenticate the quantum channel of various QKD schemes, by coupling the photon sender's knowledge of a shared secret and the QBER Bob observes, are presented. It is shown that Alice can encrypt certain portions of the information needed for the QKD protocols, using a sequence whose security is based on computational-complexity, without compromising all of the sequence's entropy. It is then shown that after a Man-in-the-Middle attack on the quantum and classical channels, there is still enough entropy left in the sequence for Bob to detect the presence of Eve by monitoring the QBER. Finally, it is shown that the principles presented can be implemented to authenticate the quantum channel associated with any type of QKD scheme, and they can also be used for Alice to authenticate Bob.

arXiv:quant-ph/0603101•Mar 11, 2006•0 citations

Quantum Authentication Protocol of Classical Messages Based on Different Sets of Orthogonal Quantum States

Xiangjun, Chaoyang Li, Dongsheng Chen +1 more

Most of the quantum authentication protocols are used to authenticate quantum messages.In this paper, by using a pair of non-entangled qubits, a quantum authentication protocol of classical messages is proposed.In the pair of qubits, the first one is used to carry a bit message, and the second one is used as a tag to authenticate the classical message.In our protocol, a bit string instead of a sequence of maximally entangled states is used directly as an authentication key, so the authentication key can be easily stored offline.On the other hand, in our protocol, a unitary operation UA is chosen to encrypt the qubits so that the successful probability of all attacks analyzed is less than one.Our quantum authentication protocol is secure against various attacks such as the no-message attack and message attacks.

International Journal of Future Generation Communication and Networking•May 31, 2016•0 citations

Quantum Authentication Protocol Using Bell State

Xiaoyu Li, Liju Chen

A quantum authentication protocol is presented in this paper. It is based on the correlations of the EPR(Einstain- Podolski-Rosen) pair which is a two-qubit system in one of the four Bell states. The two parties share a sequence of EPR pairs as the authentication key. To authenticate each other, they need to create auxiliary particles and make them interact with the authentication key. Then one can affirm the other's identity by performing the Bell states measure- ment. No one without the authentication key can pass the authentication process. So the protocol is secure. No clas- sical channel and classical information exchange is needed in the authentication process. After the authentication pro- cess, the authentication key can be turned into the origin state. So the authentication key can be reused.

International Symposium on Data, Privacy, and E-Commerce•Nov 1, 2007•17 citations
This paper presents a simple, but efficient class of non-interactive protocols for quantum authentication of mmm-length clas sical messages. The message is encoded using a classical linear algebraic code C[n,m,t]C[n,m,t]C[n,m,t]. We assume that Alice and Bob share a classical secret key, xABx_{AB}xAB​, of nnn bits. Alice creates nnn qubits based on the code word and the key, that indicates the bases used to create each qubit. The quantum states are sent to Bob through a noiseless quantum channel. We calculate the failure probability of the protocol considering several types of attacks.
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a secret, classical random key, we provide a non-interactive scheme that enables A to both encrypt and authenticate an m qubit message by encoding it into m+s qubits, where the error probability decreases exponentially in the security parameter s. The scheme requires a secret key of size 2m+O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically. This reasoning has two important consequences: It allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. Moreover, we use it to show that digitally signing quantum states is impossible.
Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.
A quantum cryptosystem based on algebraic codes, which uses single photons as quantum message carriers, is given. The cryptosystem is equipped with authentication, data integrity, and non-repudiation. There is no need for a parallel classical channel since public conversation is omitted. Indeed by using a suitable algebraic error-correcting code, Alice and Bob do not need to share a string of common bases. Therefore, they already share only one secret key for encryption. The secret key can be reused many times also in a noisy environment. The encryption and the decryption are similar, so the cryptosystem can be thought symmetric. Analysis shows that the cryptosystem is secure, low cost, and more practical compared with the previous ones.
Several simple yet secure protocols to authenticate the quantum channel of various QKD schemes, by coupling the photon sender's knowledge of a shared secret and the QBER Bob observes, are presented. It is shown that Alice can encrypt certain portions of the information needed for the QKD protocols, using a sequence whose security is based on computational-complexity, without compromising all of the sequence's entropy. It is then shown that after a Man-in-the-Middle attack on the quantum and classical channels, there is still enough entropy left in the sequence for Bob to detect the presence of Eve by monitoring the QBER. Finally, it is shown that the principles presented can be implemented to authenticate the quantum channel associated with any type of QKD scheme, and they can also be used for Alice to authenticate Bob.
Most of the quantum authentication protocols are used to authenticate quantum messages.In this paper, by using a pair of non-entangled qubits, a quantum authentication protocol of classical messages is proposed.In the pair of qubits, the first one is used to carry a bit message, and the second one is used as a tag to authenticate the classical message.In our protocol, a bit string instead of a sequence of maximally entangled states is used directly as an authentication key, so the authentication key can be easily stored offline.On the other hand, in our protocol, a unitary operation UA is chosen to encrypt the qubits so that the successful probability of all attacks analyzed is less than one.Our quantum authentication protocol is secure against various attacks such as the no-message attack and message attacks.
A quantum authentication protocol is presented in this paper. It is based on the correlations of the EPR(Einstain- Podolski-Rosen) pair which is a two-qubit system in one of the four Bell states. The two parties share a sequence of EPR pairs as the authentication key. To authenticate each other, they need to create auxiliary particles and make them interact with the authentication key. Then one can affirm the other's identity by performing the Bell states measure- ment. No one without the authentication key can pass the authentication process. So the protocol is secure. No clas- sical channel and classical information exchange is needed in the authentication process. After the authentication pro- cess, the authentication key can be turned into the origin state. So the authentication key can be reused.