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

China Information Security

Quantum Message Authentication Scheme Based on the Shared EPR Entangled States

Haiwen Ou

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

In this paper, we have investigated quantum authentication scheme and presented a message authentica- tion scheme, which is based on shared quantum EPR entangled states. This scheme is an authentication on classical bits string and combines with quantum stabilizer codes to complete the authentication to quantum message. The security of scheme relies on the correlation of EPR states, the authenticity of the quantum information is guaranteed by quantum stabilizer codes and security of the quantum information on channel is ensured by quantum one-time pad.

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

Faithful Quantum Secure Communication with Authentication based on Bell States and Classical XOR Resisting Collective Noise

Tao Fang, Min Li

Two faithful quantum secure communication and authentication schemes based on Bell states and classical XOR operation are proposed, which withstand collective noises.The authentication and eavesdropping detection are completed by using logical decoy photons generating by previously shared identity string.The logical decoy photons are decoherence-free states over the two collective noisy channels respectively.The transmission of secret message is a one-time pad system, which guarantees the absolute security of secret message.Encoding secret message after particle transmission ensures the accuracy of secret message.

International Journal of Security and Its Applications•Sep 30, 2015•0 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 digital signature based on quantum one-way functions

Xin Lü, Dengguo Feng

A quantum digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications

International Conference on Advanced Communication Technology•Jan 1, 2005•37 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 information authentication using entangled states

Xiaoyu Li, Dexi Zhang

This paper provides a quantum information authentication protocol using entangled states. The two parties share EPR (Einstein-Podolsky-Rosen) pairs as authentication key. Information is coded in two-qubits systems. The two parties confirm the validity of the information by making the coding systems to interact with the authentication key. We prove that information from anyone who has no authentication key can't pass the authentication. So our protocol is secure. If there are no errors and eavesdroppers existing in transmission, the authentication key can be reused

International Conference on Digital Telecommunications (ICDT)•Sep 22, 2006•7 citations
In this paper, we have investigated quantum authentication scheme and presented a message authentica- tion scheme, which is based on shared quantum EPR entangled states. This scheme is an authentication on classical bits string and combines with quantum stabilizer codes to complete the authentication to quantum message. The security of scheme relies on the correlation of EPR states, the authenticity of the quantum information is guaranteed by quantum stabilizer codes and security of the quantum information on channel is ensured by quantum one-time pad.
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.
Two faithful quantum secure communication and authentication schemes based on Bell states and classical XOR operation are proposed, which withstand collective noises.The authentication and eavesdropping detection are completed by using logical decoy photons generating by previously shared identity string.The logical decoy photons are decoherence-free states over the two collective noisy channels respectively.The transmission of secret message is a one-time pad system, which guarantees the absolute security of secret message.Encoding secret message after particle transmission ensures the accuracy of secret message.
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 digital signature scheme based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by fundamental quantum principles. Our protocol involves a so-called arbitrator who validates and authenticates the signed message. This scheme uses public quantum keys publicized by the signatory to verify the validity of the signature and uses quantum one-time pad to ensure the security of quantum information on channel. To guarantee the authenticity of the transmitted quantum states, a family of quantum stabilizer code is employed. The proposed scheme presents a novel method to construct secure quantum signature systems for future secure communications
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.
This paper provides a quantum information authentication protocol using entangled states. The two parties share EPR (Einstein-Podolsky-Rosen) pairs as authentication key. Information is coded in two-qubits systems. The two parties confirm the validity of the information by making the coding systems to interact with the authentication key. We prove that information from anyone who has no authentication key can't pass the authentication. So our protocol is secure. If there are no errors and eavesdroppers existing in transmission, the authentication key can be reused