Fault-tolerant computation in the full information model

Oded Goldreich*, Shafi Goldwasser, Nathan Linial

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

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-part 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).

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages447-457
Number of pages11
ISBN (Print)0818624450
StatePublished - Dec 1991
Externally publishedYes
EventProceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA
Duration: 1 Oct 19914 Oct 1991

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

ConferenceProceedings of the 32nd Annual Symposium on Foundations of Computer Science
CitySan Juan, PR, USA
Period1/10/914/10/91

Fingerprint

Dive into the research topics of 'Fault-tolerant computation in the full information model'. Together they form a unique fingerprint.

Cite this