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

Authors: Ou Ruan; Jing Zhou; Mingwu Zhang

Addresses: School of Computer Science and Technology, Hubei University of Technology, Wuhan, China ' School of Computer Science and Technology, Hubei University of Technology, Wuhan, China ' School of Computer Science and Technology, Hubei University of Technology, Wuhan, China; Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, China

Abstract: 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.

Keywords: commit-prove-fair-open; resource fairness; secure multi-party computation; SMPC; fair exchange; timelines; privacy preservation; privacy protection; cloud computing; simulation; network security.

DOI: 10.1504/IJESDF.2016.073729

International Journal of Electronic Security and Digital Forensics, 2016 Vol.8 No.1, pp.17 - 34

Received: 11 Feb 2015
Accepted: 20 Jul 2015

Published online: 16 Dec 2015 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article