Title :
Fault-tolerant computation in the full information model
Author :
Goldreich, Oded ; Goldwasser, Shafi ; Linial, Nathan
Author_Institution :
Dept. of Comput. Sci., Technion, Haifa, Israel
Abstract :
Efficient two-party protocols for fault-tolerant computation of any two-argument function are presented. It is proved that the influence of a dishonest player in these protocols is the minimum one possible (up to polylogarithmic factors). Also presented are efficient m-party fault-tolerant protocols for sampling a general distribution (m⩾2). Efficient m-party protocols for computation of any m-argument function are given, and it is proved for these protocols that for most functions, the influence of any t dishonest players on the outcome of the protocol is the minimum one possible (up to polylogarithmic factors)
Keywords :
fault tolerant computing; protocols; fault tolerant computation; full information model; m-argument function; m-party fault-tolerant protocols; polylogarithmic factors; sampling; two-argument function; two-party protocols; Computational modeling; Computer science; Costs; Distributed computing; Erbium; Fault tolerance; Joining processes; Laboratories; Protocols; Sampling methods;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185405