• Publications
  • Influence
Completeness theorems for non-cryptographic fault-tolerant distributed computation
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
Verifiable secret sharing and multiparty protocols with honest majority
A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest.
A deterministic algorithm for sparse multivariate polynomial interpolation
An efficient deterministic polynomial time algorithm is developed for the sparsePolynomial interpolation problem and has a simple NC implementation.
Fault-tolerant quantum computation with constant error
This paper shows how to perform fault tolerant quantum computation when the error probability, q, is smaller than some constant threshold, q.. the cost is polylogarithmic in time and space, and no measurements are used during the quantum computation.
Lower bounds for algebraic computation trees
  • M. Ben-Or
  • Computer Science, Mathematics
  • 1 December 1983
All the apparently known lower bounds for linear decision trees are extended to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20].
Multi-prover interactive proofs: how to remove intractability assumptions
It is proved that all NP languages have perfect zero-knowledge proof-systems in this model, without making any intractability assumptions, and its properties and applicability to cryptography are examined.
Collective Coin Flipping
Fault-Tolerant Quantum Computation with Constant Error Rate
This paper provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise, and shows that local noise is in principle not an obstacle for scalable quantum computation.