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 Conference on Communications

Arbitrated Secure Authentication realized by using quantum principles

Helena Bruyninckx, Dirk Van Heule

Published Jun 1, 2015• 0 citations
Publisher

Abstract

Unconditionally secure authentication schemes with an arbiter have been proposed in the literature. We extend this idea in the context of quantum authentication. In this paper, we present an unconditionally secure authentication scheme with an arbiter by using quantum principles. Compared to other arbitrated quantum schemes, our scheme is secure against denial by the sender of having sent a message (non-repudiation property) and also secure against a malicious receiver. We consider the problem of authenticating a classical message in the presence of a semi-honest arbiter. The shared secret keys can be reused, in contrast to several other proposed arbitrated quantum schemes.

DOI
10.1109/icc.2015.7249512

Related papers

Quantum signature scheme for known quantum messages

Taewan Kim, Hyang-Sook Lee

Abstract When we want to sign a quantum message that we create, we can use arbitrated quantum signature schemes which are possible to sign for not only known quantum messages but also unknown quantum messages. However, since the arbitrated quantum signature schemes need the help of a trusted arbitrator in each verification of the signature, it is known that the schemes are not convenient in practical use. If we consider only known quantum messages such as the above situation, there can exist a quantum signature scheme with more efficient structure. In this paper, we present a new quantum signature scheme for known quantum messages without the help of an arbitrator. Differing from arbitrated quantum signature schemes based on the quantum one-time pad with the symmetric key, since our scheme is based on quantum public-key cryptosystems, the validity of the signature can be verified by a receiver without the help of an arbitrator. Moreover, we show that our scheme provides the functions of quantum message integrity, user authentication and non-repudiation of the origin as in digital signature schemes.

Physica Scripta•Apr 14, 2015•1 citation

Security analysis and improvements of arbitrated quantum signature schemes

Xiangfu Zou, Daowen Qiu

A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature (AQS) schemes have been proposed. It was claimed that these AQS schemes could guarantee unconditional security. However, we show that they can be repudiated by the receiver Bob. To conquer this shortcoming, we construct an AQS scheme using a public board. The AQS scheme not only avoids being disavowed by the receiver but also preserves all merits in the existing schemes. Furthermore, we discover that entanglement is not necessary while all these existing AQS schemes depend on entanglement. Therefore, we present another AQS scheme without utilizing entangled states in the signing phase and the verifying phase. This scheme has three advantages: it does not utilize entangled states and it preserves all merits in the existing schemes; the signature can avoid being disavowed by the receiver; and it provides a higher efficiency in transmission and reduces the complexity of implementation.

Physical Review A•Oct 21, 2010•181 citations

An efficient and provably secure arbitrated quantum signature scheme

Qin Li, Chengqing Li, Chunhui Wu +2 more

In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.

arXiv:0806.0557•Jun 3, 2008•0 citations

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•293 citations

An Arbitrated Quantum Signature Scheme without Entanglement *

Hui-Ran Li, Ming-Xing 明星 Luo 罗, Peng Dai-yuan +1 more

Abstract Several quantum signature schemes are recently proposed to realize secure signatures of quantum or classical messages. Arbitrated quantum signature as one nontrivial scheme has attracted great interests because of its usefulness and efficiency. Unfortunately, previous schemes cannot against Trojan horse attack and DoS attack and lack of the unforgeability and the non-repudiation. In this paper, we propose an improved arbitrated quantum signature to address these secure issues with the honesty arbitrator. Our scheme takes use of qubit states not entanglements. More importantly, the qubit scheme can achieve the unforgeability and the non-repudiation. Our scheme is also secure for other known quantum attacks .

Communications in Theoretical Physics•Sep 1, 2017•7 citations

Arbitrated quantum signature schemes without using entangled states

Xiangfu Zou, Daowen Qiu

