Sciweavers

CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
14 years 4 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin