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(x₁, . . . , x_n,) where x_i is the input of the i-th player. The method uses as a building block an oblivious transfer primitive.Previous methods achieved these properties, only for boolean functions, which, in particular, precluded composition of such protocols.We also propose a simpler definition of security for multi-player protocols which still implies previous definitions of privacy and correctness.