Multi-party Fair Exchange Protocol Research Articles

Quantum multi-party fair exchange protocol based on three-particle GHZ states

Quantum multi-party fair exchange protocol based on three-particle GHZ states

Multi-party Fair Exchange Protocol with Smart Contract on Bitcoin

Traditional multi-party exchange protocols need a third party to ensure fairness. It can bring some communication costs and cryptanalytic attacks. In recent years, researchers have focused on blockchain to design a fair exchange protocol without a central authority. So far, there are a few works on fair exchange protocols for any topology based on bitcoin. This paper puts forward a decentralized protocol for star topology based on the bitcoin, that is, our protocol does not contain a third party. Communication costs, information disclosure, and cryptanalytic attacks are not considered for the third party. These features greatly reduce the burden and increase the efficiency of the protocol. To guarantee the fairness, a commitment scheme is provided. And the proposed protocol constructs an ideal function as a smart contract. The bitcoin is automatically transferred in the limited time instead of manual operations. Security analysis shows that our construction can guarantee fairness, resist double spending and sybil attack. Meanwhile, the proposed protocol enjoys high efficiency. Moreover, with a slight modification, our protocol can be extended to apply to any topology.

An efficient resource-fair commit-prove-fair-open protocol

With the development of modern internet and mobile networks, there is an increasing need for privacy-preserving cooperative computation and cloud computing. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic in privacy-carrying protocols. The commit-prove-fair-open protocol is one of multi-party fair exchange protocols against the malicious adversary in breaking the fair play of the participants, and it provides an important tool of SMPC to make it possible to achieve the fairness with corrupted majority according to the standard real/ideal world simulation paradigm framework. In this paper, we at first prove two lemmas about the simplified Camenisch-Shoup commitment and the time-lines, and then propose a very efficient resource-fair commit-prove-fair-open protocol. Compared with the other commit-prove-fair-open protocols, our new protocol enjoys two important advantages: 1 communications cost and computations price are less than 20%; 2 it allows commitment to obtain value 0, which is not implemented in the other constructions.

Exclusions and related trust relationships in multi-party fair exchange protocols

Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchange protocols allowing the secure implementation of such transactions enable participants to exclude other entities from a protocol execution. This is an important point that has not been sufficiently addressed when analysing such kind of protocols, and that may be crucial for the successful accomplishment of multi-party electronic transactions. In this paper we define the properties related to exchange protocols and exclusions, study exclusion scenarios on two well-known multi-party fair exchange protocols and point out the implications that exclusions may have on the trust relationships between participants, and, more generally, on electronic commerce. Two new protocols more robust than existing multi-party fair exchange protocols are therefore proposed.

Formal analysis and design of multi-party fair exchange protocols

Based on the origin of message items and channel combination between transacting parties, and events and relations among events, this paper presents a concise, precise, and hierarchical model for general fair exchange protocols, formally specifies various security requirements which are able to reflect inherent requirements for fair exchange protocols more rigorously, and partition these security requirements with fine granularity. This work helps analyze, debug, and design multi-party fair exchange protocols more effectively and elaborately.

Multi-party Fair Exchange Protocol Using Ring Architecture Model

We present a new protocol which allows multiple parties to exchange electronic items over the Internet in a secure and fair way. This allows either each party to get what it expects to receive, or neither party to receive anything. This protocol is applicable to various electronic businesses, for example, electronic shopping, group purchases, electronic voting, electronic auctions, and electronic bidding. The multi-party fair exchange protocol using the ring model is more efficient and robust than the protocol using the full-mesh model proposed by SEMPER. Our protocol reduces its communication complexity and simplifies its recovery procedures compared with SEMPER’s.