Probabilistic Algorithms in Finite Fields - Michael Ben-Or (FOCS, 1981)

אלגוריתמים הסתברותיים בשדות סופיים (Probabilistic algorithms in finite fields.). - Michael Ben-Or (1981)

Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). - Michael Ben-Or (PODC, 1983)

Lower Bounds for Algebraic Computation Trees (Preliminary Report) - Michael Ben-Or (STOC, 1983)

On the Cryptographic Security of Single RSA Bits - Michael Ben-Or; Benny Chor; Adi Shamir (STOC, 1983)

A Theorem on Probabilistic Constant Depth Computations - Miklós Ajtai; Michael Ben-Or (STOC, 1984)

The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) - Michael Ben-Or; Dexter Kozen; John H. Reif (STOC, 1984)

Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values - Michael Ben-Or; Nathan Linial (FOCS, 1985)

A Fair Protocol for Signing Contracts (Extended Abstract). - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (ICALP, 1985)

Choice Coordination with Bounded Failure (a Preliminary Version). - Amotz Bar-Noy; Michael Ben-Or; Danny Dolev (PODC, 1985)

Fast Asynchronous Byzantine Agreement (Extended Abstract). - Michael Ben-Or (PODC, 1985)

Randomized Agreement Protocols. - Michael Ben-Or (Fault-Tolerant Distributed Computing, 1986)

The Complexity of Elementary Algebra and Geometry. - Michael Ben-Or; Dexter Kozen; John H. Reif (J. Comput. Syst. Sci., 1986)

Everything Provable is Provable in Zero-Knowledge. - Michael Ben-Or; Oded Goldreich 001; Shafi Goldwasser; Johan Håstad; Joe Kilian; Silvio Micali; Phillip Rogaway (CRYPTO, 1988)

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (STOC, 1988)

Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) - Michael Ben-Or; Shafi Goldwasser; Avi Wigderson (STOC, 1988)

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) - Michael Ben-Or; Prasoon Tiwari (STOC, 1988)

A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. - Michael Ben-Or; Ephraim Feig; Dexter Kozen; Prasoon Tiwari (SIAM J. Comput., 1988)

Efficient Identification Schemes Using Two Prover Interactive Proofs. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (CRYPTO, 1989)

Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) - Tal Rabin; Michael Ben-Or (STOC, 1989)

Collective Coin Flipping. - Michael Ben-Or; Nathan Linial (Adv. Comput. Res., 1989)

Choice Coordination with Limited Failure. - Amotz Bar-Noy; Michael Ben-Or; Danny Dolev (Distributed Comput., 1989)

Simple algorithms for approximating all roots of a polynomial with real roots. - Michael Ben-Or; Prasoon Tiwari (J. Complex., 1990)

A fair protocol for signing contracts. - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (IEEE Trans. Inf. Theory, 1990)

Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) - Yonatan Aumann; Michael Ben-Or (FOCS, 1991)

Computing with Faulty Arrays - Yonatan Aumann; Michael Ben-Or (STOC, 1992)

Computing Algebraic Formulas Using a Constant Number of Registers. - Michael Ben-Or; Richard Cleve (SIAM J. Comput., 1992)

Asynchronous secure computation. - Michael Ben-Or; Ran Canetti; Oded Goldreich 001 (STOC, 1993)

Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) - Michael Ben-Or (FOCS, 1994)

Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). - Michael Ben-Or; Boaz Kelmer; Tal Rabin (PODC, 1994)

Polynomial Simulations of Decohered Quantum Computers. - Dorit Aharonov; Michael Ben-Or (FOCS, 1996)

Agreement in the Presence of Faults, on Networks of Bounded Degree. - Michael Ben-Or; Dana Ron (Inf. Process. Lett., 1996)

Fault-Tolerant Quantum Computation With Constant Error. - Dorit Aharonov; Michael Ben-Or (STOC, 1997)

