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

Journal of Software

Constructing Optimistic ID-Based Fair Exchange Protocols via Proxy Signature

Jing Min Xu

Published Jan 1, 2007• 1 citation
Publisher

Abstract

This paper introduces a natural paradigm for fair exchange protocols, called ID-based partial proxy signature scheme. A security model with precise and formal definitions is presented, and an efficient and provably secure partial proxy signature scheme is proposed. This is a full ID-based optimistic fair exchange protocol. Unlike the vast majority of previously proposed protocols, this approach does not use any zero knowledge proofs, and thus avoids most of the costly computations.

DOI
10.1360/jos180746

Related papers

An optimistic fair exchange protocol for proxy signatures

Kosar Ghorbani, Maryam Rajabzadeh Asaar, Mahmoud Salmasizadeh

In this paper we present an optimistic fair exchange (OFE) protocol for proxy signatures. This protocol is useful in scenarios that a signer cannot participate in an OFE protocol himself and he needs to delegate his signing power to another one. We give a new security model for this type of protocols because the best and the most complete model until now does not consider all security aspects of this protocol. We construct a generic scheme and give a paradigm for it. Our scheme is setup-free and multi-user secure in the random oracle and chosen-key model.

International Symposium on Telecommunications•Sep 1, 2014•3 citations

Efficient and Optimistic Fair Exchanges Based on Standard RSA with Provable Security.

Zhenfeng Zhang, Yongbin Zhou, Dengguo Feng

In this paper, we introduce a new and natural paradigm for fair exchange protocols, called verifiable probabilistic signature scheme. A security model with precise and formal definitions is presented, and an RSA-based efficient and provably secure verifiable probabilistic signature scheme is proposed. Our scheme works well with standard RSA signature schemes, and the proposed optimistic fair exchange protocol is much concise and efficient, and suitable for practical applications.

•Jan 1, 2004•6 citations

ID-Based Optimistic Fair Exchange Scheme Based on RSA

Taek-Young Youn, Ku-Young Chang

Fairness of exchange is a significant property for secure online transactions, and a fair exchange scheme is a useful tool for ensuring the fairness of exchanges conducted over networks. In this paper, we propose an ID-based optimistic fair exchange scheme based on the RSA function, one which is designed by combining a well-known RSA-based signature scheme and the (naive) RSA function. Note that the main contribution of this paper is to give the first provably secure ID-based fair exchange scheme based on the RSA function, whose security can be proved under fully formalized security models. Our scheme has the following additional strongpoints. The scheme is setup-free; hence, there is no registration step between a user and an arbitrator. Moreover, the proposed scheme is designed in an ID-based setting; thus, it is possible to eliminate the need for certificates and avoid some related problems.

ETRI Journal•Mar 19, 2014•0 citations

An identity-based scheme of fair exchange of digital signatures

Yong Hong Yu, Bo Yang, Yang Guoqing

Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•3 citations

Chameleon-Based Optimistic Fair Exchange Protocol

Xuan Yang, Zhaoping Yu, Bin Kang

A fair exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item or neither party does. In this paper, we propose a key-exposure-free chameleon hashing scheme based on the discrete logarithm assumption, and prove that it enjoys all advantages of previous schemes: collision resistant, semantic security, message hiding and key exposure freeness. Using this new scheme as kernel, an efficient and secure chameleon-based optimistic fair exchange protocol is proposed. Unlike the vast majority of previously proposed protocols, above approach has no use for verifiably encrypted signature and does not use any zero knowledge proofs, which avoids most of the costly computations. The security of the newly devised protocol is also examined. It is showed that the proposed scheme is secure and efficient.

International Conference on Embedded Software and Systems•Jan 1, 2008•5 citations

New Optimistic Fair Exchange Protocol Based on Short Signature

Yanbin Sun, Lize Gu, Sihan Qing +3 more

In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.

IEEE International Conference on Communication Software and Networks•Jan 1, 2010•7 citations
This paper introduces a natural paradigm for fair exchange protocols, called ID-based partial proxy signature scheme. A security model with precise and formal definitions is presented, and an efficient and provably secure partial proxy signature scheme is proposed. This is a full ID-based optimistic fair exchange protocol. Unlike the vast majority of previously proposed protocols, this approach does not use any zero knowledge proofs, and thus avoids most of the costly computations.
In this paper we present an optimistic fair exchange (OFE) protocol for proxy signatures. This protocol is useful in scenarios that a signer cannot participate in an OFE protocol himself and he needs to delegate his signing power to another one. We give a new security model for this type of protocols because the best and the most complete model until now does not consider all security aspects of this protocol. We construct a generic scheme and give a paradigm for it. Our scheme is setup-free and multi-user secure in the random oracle and chosen-key model.
Fairness of exchange is a significant property for secure online transactions, and a fair exchange scheme is a useful tool for ensuring the fairness of exchanges conducted over networks. In this paper, we propose an ID-based optimistic fair exchange scheme based on the RSA function, one which is designed by combining a well-known RSA-based signature scheme and the (naive) RSA function. Note that the main contribution of this paper is to give the first provably secure ID-based fair exchange scheme based on the RSA function, whose security can be proved under fully formalized security models. Our scheme has the following additional strongpoints. The scheme is setup-free; hence, there is no registration step between a user and an arbitrator. Moreover, the proposed scheme is designed in an ID-based setting; thus, it is possible to eliminate the need for certificates and avoid some related problems.
Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.
A fair exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item or neither party does. In this paper, we propose a key-exposure-free chameleon hashing scheme based on the discrete logarithm assumption, and prove that it enjoys all advantages of previous schemes: collision resistant, semantic security, message hiding and key exposure freeness. Using this new scheme as kernel, an efficient and secure chameleon-based optimistic fair exchange protocol is proposed. Unlike the vast majority of previously proposed protocols, above approach has no use for verifiably encrypted signature and does not use any zero knowledge proofs, which avoids most of the costly computations. The security of the newly devised protocol is also examined. It is showed that the proposed scheme is secure and efficient.
In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.