# Completeness theorems for non-cryptographic fault-tolerant distributed computation

@inproceedings{BenOr1988CompletenessTF, title={Completeness theorems for non-cryptographic fault-tolerant distributed computation}, author={Michael Ben-Or and Shafi Goldwasser and Avi 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… Expand

#### Topics from this paper

#### 2,271 Citations

Optimal algorithms for Byzantine agreement

- Computer Science
- STOC '88
- 1988

For both synchronous and asynchronous networks whose lines do not guarantee private communication, the authors may use cryptography to obtain algorithms optimal both in fault tolerance and running time against computationally bounded adversaries. Expand

A zero-one law for Boolean privacy

- Mathematics, Computer Science
- STOC '89
- 1989

An interesting “zero-one” law for private distributed computation of Boolean functions is derived, which implies that for Boolean functions, the strong and the weak notions of privacy are equivalent. Expand

The round complexity of verifiable secret sharing and secure multicast

- Computer Science
- STOC '01
- 2001

This work studies the exact round complexity of two basic secure computation tasks: Verifiable Secret Sharing (VSS) and Secure Multicast, and proves tight tradeoffs between the round complexity and the achievable security threshold. Expand

Communication complexity of secure computation (extended abstract)

- Computer Science
- STOC '92
- 1992

This paper begins the investigation of the communication complexity of unconditionally secure multi-party computation, and its relation with various fault-tolerance models, and presents upper and lower bounds on communication, as well as tradeoffs among resources. Expand

Communication preserving protocols for secure function evaluation

- Computer Science
- STOC '01
- 2001

This work proposes a new methodology for designing secure protocols, utilizing the communication complexity tree (or branching program) representation of f, and exemplifies a protocol for the Millionaires problem, which is more efficient than previously known ones in either communication or computation. Expand

Efficient private bidding and auctions with an oblivious third party

- Computer Science
- CCS '99
- 1999

A novel and efficient protocol for bargaining between two parties and secure and efficient auctions in the absence of a fully trusted auction service is described, which combines homomorphic encryption with the φ-hiding assumption and which may be of independent interest. Expand

Randomized View Reconciliation in Permissionless Distributed Systems

- Computer Science
- IEEE/ACM Transactions on Networking
- 2020

This paper proposes a novel view reconciliation protocol whose time complexity is only <inline-formula> <tex-math notation="LaTeX">$\Theta ({\ln N}/{\ln \ln N})$ </tex- maths> time complexity, and aggressively exploit randomization. Expand

Simple and efficient asynchronous byzantine agreement with optimal resilience

- Computer Science
- PODC '09
- 2009

This work presents a new ABA protocol which achieves a huge gain in communication complexity in comparison to the ABA of [5], while keeping all other properties in place. Expand

Mutual search

- Computer Science
- SODA '98
- 1998

A search problem called “mutual search” where k agents, arbitrarily distributed over n sites, are required to locate one another by posing queries of the form “Anybody at site i?” is introduced. Expand

Non-cryptographic fault-tolerant computing in constant number of rounds of interaction

- Computer Science
- PODC '89
- 1989

Any function can be evaluated in a constant number of rounds, using messages of size proportional to the size of a constant-depth, unbounded-fanin circuit describing the function, and a means to simulate unbounded fanin multiplicative (or AND) gates using constant rounds is provided. Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

How to share a secret

- Computer Science
- CACM
- 1979

This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Expand

Polynomial algorithms for multiple processor agreement

- Computer Science
- STOC '82
- 1982

It is proved that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults. Expand

Reaching Agreement in the Presence of Faults

- Mathematics, Computer Science
- JACM
- 1980

It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods. Expand

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

- Computer Science
- 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
- 1986

This paper demonstrates the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff that efficiently demonstrate membership in the language without conveying any additional knowledge. Expand

How to Generate and Exchange Secrets (Extended Abstract)

- Computer Science
- FOCS
- 1986

A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature. Expand

How to play ANY mental game

- Mathematics, Computer Science
- STOC
- 1987

We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no… Expand

How to generate and exchange secrets

- 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
- 1986

In this paper we introduce a new tool for controlling the knowledge transfer process in cryptographic protocol design. It is applied to solve a general class of problems which include most of the… Expand

The knowledge complexity of interactive proof-systems

- Computer Science
- STOC '85
- 1985

Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage. rhe ACM copyright notice and the title of… Expand

Multiparty unconditionally secure protocols

- Computer Science
- STOC '88
- 1988

It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional. Expand

New directions in cryptography

- Computer Science
- IEEE Trans. Inf. Theory
- 1976

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. Expand