Completeness theorems for non-cryptographic fault-tolerant distributed computation
- M. Ben-Or, S. Goldwasser, A. Wigderson
- Computer ScienceSymposium on the Theory of Computing
- 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…
How to play ANY mental game
- Oded Goldreich, S. Micali, A. Wigderson
- Computer Science, MathematicsSymposium on the Theory of Computing
- 1 January 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…
How to play any mental game, or a completeness theorem for protocols with honest majority
- Oded Goldreich, S. Micali, A. Wigderson
- Computer ScienceProviding Sound Foundations for Cryptography
- 2019
Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of…
Hardness vs Randomness
- N. Nisan, A. Wigderson
- Computer Science, MathematicsJournal of computer and system sciences (Print)
- 1 October 1994
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Oded Goldreich, S. Micali, A. Wigderson
- Computer Science, MathematicsJACM
- 1 July 1991
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs…
Short proofs are narrow-resolution made simple
- Eli Ben-Sasson, A. Wigderson
- Computer ScienceProceedings. Fourteenth Annual IEEE Conference on…
- 4 May 1999
We develop a general strategy for proving width lower bounds, which follows Haken's original proof technique but is now simple and clear. It reveals that large width is implied by certain natural…
On span programs
- Mauricio Karchmer, A. Wigderson
- Computer Science, Mathematics[] Proceedings of the Eigth Annual Structure in…
- 18 May 1993
A linear algebraic model of computation the span program, a variant of Razborov's general approximation method, is introduced, and several upper and lower bounds on it are proved.
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
- M. Ben-Or, S. Goldwasser, A. Wigderson
- Computer ScienceSymposium on the Theory of Computing
- 1988
Monotone circuits for connectivity require super-logarithmic depth
- Mauricio Karchmer, A. Wigderson
- MathematicsSymposium on the Theory of Computing
- 1 May 1990
It is proved that every monotone circuit which tests st-connectivity of an undirected graph on n nodes has depth and this implies a superpolynomial lower bound on the size of any monotones formula for st-Connectivity.
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
- R. Impagliazzo, A. Wigderson
- MathematicsSymposium on the Theory of Computing
- 4 May 1997
A pseudo-random generator which produces n instances of a problem for which the analog of the XOR lemma holds is given, and it is shown that if any problem in E = DTIAl E(2°t”j) has circuit complexity 2Q(”), then P = BPP.
...
...