Author(s)

Chunming Tang, Shuhong Gao

.

We define a new type cryptographical model called secure multi-party proof that allows any players and a verifier to securely compute a function : each of the players learns nothing about other players’ input and about the value of , and the verifier obtains the value of and it’s validity but learns nothing about the input of any of the players. It is implemented by a protocol using oblivious transfer and Yao’s scrambled circuit. We prove that our protocol is secure if the players and the verifier are semi-honest (i.e. they follow the protocol) and polynomial time bounded. The main applications of our protocol are for electronic voting and electronic bidding.

Multi-Party Proof, Multi-Party Computation, Electronic Voting, Electronic Bidding

C. Tang and S. Gao, "Secure Multi-Party Proof and its Applications," Journal of Software Engineering and Applications, Vol. 3 No. 7, 2010, pp. 709-717. doi: 10.4236/jsea.2010.37081.