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

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)

A Quantum Concurrent Signature Scheme Based on the Quantum Finite Automata Signature Scheme

Hongji Wang, Gang Yao, Beizhan Wang

Published Oct 30, 2020• 3 citations
Publisher

Abstract

When using digital signatures, we need to deal with the problem of fairness of information exchange. To solve this problem, Chen, etc. introduced a new conception which is named concurrent signatures in Eurocrypt'04. Using concurrent signatures scheme, two entities in the scheme can generate two ambiguous signatures until one of the entities releases additional information which is called keystone. After the keystone is released, the two ambiguous signatures will be bound to their real signers at the same time. In order to provide a method to solve the fairness problem of quantum digital signatures, we propose a new quantum concurrent signature scheme. The scheme we proposed does not use a trusted third party in a quantum computing environment, and has such advantages as no need to conduct complex quantum operations and easy to implement by a quantum circuit. Quantum concurrent signature improves the theory of quantum cryptography, and it also provides broad prospects for the specific applications of quantum cryptography.

DOI
10.1109/asid50160.2020.9271729

Related papers

Perfect Concurrent Signature Protocol

Zhenjie Huang, Rufen Huang, Xuanzhi Lin

The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)•Jul 1, 2007•5 citations

Perfect Concurrent Signature Protocol for Symmetric Participant

Han Jiang, Qiuliang Xu, Bo Zhang

The concept of concurrent signatures was introduced by Chen et al. in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party¿s point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. In the previous concurrent signature schemes, the roles of participants are asymmetrical, one party, which is called initial signer, needs to create the keystone fix and send the first ambiguous signature, the other party, which is called matching signer, responds to this initial signer by creating another ambiguous signature with the same keystone fix. This work mode may cause some unfairness. In this paper, we construct a perfect concurrent signature protocol for symmetric participants and prove its security. In our concept, the roles of participants are symmetrical. The keystone can not be decided by any participant and the two ambiguous signatures can be published in any order.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2008•2 citations

Efficient Strong Fair Concurrent Signature Scheme

Jianhong Zhang, Shengnan Gao

We propose a fair novel concurrent signature scheme. It resolves the existing problems in traditional concurrent signature schemes, that is initial signer (A) has some advantages over matching signer (B), such as A could show B's ambiguous signature and the keystone to a third party in private to demonstrate B's binding signature but B can not, or A could keep the keystone secret and B do not have power to force A to release it. In our scheme, the keystones were produced by both A and B, that is to say, the two participants in our scheme have equal positions, no one has any priority than the other, so our scheme can achieve the fairness of both sides.

International Conference on E-Business and E-Government•May 1, 2010•0 citations

A Quantum Ring Signature Scheme Based on the Quantum Finite Automata Signature Scheme

Hongji Wang, Gang Yao, Beizhan Wang

In quantum cryptography research area, quantum digital signature is an important research field. To provide a better privacy for users in constructing quantum digital signature, the stronger anonymity of quantum digital signatures is required. Quantum ring signature scheme focuses on anonymity in certain scenarios. Using quantum ring signature scheme, the quantum message signer hides his identity into a group. At the same time, there is no need for any centralized organization when the user uses the quantum ring signature scheme. The group used to hide the signer identity can be immediately selected by the signer himself, and no collaboration between users.Since the quantum finite automaton signature scheme is very efficient quantum digital signature scheme, based on it, we propose a new quantum ring signature scheme. We also showed that the new scheme we proposed is of feasibility, correctness, anonymity, and unforgeability. And furthermore, the new scheme can be implemented only by logical operations, so it is easy to implement.

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)•Oct 29, 2021•3 citations

On the Security of a Lattice-Based Multi-party Concurrent Signature Scheme

Xianping Mao, Kefei Chen, Liangliang Wang +1 more

Fair exchange is essential in E-commerce, and concurrent signature realizes the fair exchange of digital signatures with removing the requirement of a trusted third party. Multi-party concurrent signature is an extension to the multi-user scenario. The security of existing multi-party concurrent signatures is mostly based on traditional hard problems that could be solved efficiently with quantum algorithms in a post-quantum world. Meanwhile, the lattice-based cryptography is considered to be resistant to quantum attack. Wang et al. proposed a lattice-based multi-party concurrent signature. We give the analysis of their proposed signature scheme and find that it is not secure since an inside adversary can forge the signature. Moreover, the initial signer can produce any signatures, instead of a signature on the original messages, if he is malicious.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2014•2 citations

