Communication Complexity of Secure Computation (Extended Abstract)

Authors: Matthew K. Franklin, Moti Yung - ACM Symposium on Theory of Computing, STOC 1992 cited by 262

A secret-ballot vote for a single proposition is an example of a secure distributed computation. The goal is for m participants to jointly compute the output of some n-ary function (in this case, the sum of the votes), while protecting their individual inputs against some form of misbehavior.