A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature schemes have being proposed. However, in the existing literature, arbitrated quantum signature schemes depend on entanglement. In this paper, we present two arbitrated quantum signature schemes without utilizing entangled states in the signing phase and the verifying phase. The first proposed scheme can preserve the merits in the existing schemes. Then, we point out, in this scheme and the prior schemes, there exists a problem that Bob can repudiate the integrality of the signatures. To conquer this problem, we construct another arbitrated quantum signature scheme without using quantum entangled states but using a public board. The new scheme has three advantages: it does not utilize entangled states while it can preserve all merits in the existing schemes; the integrality of the signature can avoid being disavowed by the receiver; and, it provides a higher efficiency in transmission and reduces the complexity of implementation. Furthermore, we present a technique such that the quantum message can keep secret to the arbitrator in a arbitrated quantum signature scheme.

arXiv:1003.2337•Mar 11, 2010•0 citations
Unconditionally secure authentication schemes with an arbiter have been proposed in the literature. We extend this idea in the context of quantum authentication. In this paper, we present an unconditionally secure authentication scheme with an arbiter by using quantum principles. Compared to other arbitrated quantum schemes, our scheme is secure against denial by the sender of having sent a message (non-repudiation property) and also secure against a malicious receiver. We consider the problem of authenticating a classical message in the presence of a semi-honest arbiter. The shared secret keys can be reused, in contrast to several other proposed arbitrated quantum schemes.
Abstract When we want to sign a quantum message that we create, we can use arbitrated quantum signature schemes which are possible to sign for not only known quantum messages but also unknown quantum messages. However, since the arbitrated quantum signature schemes need the help of a trusted arbitrator in each verification of the signature, it is known that the schemes are not convenient in practical use. If we consider only known quantum messages such as the above situation, there can exist a quantum signature scheme with more efficient structure. In this paper, we present a new quantum signature scheme for known quantum messages without the help of an arbitrator. Differing from arbitrated quantum signature schemes based on the quantum one-time pad with the symmetric key, since our scheme is based on quantum public-key cryptosystems, the validity of the signature can be verified by a receiver without the help of an arbitrator. Moreover, we show that our scheme provides the functions of quantum message integrity, user authentication and non-repudiation of the origin as in digital signature schemes.
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature (AQS) schemes have been proposed. It was claimed that these AQS schemes could guarantee unconditional security. However, we show that they can be repudiated by the receiver Bob. To conquer this shortcoming, we construct an AQS scheme using a public board. The AQS scheme not only avoids being disavowed by the receiver but also preserves all merits in the existing schemes. Furthermore, we discover that entanglement is not necessary while all these existing AQS schemes depend on entanglement. Therefore, we present another AQS scheme without utilizing entangled states in the signing phase and the verifying phase. This scheme has three advantages: it does not utilize entangled states and it preserves all merits in the existing schemes; the signature can avoid being disavowed by the receiver; and it provides a higher efficiency in transmission and reduces the complexity of implementation.
In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.
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.
Abstract Several quantum signature schemes are recently proposed to realize secure signatures of quantum or classical messages. Arbitrated quantum signature as one nontrivial scheme has attracted great interests because of its usefulness and efficiency. Unfortunately, previous schemes cannot against Trojan horse attack and DoS attack and lack of the unforgeability and the non-repudiation. In this paper, we propose an improved arbitrated quantum signature to address these secure issues with the honesty arbitrator. Our scheme takes use of qubit states not entanglements. More importantly, the qubit scheme can achieve the unforgeability and the non-repudiation. Our scheme is also secure for other known quantum attacks .
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document. For signing quantum messages, some arbitrated quantum signature schemes have being proposed. However, in the existing literature, arbitrated quantum signature schemes depend on entanglement. In this paper, we present two arbitrated quantum signature schemes without utilizing entangled states in the signing phase and the verifying phase. The first proposed scheme can preserve the merits in the existing schemes. Then, we point out, in this scheme and the prior schemes, there exists a problem that Bob can repudiate the integrality of the signatures. To conquer this problem, we construct another arbitrated quantum signature scheme without using quantum entangled states but using a public board. The new scheme has three advantages: it does not utilize entangled states while it can preserve all merits in the existing schemes; the integrality of the signature can avoid being disavowed by the receiver; and, it provides a higher efficiency in transmission and reduces the complexity of implementation. Furthermore, we present a technique such that the quantum message can keep secret to the arbitrator in a arbitrated quantum signature scheme.