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

한국산업응용수학회 학술대회 논문집

ON QUANTUM SIGNATURE SCHEMES

Jeong Woon Choi, Taewan Kim, Soojoon Lee

Published May 1, 2012• 0 citations
OpenAlex

Abstract

Recently, many arbitrated quantum signature schemes have been proposed and analyzed [1– 8]. Most of the proposed quantum signature schemes have used the optimal quantum one-time encryptions [9,10] based on Pauli operators to guarantee unconditional security and perform the efficient schemes. However, it has been shown that the schemes are not secure by Choi et al. [11]. They have provided a new method to recover security against the proposed attack. Here, we consider arbitrated quantum signature schemes modified by the new method and analyze the security of the schemes for known and unknown quantum messages against the more general attack.

Related papers

Security problem on arbitrated quantum signature schemes

Jeong Woon Choi, Ku-Young Chang, Dowon Hong

Many arbitrated quantum signature schemes implemented with the help of a trusted third party have been developed up to now. In order to guarantee unconditional security, most of them take advantage of the optimal quantum one-time encryption based on Pauli operators. However, in this paper we point out that the previous schemes provide security only against a total break attack and show in fact that there exists an existential forgery attack that can validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover security against the proposed attack.

arXiv:1106.5318•Physical Review A•Dec 29, 2011•97 citations

On the security of arbitrated quantum signature schemes

Qin Li, Chengqing Li, Zhonghua Wen +2 more

Due to potential capability of providing unconditional security, arbitrated quantum signature (AQS) schemes, whose implementation depends on the participation of a trusted third party, received intense attention in the past decade. Recently, some typical AQS schemes were cryptanalyzed and improved. In this paper, we analyze security property of some AQS schemes and show that all the previous AQS schemes, no matter original or improved, are still insecure in the sense that the messages and the corresponding signatures can be exchanged among different receivers, allowing the receivers to deny accepting the signature of an appointed message. Some further improvement methods on the AQS schemes are also discussed.

arXiv:1205.3265•Journal of Physics A Mathematical and Theoretical•Dec 5, 2012•22 citations

Improving the security of arbitrated quantum signature protocols

Zhiwei Sun, Ruigang Du, Dongyang Long

Arbitrated quantum signatures (AQS), for signing quantum message, have been proposed. It was claimed that the AQS schemes could guarantee unconditional security. However, in this paper, we show that all the presented AQS protocols are insecure if quantum one-time pad encryption is used where the signer Alice can always successfully acquire Bob's secret key and disavow any of her signatures. The detailed attack strategies and security analysis are described. Furthermore, the original version of the protocols is revised and accordingly the security of the AQS protocols are improved. And meanwhile we present a method to against Alice's disavowal proposed by Gao et al. (arXiv:1106.4398v1).

arXiv:1107.2459•Jul 13, 2011•12 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 scheme

Guihua Zeng, Christoph H. Keitel

The general principle for a quantum-signature scheme is proposed and investigated based on ideas from classical signature schemes and quantum cryptography. The suggested algorithm is implemented by a symmetrical quantum key cryptosystem and Greenberger-Horne-Zeilinger (GHZ) triplet states and relies on the availability of an arbitrator. We can guarantee the unconditional security of the algorithm, mostly due to the correlation of the GHZ triplet states and the use of quantum one-time pads.

arXiv:quant-ph/0109007•Physical Review A•Apr 1, 2002•438 citations

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
Recently, many arbitrated quantum signature schemes have been proposed and analyzed [1– 8]. Most of the proposed quantum signature schemes have used the optimal quantum one-time encryptions [9,10] based on Pauli operators to guarantee unconditional security and perform the efficient schemes. However, it has been shown that the schemes are not secure by Choi et al. [11]. They have provided a new method to recover security against the proposed attack. Here, we consider arbitrated quantum signature schemes modified by the new method and analyze the security of the schemes for known and unknown quantum messages against the more general attack.
Many arbitrated quantum signature schemes implemented with the help of a trusted third party have been developed up to now. In order to guarantee unconditional security, most of them take advantage of the optimal quantum one-time encryption based on Pauli operators. However, in this paper we point out that the previous schemes provide security only against a total break attack and show in fact that there exists an existential forgery attack that can validly modify the transmitted pair of message and signature. In addition, we also provide a simple method to recover security against the proposed attack.
Due to potential capability of providing unconditional security, arbitrated quantum signature (AQS) schemes, whose implementation depends on the participation of a trusted third party, received intense attention in the past decade. Recently, some typical AQS schemes were cryptanalyzed and improved. In this paper, we analyze security property of some AQS schemes and show that all the previous AQS schemes, no matter original or improved, are still insecure in the sense that the messages and the corresponding signatures can be exchanged among different receivers, allowing the receivers to deny accepting the signature of an appointed message. Some further improvement methods on the AQS schemes are also discussed.
Arbitrated quantum signatures (AQS), for signing quantum message, have been proposed. It was claimed that the AQS schemes could guarantee unconditional security. However, in this paper, we show that all the presented AQS protocols are insecure if quantum one-time pad encryption is used where the signer Alice can always successfully acquire Bob's secret key and disavow any of her signatures. The detailed attack strategies and security analysis are described. Furthermore, the original version of the protocols is revised and accordingly the security of the AQS protocols are improved. And meanwhile we present a method to against Alice's disavowal proposed by Gao et al. (arXiv:1106.4398v1).
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 (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.