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 E-Business and E-Government

Efficient Strong Fair Concurrent Signature Scheme

Jianhong Zhang, Shengnan Gao

Published May 1, 2010• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icee.2010.339

Related papers

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

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

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

Hongji Wang, Gang Yao, Beizhan Wang

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.

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

Novel fair exchange protocol based on concurrent signature

Yang Yi-xian

Based on perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.

Journal of Communications•Jan 1, 2008•2 citations

Accountability of Perfect Concurrent Signature

Yunfeng Li, Dake He, Xianhui Lu

Concurrent signature provided a novel idea for fair exchange protocol without trusted third party. Perfect Concurrent Signature is proposed to strengthen the ambiguity of the concurrent signature. Wang et al, pointed out there exist an attack against the fairness of Perfect Concurrent Signature and proposed the improved perfect concurrent signature. This paper find that in proposed (perfect) concurrent signature protocol, no matter two party or multi-party, the signer could bind multiple messages with one keystone set but let the other signers know only one of the messages. Based on this observation, this paper proposes that accountability should be one of the security properties of (perfect) concurrent signature and we give the definition of accountability of concurrent signature. To illustrate this idea, this paper give an attack scene against the accountability of improved perfect concurrent signature proposed by Wang et al. Finally, this paper proposes an update version of perfect concurrent signature to avoid such attack.

International Conference on Computer and Electrical Engineering•Dec 1, 2008•7 citations

Concurrent Signature Based on Verifiable Ring Signature

Jingwei Liu

In this paper,we first proposed a new concurrent signature based on a verifiable ring signature scheme and constructed a corresponding concurrent signature protocol.At last,we gave the analysis of the security of our scheme.The advantages of concurrent signature scheme is very sufficient to fairness as well as signer-ambiguity,unforgeriability and verifiability.It provides a new way to solve the problem of fair exchange of signatures.

Computer Engineering and Applications Journal•Jan 1, 2006•0 citations
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.
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.
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.
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.
Based on perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.
Concurrent signature provided a novel idea for fair exchange protocol without trusted third party. Perfect Concurrent Signature is proposed to strengthen the ambiguity of the concurrent signature. Wang et al, pointed out there exist an attack against the fairness of Perfect Concurrent Signature and proposed the improved perfect concurrent signature. This paper find that in proposed (perfect) concurrent signature protocol, no matter two party or multi-party, the signer could bind multiple messages with one keystone set but let the other signers know only one of the messages. Based on this observation, this paper proposes that accountability should be one of the security properties of (perfect) concurrent signature and we give the definition of accountability of concurrent signature. To illustrate this idea, this paper give an attack scene against the accountability of improved perfect concurrent signature proposed by Wang et al. Finally, this paper proposes an update version of perfect concurrent signature to avoid such attack.