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

Comment on "An arbitrated quantum signature scheme with fast signing and verifying"

Yiping Luo, Tzonelih Hwang

Published Dec 2, 2015• 0 citations
arXivHTMLPDF

Abstract

Recently, Liu et al. (Quantum Inf Process (2014) 13:491-502) proposed an arbitrated quantum signature (AQS) scheme, where a signature receiver (Bob) can verify the signer's signature through the help of a trusted arbitrator. However, this paper shows that a malicious Bob can perform the existential forgery of the signature under the chosen message attack without being detected.

DOI
10.48550/arxiv.1512.00714

Related papers

New Arbitrated Quantum Signature Scheme without Entangled state

GuanXiong Jiang, Jun Zhang

Arbitrated quantum signature (AQS) schemes use quantum cryptography to ensure their security, and the schemes provide that the signature receiver verifies the signature with the arbitrator's assistance.Very recently, Gao and Choi found in some previous AQS schemes, the receiver, Bob can counterfeit the signer's signature under known message.Additionally, the paper gives the security analysis of the AQS scheme, and results show that not only the receiver, but also the attacker can forge the signature in the AQS scheme.Furthermore, the signer can successfully disavow any message she ever signed.To conquer these shortcomings, this paper gives a new AQS scheme without quantum entangled state; it uses special quantum logic gate and new quantum one-time pads to ensure its security.Compares with other previous AQS schemes, the new scheme has following advantages: (1) the new scheme guarantees the receiver and the attacker cannot forge the signature; (2) Because the new scheme does not use quantum entangled states, so it can reduce the complexity of implementation and provides a higher efficiency in transmission; (3) The receiver, Bob has verified the signature's integrity, so Alice cannot disavow her having signed message.

International Journal of Security and Its Applications•Jan 31, 2015•1 citation

Cryptanalysis of the arbitrated quantum signature protocols

Fei Gao, Su‐Juan Qin, Fen-Zhuo Guo +1 more

As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.

arXiv:1106.4398•Physical Review A•Aug 29, 2011•183 citations

Comment on “Security analysis and improvements of arbitrated quantum signature schemes”

Tzonelih Hwang, Yi-Ping Luo, Song‐Kong Chong

Recently, Zou, and Qiu [Phys. Rev. A 82, 042325 (2010)] demonstrated that two arbitrated quantum signature (AQS) schemes are not secure because an arbitrator cannot arbitrate the dispute between two users when a receiver repudiates the integrity of a signature. By using a public board, Zou and Qiu's proposed two AQS schemes to solve the problem. This work shows that the same security problem may exist in Zou and Qiu's schemes. Moreover, a malicious verifier, Bob, can actively negate a signed order if he wants to. This attack, a special case of the denial-of-service (DoS) attack mentioned by Cai [Phys. Rev. Lett. 91, 109801 (2003)], is important in quantum cryptography. Bob may get some benefits from this DoS attack since he can actively deny Alice's signed order without being detected. This work also shows that a malicious signer can reveal the verifier's secret key without being detected by using Trojan-horse attacks.

arXiv:1105.1232•Physical Review A•May 24, 2012•40 citations

Comment on "An arbitrated quantum signature protocol based on the chained CNOT operations encryption"

Yiping Luo, Tzonelih Hwang

In 2015, Li et al. (Quantum Inf Process (2015) 14:2171-2181) proposed an arbitrated quantum signature (AQS) scheme based on the chained controlled-NOT operations encryption. However, this paper points out that in their scheme an attacker can forge a signature without being detected. Therefore, Li et al.'s AQS scheme cannot satisfy the unforgeability and non-repudiation property.

arXiv:1512.00711•Dec 2, 2015•3 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

Efficient arbitrated quantum signature scheme without entangled states

Xiangjun Xin, Qianqian He, Zhuo Wang +2 more

In the most arbitrated quantum signatures (AQSs), the signers and verifiers need to perform the quantum key distribution protocols or some other protocols to share secret keys before signing a signature. In some schemes, the entangle states, which are not easily implemented, have to be prepared and distributed among the partners. Based on single photon and one-way functions, a new AQS scheme without entangled states is proposed. In our scheme, the signer generates a quantum signature on the classical message with his/her private key and the one-way function. The arbitrator communicates with the signer through a classical unencrypted channel. The signer and verifier need not perform the key distribution protocol before signing a message. On the other hand, without entangled states, our scheme can reduce the complexity of implementation. Then, our scheme is more efficient than the similar schemes. At the same time, our scheme is secure against forgery attack and disavowal attack.

Modern Physics Letters A•Jun 24, 2019•14 citations
Recently, Liu et al. (Quantum Inf Process (2014) 13:491-502) proposed an arbitrated quantum signature (AQS) scheme, where a signature receiver (Bob) can verify the signer's signature through the help of a trusted arbitrator. However, this paper shows that a malicious Bob can perform the existential forgery of the signature under the chosen message attack without being detected.
Arbitrated quantum signature (AQS) schemes use quantum cryptography to ensure their security, and the schemes provide that the signature receiver verifies the signature with the arbitrator's assistance.Very recently, Gao and Choi found in some previous AQS schemes, the receiver, Bob can counterfeit the signer's signature under known message.Additionally, the paper gives the security analysis of the AQS scheme, and results show that not only the receiver, but also the attacker can forge the signature in the AQS scheme.Furthermore, the signer can successfully disavow any message she ever signed.To conquer these shortcomings, this paper gives a new AQS scheme without quantum entangled state; it uses special quantum logic gate and new quantum one-time pads to ensure its security.Compares with other previous AQS schemes, the new scheme has following advantages: (1) the new scheme guarantees the receiver and the attacker cannot forge the signature; (2) Because the new scheme does not use quantum entangled states, so it can reduce the complexity of implementation and provides a higher efficiency in transmission; (3) The receiver, Bob has verified the signature's integrity, so Alice cannot disavow her having signed message.
As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.
Recently, Zou, and Qiu [Phys. Rev. A 82, 042325 (2010)] demonstrated that two arbitrated quantum signature (AQS) schemes are not secure because an arbitrator cannot arbitrate the dispute between two users when a receiver repudiates the integrity of a signature. By using a public board, Zou and Qiu's proposed two AQS schemes to solve the problem. This work shows that the same security problem may exist in Zou and Qiu's schemes. Moreover, a malicious verifier, Bob, can actively negate a signed order if he wants to. This attack, a special case of the denial-of-service (DoS) attack mentioned by Cai [Phys. Rev. Lett. 91, 109801 (2003)], is important in quantum cryptography. Bob may get some benefits from this DoS attack since he can actively deny Alice's signed order without being detected. This work also shows that a malicious signer can reveal the verifier's secret key without being detected by using Trojan-horse 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.
In the most arbitrated quantum signatures (AQSs), the signers and verifiers need to perform the quantum key distribution protocols or some other protocols to share secret keys before signing a signature. In some schemes, the entangle states, which are not easily implemented, have to be prepared and distributed among the partners. Based on single photon and one-way functions, a new AQS scheme without entangled states is proposed. In our scheme, the signer generates a quantum signature on the classical message with his/her private key and the one-way function. The arbitrator communicates with the signer through a classical unencrypted channel. The signer and verifier need not perform the key distribution protocol before signing a message. On the other hand, without entangled states, our scheme can reduce the complexity of implementation. Then, our scheme is more efficient than the similar schemes. At the same time, our scheme is secure against forgery attack and disavowal attack.