Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or, Shafi Goldwasser, Avi Wigderson

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

1945 Scopus citations

Abstract

Every function of n inputs can be efficiently computed by a complete network of n processors in such a way that: 1. If no faults occur, no set of size t < n/2 of players gets any additional information (other than the function value), 2. Even if Byzantine faults are allowed, no set of size t < n/3 can either disrupt the computation or get additional information. Furthermore, the above bounds on t are tight!

Original languageAmerican English
Title of host publicationProceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988
PublisherAssociation for Computing Machinery
Pages1-10
Number of pages10
ISBN (Print)0897912640, 9780897912648
DOIs
StatePublished - 1988
Event20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States
Duration: 2 May 19884 May 1988

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference20th Annual ACM Symposium on Theory of Computing, STOC 1988
Country/TerritoryUnited States
CityChicago, IL
Period2/05/884/05/88

Fingerprint

Dive into the research topics of 'Completeness theorems for non-cryptographic fault-tolerant distributed computation'. Together they form a unique fingerprint.

Cite this