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

Symmetry

Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce

Ren-Junn Hwang, Chih-Hua Lai

Published Apr 28, 2015• 14 citations
Publisher

Abstract

Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. Using the proposed protocol, any untrusted parties can fairly exchange documents without the assistance of online, trusted third parties. Moreover, a notary only notarizes each document once. The authorized document owner can exchange a notarized document with different parties repeatedly without disclosing the origin of the document or the identities of transaction participants. Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances forward secrecy, transaction privacy, and authorized exchange. The proposed protocol is more efficient than other works.

DOI
10.3390/sym7020464

Related papers

Fair Document Exchange Protocol with Confidentiality

Xiaoxin Ye, Zhenfu Cao, Xiaohui Liang

The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.

Jisuanji gongcheng•Jan 1, 2009•1 citation

A New Fair Non-Repudiation Protocol with Off-Line Semi-Trusted Third Party

Cai Wang

Non repudiation and fairness turn out to be two important security properties of electronic commerce protocols.In this paper,based on a verifiable encryption with blind decryption,we present a new fair non repudiation protocol with off line semi trusted third party,so either transaction party can unilaterally bring a transaction to completion without losing fairness.This is the first non repudiation protocol with off line semi trusted third party.

Dianzi xuebao•Jan 1, 2002•0 citations

Anonymous Fair Exchange Protocol with a Semitrusted Third Party

Lijuan Guo, Xuelian Li, Xiaolin Lv +1 more

Anonymity attracts wide attention in the electronic transaction, but participants usually do not trust each other. The problem inspires researchers to provide fair exchange protocol based on the third party. However, the third party is fully trusted and vulnerable to attack. This paper proposes an asynchronous optimistic fair exchange protocol. One of the important contributions is to preserve the anonymity even against a semitrusted third party. More importantly, the proposed protocol has minimal dependencies on the semitrusted third party as participants are forced to be honest. Meanwhile, the monopoly information owner can exchange the authentication information with different participants. Security analysis and performance comparison show that our constructions not only ensure transaction privacy and fairness, but also enjoy high efficiency.

IEEE International Conference on Data Science in Cyberspace•Jun 1, 2017•2 citations

A FAIR MULTI-PARTY NON-REPUDIATION PROTOCOL

Deng Suo-yun

Non-repudiation is one of the most important premises to achieve electronic commerce while fairness is what people have been chasing during electronic transaction. Fair non-repudiation protocols resolve the question of non-repudiation during the course of transferring information in electronic commerce and make all communicating sides in equal positions. That is to say, the protocols are fair for all sides. In the present paper, a fair multi-party non-repudiation protocol based on a group encryption scheme is introduced. The flow of the protocol and its analysis are given in the paper. In the protocol, every side can not have advantages over other sides, because the advantages can result in great loss of other sides. The method that how to solve the dissension with this protocol is also given in the present paper. A trusted third party is used to generate non-repudiation evidence. With this method the number of exchanged messages is small. So this protocol can achieve non-repudiation service in an efficient and practical way.

Applied Mechanics and Materials•Jan 1, 2001•1 citation

An Enhanced-Security Fair E-payment Protocol

Wei Fan, Huaying Shu, Elizabeth Fife +1 more

Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) protocol. It can protect both of the participants' profits. Whatpsilas more, in this protocol customers have more initiative, and they can terminate the transaction before possible cheats (while they also should be responsible for the quit), so their security is enhanced. As there is no traditional trusted third party (TTP) in our scheme, network congestion and conspiracy problem can be avoided. Moreover, the protocol satisfies fairness and non-repudiation, and it can also be applied in the digital signature or product exchange process.

•Jan 1, 2009•3 citations

Optimistic fair exchange e-commerce protocol based on secret sharing

Changshe Ma, Feiyu Lei, Chen Kefei

A key problem of electronic commerce (for short e-commerce) is fair exchange which guarantees that at the end of the transaction, either both parties in the transaction receive each other's items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants' items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified (2,2) secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.

Journal of Systems Engineering and Electronics•Dec 1, 2006•3 citations
Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. Using the proposed protocol, any untrusted parties can fairly exchange documents without the assistance of online, trusted third parties. Moreover, a notary only notarizes each document once. The authorized document owner can exchange a notarized document with different parties repeatedly without disclosing the origin of the document or the identities of transaction participants. Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances forward secrecy, transaction privacy, and authorized exchange. The proposed protocol is more efficient than other works.
The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.
Anonymity attracts wide attention in the electronic transaction, but participants usually do not trust each other. The problem inspires researchers to provide fair exchange protocol based on the third party. However, the third party is fully trusted and vulnerable to attack. This paper proposes an asynchronous optimistic fair exchange protocol. One of the important contributions is to preserve the anonymity even against a semitrusted third party. More importantly, the proposed protocol has minimal dependencies on the semitrusted third party as participants are forced to be honest. Meanwhile, the monopoly information owner can exchange the authentication information with different participants. Security analysis and performance comparison show that our constructions not only ensure transaction privacy and fairness, but also enjoy high efficiency.
Non-repudiation is one of the most important premises to achieve electronic commerce while fairness is what people have been chasing during electronic transaction. Fair non-repudiation protocols resolve the question of non-repudiation during the course of transferring information in electronic commerce and make all communicating sides in equal positions. That is to say, the protocols are fair for all sides. In the present paper, a fair multi-party non-repudiation protocol based on a group encryption scheme is introduced. The flow of the protocol and its analysis are given in the paper. In the protocol, every side can not have advantages over other sides, because the advantages can result in great loss of other sides. The method that how to solve the dissension with this protocol is also given in the present paper. A trusted third party is used to generate non-repudiation evidence. With this method the number of exchanged messages is small. So this protocol can achieve non-repudiation service in an efficient and practical way.
Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) protocol. It can protect both of the participants' profits. Whatpsilas more, in this protocol customers have more initiative, and they can terminate the transaction before possible cheats (while they also should be responsible for the quit), so their security is enhanced. As there is no traditional trusted third party (TTP) in our scheme, network congestion and conspiracy problem can be avoided. Moreover, the protocol satisfies fairness and non-repudiation, and it can also be applied in the digital signature or product exchange process.
A key problem of electronic commerce (for short e-commerce) is fair exchange which guarantees that at the end of the transaction, either both parties in the transaction receive each other's items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants' items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified (2,2) secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.