Concurrent signature scheme over braid groups

Zhang Xing-kai

To resist the quantum computing,this paper proposed a concurrent signature scheme over braid group on the difficulty of root extraction problem.The initial signer and the matching signer chose two keystones,respectively,which guaranteed the fairness.Analysis shows that before releasing the keystones,both signatures are ambiguous while upon release of the keystones,both signatures become binding to their true signers concurrently.

Jisuanji yingyong yanjiu•Jan 1, 2010•0 citations
When using digital signatures, we need to deal with the problem of fairness of information exchange. To solve this problem, Chen, etc. introduced a new conception which is named concurrent signatures in Eurocrypt'04. Using concurrent signatures scheme, two entities in the scheme can generate two ambiguous signatures until one of the entities releases additional information which is called keystone. After the keystone is released, the two ambiguous signatures will be bound to their real signers at the same time. In order to provide a method to solve the fairness problem of quantum digital signatures, we propose a new quantum concurrent signature scheme. The scheme we proposed does not use a trusted third party in a quantum computing environment, and has such advantages as no need to conduct complex quantum operations and easy to implement by a quantum circuit. Quantum concurrent signature improves the theory of quantum cryptography, and it also provides broad prospects for the specific applications of quantum cryptography.
The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.
The concept of concurrent signatures was introduced by Chen et al. in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party¿s point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. In the previous concurrent signature schemes, the roles of participants are asymmetrical, one party, which is called initial signer, needs to create the keystone fix and send the first ambiguous signature, the other party, which is called matching signer, responds to this initial signer by creating another ambiguous signature with the same keystone fix. This work mode may cause some unfairness. In this paper, we construct a perfect concurrent signature protocol for symmetric participants and prove its security. In our concept, the roles of participants are symmetrical. The keystone can not be decided by any participant and the two ambiguous signatures can be published in any order.
We propose a fair novel concurrent signature scheme. It resolves the existing problems in traditional concurrent signature schemes, that is initial signer (A) has some advantages over matching signer (B), such as A could show B's ambiguous signature and the keystone to a third party in private to demonstrate B's binding signature but B can not, or A could keep the keystone secret and B do not have power to force A to release it. In our scheme, the keystones were produced by both A and B, that is to say, the two participants in our scheme have equal positions, no one has any priority than the other, so our scheme can achieve the fairness of both sides.
In quantum cryptography research area, quantum digital signature is an important research field. To provide a better privacy for users in constructing quantum digital signature, the stronger anonymity of quantum digital signatures is required. Quantum ring signature scheme focuses on anonymity in certain scenarios. Using quantum ring signature scheme, the quantum message signer hides his identity into a group. At the same time, there is no need for any centralized organization when the user uses the quantum ring signature scheme. The group used to hide the signer identity can be immediately selected by the signer himself, and no collaboration between users.Since the quantum finite automaton signature scheme is very efficient quantum digital signature scheme, based on it, we propose a new quantum ring signature scheme. We also showed that the new scheme we proposed is of feasibility, correctness, anonymity, and unforgeability. And furthermore, the new scheme can be implemented only by logical operations, so it is easy to implement.
Fair exchange is essential in E-commerce, and concurrent signature realizes the fair exchange of digital signatures with removing the requirement of a trusted third party. Multi-party concurrent signature is an extension to the multi-user scenario. The security of existing multi-party concurrent signatures is mostly based on traditional hard problems that could be solved efficiently with quantum algorithms in a post-quantum world. Meanwhile, the lattice-based cryptography is considered to be resistant to quantum attack. Wang et al. proposed a lattice-based multi-party concurrent signature. We give the analysis of their proposed signature scheme and find that it is not secure since an inside adversary can forge the signature. Moreover, the initial signer can produce any signatures, instead of a signature on the original messages, if he is malicious.