BARTER: A Backbone Architecture for Trade of Electronic Content. - Gadi Shamir; Michael Ben-Or; Danny Dolev (Trends in Distributed Systems for Electronic Commerce, 1998)

A Tight Lower Bound for Randomized Synchronous Consensus. - Ziv Bar-Joseph; Michael Ben-Or (PODC, 1998)

A Safe and Scalable Payment Infrastructure for Trade of Electronic Content. - Gadi Shamir; Michael Ben-Or; Danny Dolev (Int. J. Cooperative Inf. Syst., 1998)

Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. - Danny Gutfreund; Michael Ben-Or (ASIACRYPT, 2000)

Resilient-optimal interactive consistency in constant time. - Michael Ben-Or; Ran El-Yaniv (Distributed Comput., 2003)

Trading Help for Interaction in Statistical Zero-Knowledge Proofs. - Michael Ben-Or; Danny Gutfreund (J. Cryptol., 2003)

Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions - Michael Ben-Or; Don Coppersmith; Michael Luby; Ronitt Rubinfeld (Electron. Colloquium Comput. Complex., 2004)

Fast quantum byzantine agreement. - Michael Ben-Or; Avinatan Hassidim (STOC, 2005)

The Universal Composable Security of Quantum Key Distribution. - Michael Ben-Or; Michal Horodecki; Debbie W. Leung; Dominic Mayers; Jonathan Oppenheim (TCC, 2005)

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. - Michael Ben-Or; Claude Crépeau; Daniel Gottesman; Avinatan Hassidim; Adam D. Smith 001 (FOCS, 2006)

Byzantine agreement in the full-information model in O(log n) rounds. - Michael Ben-Or; Elan Pavlov; Vinod Vaikuntanathan (STOC, 2006)

The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). - Michael Ben-Or; Avinatan Hassidim (FOCS, 2008)

Quantum Multi Prover Interactive Proofs with Communicating Provers. - Michael Ben-Or; Avinatan Hassidim; Haran Pilpel (FOCS, 2008)

Fast self-stabilizing byzantine tolerant digital clock synchronization. - Michael Ben-Or; Danny Dolev; Ezra N. Hoch (PODC, 2008)

Fault-Tolerant Quantum Computation with Constant Error Rate. - Dorit Aharonov; Michael Ben-Or (SIAM J. Comput., 2008)

Interactive Proofs For Quantum Computations. - Dorit Aharonov; Michael Ben-Or; Elad Eban (ICS, 2010)

A Fault-Resistant Asynchronous Clock Function. - Ezra N. Hoch; Michael Ben-Or; Danny Dolev (SSS, 2010)

Brief Announcement: Simple Gradecast Based Algorithms. - Michael Ben-Or; Danny Dolev; Ezra N. Hoch (DISC, 2010)

Simple Gradecast Based Algorithms - Michael Ben-Or; Danny Dolev; Ezra N. Hoch (CoRR, 2010)

Quantum Multiprover Interactive Proofs with Communicating Provers. - Michael Ben-Or; Avinatan Hassidim; Haran Pilpel (SIAM J. Comput., 2014)

The Quasi-Random Perspective on Matrix Spectral Analysis with Applications. - Michael Ben-Or; Lior Eldar (CoRR, 2015)

A Quasi-Random Approach to Matrix Spectral Analysis. - Michael Ben-Or; Lior Eldar (ITCS, 2018)

Multi-prover interactive proofs: how to remove intractability assumptions. - Michael Ben-Or; Shafi Goldwasser; Joe Kilian; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Completeness theorems for non-cryptographic fault-tolerant distributed computation. - Michael Ben-Or; Shafi Goldwasser; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Fast and Simple One-Way High-Dimensional Quantum Key Distribution. - Kfir Sulimany; Rom Dudkiewicz; Simcha Korenblit; Hagai S. Eisenberg; Yaron Bromberg; Michael Ben-Or (CoRR, 2021)

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. - Dorit Aharonov; Michael Ben-Or; Fernando G. S. L. Brandão; Or Sattath (Quantum, 2022)