| 2008 |
|---|
| 50 | EE | Michael Ben-Or,
Avinatan Hassidim:
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well).
FOCS 2008: 221-230 |
| 49 | EE | Michael Ben-Or,
Avinatan Hassidim,
Haran Pilpel:
Quantum Multi Prover Interactive Proofs with Communicating Provers.
FOCS 2008: 467-476 |
| 48 | EE | Michael Ben-Or,
Danny Dolev,
Ezra N. Hoch:
Fast self-stabilizing byzantine tolerant digital clock synchronization.
PODC 2008: 385-394 |
| 47 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions.
Random Struct. Algorithms 32(1): 49-70 (2008) |
| 46 | EE | Dorit Aharonov,
Michael Ben-Or:
Fault-Tolerant Quantum Computation with Constant Error Rate.
SIAM J. Comput. 38(4): 1207-1282 (2008) |
| 2006 |
|---|
| 45 | EE | Michael Ben-Or,
Claude Crépeau,
Daniel Gottesman,
Avinatan Hassidim,
Adam Smith:
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.
FOCS 2006: 249-260 |
| 44 | EE | Michael Ben-Or,
Elan Pavlov,
Vinod Vaikuntanathan:
Byzantine agreement in the full-information model in O(log n) rounds.
STOC 2006: 179-186 |
| 2005 |
|---|
| 43 | EE | Michael Ben-Or,
Avinatan Hassidim:
Fast quantum byzantine agreement.
STOC 2005: 481-485 |
| 42 | EE | Michael Ben-Or,
Michal Horodecki,
Debbie W. Leung,
Dominic Mayers,
Jonathan Oppenheim:
The Universal Composable Security of Quantum Key Distribution.
TCC 2005: 386-406 |
| 2004 |
|---|
| 41 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.
APPROX-RANDOM 2004: 273-285 |
| 40 | EE | Michael Ben-Or,
Don Coppersmith,
Michael Luby,
Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions
Electronic Colloquium on Computational Complexity (ECCC)(052): (2004) |
| 2003 |
|---|
| 39 | EE | Michael Ben-Or,
Ran El-Yaniv:
Resilient-optimal interactive consistency in constant time.
Distributed Computing 16(4): 249-262 (2003) |
| 38 | EE | Michael Ben-Or,
Danny Gutfreund:
Trading Help for Interaction in Statistical Zero-Knowledge Proofs.
J. Cryptology 16(2): 95-116 (2003) |
| 2000 |
|---|
| 37 | EE | Danny Gutfreund,
Michael Ben-Or:
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems.
ASIACRYPT 2000: 429-442 |
| 1998 |
|---|
| 36 | EE | Ziv Bar-Joseph,
Michael Ben-Or:
A Tight Lower Bound for Randomized Synchronous Consensus.
PODC 1998: 193-199 |
| 35 | EE | Gadi Shamir,
Michael Ben-Or,
Danny Dolev:
BARTER: A Backbone Architecture for Trade of Electronic Content.
Trends in Distributed Systems for Electronic Commerce 1998: 65-79 |
| 34 | | Gadi Shamir,
Michael Ben-Or,
Danny Dolev:
A Safe and Scalable Payment Infrastructure for Trade of Electronic Content.
Int. J. Cooperative Inf. Syst. 7(4): 331-354 (1998) |
| 1997 |
|---|
| 33 | EE | Dorit Aharonov,
Michael Ben-Or:
Fault-Tolerant Quantum Computation With Constant Error.
STOC 1997: 176-188 |
| 1996 |
|---|
| 32 | | Dorit Aharonov,
Michael Ben-Or:
Polynomial Simulations of Decohered Quantum Computers.
FOCS 1996: 46-55 |
| 31 | EE | Michael Ben-Or,
Dana Ron:
Agreement in the Presence of Faults, on Networks of Bounded Degree.
Inf. Process. Lett. 57(6): 329-334 (1996) |
| 1994 |
|---|
| 30 | | Michael Ben-Or:
Algebraic Computation Trees in Characteristi p>0 (Extended Abstract)
FOCS 1994: 534-539 |
| 29 | | Michael Ben-Or,
Boaz Kelmer,
Tal Rabin:
Asynchronous Secure Computations with Optimal Resilience (Extended Abstract).
PODC 1994: 183-192 |
| 1993 |
|---|
| 28 | EE | Michael Ben-Or,
Ran Canetti,
Oded Goldreich:
Asynchronous secure computation.
STOC 1993: 52-61 |
| 1992 |
|---|
| 27 | | Yonatan Aumann,
Michael Ben-Or:
Computing with Faulty Arrays
STOC 1992: 162-169 |
| 26 | | Michael Ben-Or,
Richard Cleve:
Computing Algebraic Formulas Using a Constant Number of Registers.
SIAM J. Comput. 21(1): 54-58 (1992) |
| 1991 |
|---|
| 25 | | Yonatan Aumann,
Michael Ben-Or:
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)
FOCS 1991: 440-446 |
| 1990 |
|---|
| 24 | | Michael Ben-Or,
Oded Goldreich,
Silvio Micali,
Ronald L. Rivest:
A fair protocol for signing contracts.
IEEE Transactions on Information Theory 36(1): 40-46 (1990) |
| 23 | EE | Michael Ben-Or,
Prasoon Tiwari:
Simple algorithms for approximating all roots of a polynomial with real roots.
J. Complexity 6(4): 417-442 (1990) |
| 1989 |
|---|
| 22 | EE | Michael Ben-Or,
Shafi Goldwasser,
Joe Kilian,
Avi Wigderson:
Efficient Identification Schemes Using Two Prover Interactive Proofs.
CRYPTO 1989: 498-506 |
| 21 | | Tal Rabin,
Michael Ben-Or:
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)
STOC 1989: 73-85 |
| 20 | | Amotz Bar-Noy,
Michael Ben-Or,
Danny Dolev:
Choice Coordination with Limited Failure.
Distributed Computing 3(2): 61-72 (1989) |
| 1988 |
|---|
| 19 | EE | Michael Ben-Or,
Oded Goldreich,
Shafi Goldwasser,
Johan Håstad,
Joe Kilian,
Silvio Micali,
Phillip Rogaway:
Everything Provable is Provable in Zero-Knowledge.
CRYPTO 1988: 37-56 |
| 18 | | Michael Ben-Or,
Shafi Goldwasser,
Avi Wigderson:
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
STOC 1988: 1-10 |
| 17 | | Michael Ben-Or,
Shafi Goldwasser,
Joe Kilian,
Avi Wigderson:
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions
STOC 1988: 113-131 |
| 16 | | Michael Ben-Or,
Richard Cleve:
Computing Algebraic Formulas Using a Constant Number of Registers
STOC 1988: 254-257 |
| 15 | | Michael Ben-Or,
Prasoon Tiwari:
A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)
STOC 1988: 301-309 |
| 14 | | Michael Ben-Or,
Ephraim Feig,
Dexter Kozen,
Prasoon Tiwari:
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots.
SIAM J. Comput. 17(6): 1081-1092 (1988) |
| 1986 |
|---|
| 13 | | Michael Ben-Or:
Randomized Agreement Protocols.
Fault-Tolerant Distributed Computing 1986: 72-83 |
| 12 | | Michael Ben-Or,
Ephraim Feig,
Dexter Kozen,
Prasoon Tiwari:
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
STOC 1986: 340-349 |
| 11 | | Michael Ben-Or,
Dexter Kozen,
John H. Reif:
The Complexity of Elementary Algebra and Geometry.
J. Comput. Syst. Sci. 32(2): 251-264 (1986) |
| 1985 |
|---|
| 10 | | Michael Ben-Or,
Nathan Linial:
Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values
FOCS 1985: 408-416 |
| 9 | | Michael Ben-Or,
Oded Goldreich,
Silvio Micali,
Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract).
ICALP 1985: 43-52 |
| 8 | | Michael Ben-Or:
Fast Asynchronous Byzantine Agreement (Extended Abstract).
PODC 1985: 149-151 |
| 7 | | Amotz Bar-Noy,
Michael Ben-Or,
Danny Dolev:
Choice Coordination with Bounded Failure (a Preliminary Version).
PODC 1985: 309-316 |
| 1984 |
|---|
| 6 | | Michael Ben-Or,
Dexter Kozen,
John H. Reif:
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)
STOC 1984: 457-464 |
| 5 | | Miklós Ajtai,
Michael Ben-Or:
A Theorem on Probabilistic Constant Depth Computations
STOC 1984: 471-474 |
| 1983 |
|---|
| 4 | | Michael Ben-Or:
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract).
PODC 1983: 27-30 |
| 3 | | Michael Ben-Or,
Benny Chor,
Adi Shamir:
On the Cryptographic Security of Single RSA Bits
STOC 1983: 421-430 |
| 2 | | Michael Ben-Or:
Lower Bounds for Algebraic Computation Trees (Preliminary Report)
STOC 1983: 80-86 |
| 1981 |
|---|
| 1 | | Michael Ben-Or:
Probabilistic Algorithms in Finite Fields
FOCS 1981: 394-398 |
