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:0806.1231

Improving Classical Authentication with Quantum Communication

Francisco de Assis, Paulo Mateus, Yasser Omar

Published Jun 6, 2008• 2 citations
arXivHTMLPDF

Abstract

We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.

DOI
10.48550/arxiv.0806.1231

Related papers

Improving Classical Authentication over a Quantum Channel

Francisco de Assis, Aleksandar Stojanović, Paulo Mateus +1 more

We propose a quantum protocol to authenticate classical messages that can be used to replace Wegman–Carter’s classical authentication scheme in quantum key distribution (QKD) protocols. We show that the proposed scheme achieves greater conditional entropy of the seed for the intruder given her (quantum) observation than the classical case. The proposed scheme is suitable for situations where the shared symmetric key used in authentication becomes dangerously short (due to noise or eavesdropping), and there is a threat that it might be completely consumed without being replaced. Our protocol is an improvement over a classical scheme by Brassard and takes advantage of quantum channel properties. It is motivated by information-theoretical results. We stress that the proposed authentication protocol can also be used as an independent authentication protocol that is not a part of a QKD. However by adopting it, QKD becomes a fully quantum protocol. We prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function. We conclude that the proposed quantum encoding offers more security than the classical scheme and, by applying a classical result, we show that it can be used under noisy quantum channels.

Entropy•Dec 11, 2012•7 citations

Quantum Authentication of Classical Messages Using Non-orthogonal Qubits and Hash Function

Xiangjun Xin, Xiaolin Hua, Chaoyang Li +1 more

Quantum authentication protocol can be used to authenticate classical messages in a secure manner. In this paper, by using the cryptographic hash function and non-orthogonal qubits, a quantum authentication protocol of classical messages is proposed. In our protocol, the classical messages and their corresponding tags are encoded as nonorthogonal qubits. The message receiver decodes the classical messages and their corresponding tags from the received qubits by using the authentication key. To verify the validity of the received classical messages, the message receiver verifies whether the hash values of the decoded classical messages are equal to the corresponding tags. Our scheme can be proved to be secure against forgery attack and measurement attack. On the other hand, the authentication key is a binary string, which can be securely obtained and easily saved. What is more, because the authentication key remains secure after executing the authentication protocol, it provides the possibility of reusing the authentication key.

International Journal of u- and e- Service Science and Technology•Oct 31, 2016•3 citations

Information-Theoretically Secure Data Origin Authentication with Quantum and Classical Resources

Georgios M. Nikolopoulos, Marc Fischlin

In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.

arXiv:2011.06849•Cryptography•Nov 13, 2020•10 citations

Quantum Authentication Protocol for Classical Messages Based on Bell states and Hash Function

Xiangjun Xin, Xiaolin Hua, Jianpo Song +1 more

Quantum authentication protocols can be used to authenticate both quantum messages and classical messages.In this paper, a new quantum authentication protocol of classical messages is proposed.In our protocol, a sequence of Bell states is shared by the message sender and the corresponding receiver.This sequence is used as the authentication key.Four different unitary operations U 0 , U 1 , U 2 and U 3 are used to encode a classical message m and its hash value h(m) into a sequence of Bell states.To authenticate the classical message, the message receiver extracts m and h(m) from the qubits owned by himself/herself, and verifies whether h(m) matches m.The adversary's disturbance to the quantum channel can be detected by checking whether h(m) matches m.The transmitted message has the properties of both secrecy and authentication.Our quantum authentication protocol is secure against message attack and no-message attack.

International Journal of Security and Its Applications•Jul 31, 2015•5 citations

Quantum Authentication of Classical Messages without Entangled State as Authentication Key

Xiangjun Xin, Fagen Li

Classical messages can be authenticated by traditional authentication protocols based on hash functions.The security of these protocols depends on long authentication keys, the selection of appropriate hash functions and some assumptions concerning the computational complexity of some algorithms.In this paper, by encoding the classical binary messages and binary keys as nonorthogonal quantum messages and nonorthogonal sets of states, respectively, and using quantum encrypting scheme, a new quantum authentication protocol is proposed.In our protocol, instead of entangled quantum states, the traditional binary bits, which can be easily saved, are encoded as quantum keys.Because the quantum messages are nonorthogonal, any forgery or measurement on the quantum messages will be detected with a certain probability.Our protocol allows the authentication of binary classical messages in a secure manner.

International Journal of Multimedia and Ubiquitous Engineering•Oct 31, 2015•7 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
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.
We propose a quantum protocol to authenticate classical messages that can be used to replace Wegman–Carter’s classical authentication scheme in quantum key distribution (QKD) protocols. We show that the proposed scheme achieves greater conditional entropy of the seed for the intruder given her (quantum) observation than the classical case. The proposed scheme is suitable for situations where the shared symmetric key used in authentication becomes dangerously short (due to noise or eavesdropping), and there is a threat that it might be completely consumed without being replaced. Our protocol is an improvement over a classical scheme by Brassard and takes advantage of quantum channel properties. It is motivated by information-theoretical results. We stress that the proposed authentication protocol can also be used as an independent authentication protocol that is not a part of a QKD. However by adopting it, QKD becomes a fully quantum protocol. We prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function. We conclude that the proposed quantum encoding offers more security than the classical scheme and, by applying a classical result, we show that it can be used under noisy quantum channels.
Quantum authentication protocol can be used to authenticate classical messages in a secure manner. In this paper, by using the cryptographic hash function and non-orthogonal qubits, a quantum authentication protocol of classical messages is proposed. In our protocol, the classical messages and their corresponding tags are encoded as nonorthogonal qubits. The message receiver decodes the classical messages and their corresponding tags from the received qubits by using the authentication key. To verify the validity of the received classical messages, the message receiver verifies whether the hash values of the decoded classical messages are equal to the corresponding tags. Our scheme can be proved to be secure against forgery attack and measurement attack. On the other hand, the authentication key is a binary string, which can be securely obtained and easily saved. What is more, because the authentication key remains secure after executing the authentication protocol, it provides the possibility of reusing the authentication key.
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.
Quantum authentication protocols can be used to authenticate both quantum messages and classical messages.In this paper, a new quantum authentication protocol of classical messages is proposed.In our protocol, a sequence of Bell states is shared by the message sender and the corresponding receiver.This sequence is used as the authentication key.Four different unitary operations U 0 , U 1 , U 2 and U 3 are used to encode a classical message m and its hash value h(m) into a sequence of Bell states.To authenticate the classical message, the message receiver extracts m and h(m) from the qubits owned by himself/herself, and verifies whether h(m) matches m.The adversary's disturbance to the quantum channel can be detected by checking whether h(m) matches m.The transmitted message has the properties of both secrecy and authentication.Our quantum authentication protocol is secure against message attack and no-message attack.
Classical messages can be authenticated by traditional authentication protocols based on hash functions.The security of these protocols depends on long authentication keys, the selection of appropriate hash functions and some assumptions concerning the computational complexity of some algorithms.In this paper, by encoding the classical binary messages and binary keys as nonorthogonal quantum messages and nonorthogonal sets of states, respectively, and using quantum encrypting scheme, a new quantum authentication protocol is proposed.In our protocol, instead of entangled quantum states, the traditional binary bits, which can be easily saved, are encoded as quantum keys.Because the quantum messages are nonorthogonal, any forgery or measurement on the quantum messages will be detected with a certain probability.Our protocol allows the authentication of binary classical messages in a secure manner.
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.