$next$ $up$ $previous$
Next: Everything Provable is Provable Up: The Post-Doctoral Period (1983-86) Previous: Towards a Theory of

How to Play any Mental Game or a Completeness Theorem for Protocols with Honest Majority

It is shown how to securely implement that any desired multi-party functionality. Security can be guaranteed provided either a majority of the players are honest or all parties are ``semi-honest'' (i.e., send messages according to the protocol, but keep track of and share all intermediate results).

$\fbox{\begin{minipage}{40em} {\bf Abstract ({rev.}):} {We present a general the... ...f a function, outputs an efficient solution for this problem.} \end{minipage}}$

Comments: Authored by O. Goldreich, S. Micali and A. Wigderson. Appeared in

Proc. of the 19th STOC, pp. 218-229, 1987.

Oded Goldreich
2003-07-30