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

International Journal of u- and e- Service Science and Technology

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

Xiangjun Xin, Xiaolin Hua, Chaoyang Li, Dongsheng Chen

Published Oct 31, 2016• 3 citations
Publisher

Abstract

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.

DOI
10.14257/ijunesst.2016.9.10.17

Related papers

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

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 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 of classical messages

Marcos Curty, David J. Santos

Although key distribution is arguably the most studied context on which to apply quantum cryptographic techniques, message authentication, i.e., certifying the identity of the message originator and the integrity of the message sent, can also benefit from the use of quantum resources. Classically, message authentication can be performed by techniques based on hash functions. However, the security of the resulting protocols depends on the selection of appropriate hash functions, and on the use of long authentication keys. In this paper, we propose a quantum authentication procedure that, making use of just one qubit as the authentication key, allows the authentication of binary classical messages in a secure manner.

arXiv:quant-ph/0103122•Physical Review A•Nov 14, 2001•133 citations

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 with Perfect Security

Francisco de Assis, Paulo Mateus, Yasser Omar

In this work we have investigated how quantum resources can improve the security of protocol for authentication of classical messages, 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 have started by showing that a BB84-type encoding of secret bits offers more security than the classicalXOR function introduced by Brassard. Furthermore, we established the conditions a general PRG must satisfy for our quantum-enhanced protocol to yield informationtheoretical security. Altogether, our proposal represents a twofold improvement: first it offers proven information-theoretical security under some assumptions on the PRG; secondly, these assumptions are weaker than the requirements for the PRG in Brassard’s protocol. Additionally, our proposal is also more practical in the sense that it requires a shorter key than the classical scheme by using the pseudorandom bits to choose the tag’s hash function. 1

arXiv:0806.1231•Jun 6, 2008•1 citation
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.
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.
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.
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.
Although key distribution is arguably the most studied context on which to apply quantum cryptographic techniques, message authentication, i.e., certifying the identity of the message originator and the integrity of the message sent, can also benefit from the use of quantum resources. Classically, message authentication can be performed by techniques based on hash functions. However, the security of the resulting protocols depends on the selection of appropriate hash functions, and on the use of long authentication keys. In this paper, we propose a quantum authentication procedure that, making use of just one qubit as the authentication key, allows the authentication of binary classical messages in a secure manner.
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.
In this work we have investigated how quantum resources can improve the security of protocol for authentication of classical messages, 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 have started by showing that a BB84-type encoding of secret bits offers more security than the classicalXOR function introduced by Brassard. Furthermore, we established the conditions a general PRG must satisfy for our quantum-enhanced protocol to yield informationtheoretical security. Altogether, our proposal represents a twofold improvement: first it offers proven information-theoretical security under some assumptions on the PRG; secondly, these assumptions are weaker than the requirements for the PRG in Brassard’s protocol. Additionally, our proposal is also more practical in the sense that it requires a shorter key than the classical scheme by using the pseudorandom bits to choose the tag’s hash function. 1