Communication complexity of secure computation (extended abstract)
Matthew K. Franklin, Moti M. Yung · 1992
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.