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

Physica Scripta

Re-examining the security of blind quantum signature protocols

Ming‐Ming Wang, Xiu‐Bo Chen, Xinxin Niu, Yixian Yang

Published Oct 22, 2012• 11 citations
Publisher

Abstract

Recently, blind quantum signature (BQS) protocols have been proposed with the help of a third-party verifier. However, our research shows that some of the BQS protocols are unable to complete the blind signature task fairly if the verifier is dishonest. Indeed, these protocols can be viewed as variants of the classical digital signature scheme of symmetric-key cryptography. If nobody is trusted in such protocols, digital signature cannot be implemented since disagreements cannot be solved fairly.

DOI
10.1088/0031-8949/86/05/055006

Related papers

Semiquantum group proxy blind signature

Xiao TAN, ZhiGang GAN, TianYu YE

In this study, we propose the semiquantum group proxy blind signature scheme, in which the signature verifier and some proxy signers only possess limited quantum capabilities. On the basis that the original message content of the original message owner is blind to the original signer, the signature verifier, the proxy signature group and the trusted third party helping complete the signing process, this scheme can accomplish the goal of the original singer authorizing the proxy signature group to sign this original message. This scheme is proved to have unforgeability, non-repudiation, complete blindness and security. Since the signature verifier and some proxy signers only possess limited quantum capabilities, compared with many existing quantum group proxy blind signature protocols, this scheme has a wider range of signature application scenarios.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Jun 21, 2024•2 citations

Collusion-Resistance in Optimistic Fair Exchange

Yang Wang, Willy Susilo, Man Ho Au +1 more

Optimistic fair exchange (OFE) is a type of cryptographic protocols aimed at solving the fair exchange problem over open networks with the help of a third party to settle disputes between exchanging parties. It is well known that a third party is necessary in the realization of a fair exchange protocol. However, a fully trusted third party may not be available over open networks. In this paper, the security of most of the proposed OFE protocols depends on the assumption that the third party is semitrusted in the sense that it may misbehave on its own but does not conspire with either of the main parties. The existing security models of OFE have not taken into account the case where the potentially dishonest third party may collude with a signer in the sense of sharing its secret key with the signer. In this paper, to reduce the trust level of the arbitrator and increase the security of OFE, we propose an enhanced security model that, for the first time, captures this scenario. We also show a separation between the existing model and our enhanced model with a concrete counter example. Finally, we revisit two popular approaches in the construction of OFE protocols, which are based on verifiably encrypted signature and conventional signature plus ring signature, respectively. Our result shows that the conventional signature plus ring signature approach approach remains valid in our enhanced model. However, for schemes based on verifiably encrypted signature, slight modifications are needed to guarantee the security.

IEEE Transactions on Information Forensics and Security•May 21, 2014•2 citations

A publicly verifiable quantum blind signature scheme without entanglement based on asymmetric cryptography.

Yalin Chen, Jue‐Sam Chou, Liangchun Wang +1 more

•Jan 1, 2019•1 citation

Publicly Verifiable Blind Quantum Computation

Kentaro Honda

Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum computation protocol with a new property called public verifiability, which enables any third party to assure that a party does not benefit from attempted deception.

arXiv:1604.00116•Apr 1, 2016•7 citations

New scheme of fair exchange of digital signatures

Yu Shang

Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.

Computer Engineering and Applications Journal•Jan 1, 2008•1 citation

Fair quantum blind signatures

Tian‐Yin Wang, Wen Qiao-yan

We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.

Chinese Physics B•Jun 1, 2010•74 citations
Recently, blind quantum signature (BQS) protocols have been proposed with the help of a third-party verifier. However, our research shows that some of the BQS protocols are unable to complete the blind signature task fairly if the verifier is dishonest. Indeed, these protocols can be viewed as variants of the classical digital signature scheme of symmetric-key cryptography. If nobody is trusted in such protocols, digital signature cannot be implemented since disagreements cannot be solved fairly.
In this study, we propose the semiquantum group proxy blind signature scheme, in which the signature verifier and some proxy signers only possess limited quantum capabilities. On the basis that the original message content of the original message owner is blind to the original signer, the signature verifier, the proxy signature group and the trusted third party helping complete the signing process, this scheme can accomplish the goal of the original singer authorizing the proxy signature group to sign this original message. This scheme is proved to have unforgeability, non-repudiation, complete blindness and security. Since the signature verifier and some proxy signers only possess limited quantum capabilities, compared with many existing quantum group proxy blind signature protocols, this scheme has a wider range of signature application scenarios.
Optimistic fair exchange (OFE) is a type of cryptographic protocols aimed at solving the fair exchange problem over open networks with the help of a third party to settle disputes between exchanging parties. It is well known that a third party is necessary in the realization of a fair exchange protocol. However, a fully trusted third party may not be available over open networks. In this paper, the security of most of the proposed OFE protocols depends on the assumption that the third party is semitrusted in the sense that it may misbehave on its own but does not conspire with either of the main parties. The existing security models of OFE have not taken into account the case where the potentially dishonest third party may collude with a signer in the sense of sharing its secret key with the signer. In this paper, to reduce the trust level of the arbitrator and increase the security of OFE, we propose an enhanced security model that, for the first time, captures this scenario. We also show a separation between the existing model and our enhanced model with a concrete counter example. Finally, we revisit two popular approaches in the construction of OFE protocols, which are based on verifiably encrypted signature and conventional signature plus ring signature, respectively. Our result shows that the conventional signature plus ring signature approach approach remains valid in our enhanced model. However, for schemes based on verifiably encrypted signature, slight modifications are needed to guarantee the security.
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum computation protocol with a new property called public verifiability, which enables any third party to assure that a party does not benefit from attempted deception.
Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.