Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

Abstract

A multiparty protocol to compute a function f(x1, ..., xn) operates as follows: each of n processors holds an input xi, and jointly they must compute and reveal f(x1, ..., xn) without revealing any additional information about the inputs. The processors are connected by secure communication lines but some number of processors may be corrupted by a resource-unbounded adversary that may attempt to interfere with the protocol or to gain extra information. Ben-Or, Goldwasser, Wigderson, Chaum, Crépeau, and Damgård have given protocols tolerating faults in t