S. D. Gordon, C. Hazay, J. Katz and Y. Lindell, “Complete Fairness in Secure Two-Party Computation,” Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 2008, pp. 413-422.

has been cited by the following article:

• TITLE: Secure Multi-Party Proof and its Applications

  AUTHORS: Chunming Tang, Shuhong Gao

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

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.3 No.7, July 23, 2010

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