Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Completeness theorems for non-cryptographic fault-tolerant distributed computation

- M. Ben-Or, S. Goldwasser, A. Wigderson
- Mathematics, Computer ScienceSTOC '88
- 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… Expand

How to play ANY mental game

- Oded Goldreich, S. Micali, A. Wigderson
- Mathematics, Computer ScienceSTOC
- 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… Expand

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… Expand

How to play any mental game, or a completeness theorem for protocols with honest majority

- Oded Goldreich, S. Micali, A. Wigderson
- Computer Science, MathematicsProviding 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… Expand

Short proofs are narrow—resolution made simple

- E. Ben-Sasson, A. Wigderson
- Computer Science, MathematicsJACM
- 1 March 2001

TLDR

On span programs

- Mauricio Karchmer, A. Wigderson
- Mathematics, Computer Science[] Proceedings of the Eigth Annual Structure in…
- 18 May 1993

TLDR

Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)

- M. Ben-Or, S. Goldwasser, A. Wigderson
- Computer ScienceSTOC
- 1988

Hardness vs. randomness

- N. Nisan, A. Wigderson
- Mathematics, Computer Science[Proceedings ] 29th Annual Symposium on…
- 24 October 1988

TLDR

Hardness vs Randomness

- N. Nisan, A. Wigderson
- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 1 October 1994

P = BPP if E requires exponential circuits: derandomizing the XOR lemma

- R. Impagliazzo, A. Wigderson
- Mathematics, Computer ScienceSTOC '97
- 4 May 1997

TLDR

...

1

2

3

4

5

...