@inproceedings{a8d511cb7b4e41f185220a49ebe0160c,

title = "Completeness theorems for non-cryptographic fault-tolerant distributed computation",

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!",

author = "Michael Ben-Or and Shafi Goldwasser and Avi Wigderson",

year = "1988",

doi = "10.1145/62212.62213",

language = "American English",

isbn = "0897912640",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "1--10",

booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",

note = "20th Annual ACM Symposium on Theory of Computing, STOC 1988 ; Conference date: 02-05-1988 Through 04-05-1988",

}