An efficient PMPC protocol

Abstract

The private multi-party computation protocol proposed by Claude Crepeau etc.is not only complicated but very inefficient.This paper describes a new protocol with an efficient global commitment transfer sub-protocol.With a first two round string oblivious transfer,the protocol can avoid performing a large mount of bit oblivious transfers.And with bit commitment with XOR,zero knowledge proofs are very easy.This PMPC protocol is conceptually simple and more efficient.The security and complexity of the protocol are also discussed in this paper.