Completeness theorems for non-cryptographic fault-tolerant distributed computation
@inproceedings{BenOr1988CompletenessTF, title={Completeness theorems for non-cryptographic fault-tolerant distributed computation}, author={M. Ben-Or and S. Goldwasser and A. Wigderson}, booktitle={STOC '88}, year={1988} }
Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of size <italic>t</italic> < <italic>n</italic>/2 of players gets any additional information (other than the function value),
</item><item>Even if Byzantine faults are allowed, no set of size <italic>t</italic> < <italic>n</italic>/3 can either disrupt the computation or get additional information.
</item></list… CONTINUE READING
Supplemental Presentations
Topics from this paper
2,180 Citations
The round complexity of verifiable secret sharing and secure multicast
- Computer Science
- STOC '01
- 2001
- 129
Efficient private bidding and auctions with an oblivious third party
- Computer Science
- CCS '99
- 1999
- 297
- PDF
Randomized View Reconciliation in Permissionless Distributed Systems
- Computer Science
- IEEE/ACM Transactions on Networking
- 2020
- 1
- PDF
Simple and efficient asynchronous byzantine agreement with optimal resilience
- Computer Science
- PODC '09
- 2009
- 25
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
- Computer Science
- PODC '89
- 1989
- 280