| 2010 | SSS | A Fault-Resistant Asynchronous Clock Function. | Ezra N. Hoch, Michael Ben-Or, Danny Dolev |
| 2008 | FOCS | The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). | Michael Ben-Or, Avinatan Hassidim |
| 2008 | FOCS | Quantum Multi Prover Interactive Proofs with Communicating Provers. | Michael Ben-Or, Avinatan Hassidim, Haran Pilpel |
| 2008 | PODC | Fast self-stabilizing byzantine tolerant digital clock synchronization. | Michael Ben-Or, Danny Dolev, Ezra N. Hoch |
| 2006 | FOCS | Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. | Michael Ben-Or, Claude Crpeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith |
| 2006 | STOC | Byzantine agreement in the full-information model in O(log n) rounds. | Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan |
| 2005 | STOC | Fast quantum byzantine agreement. | Michael Ben-Or, Avinatan Hassidim |
| 2005 | TCC | The Universal Composable Security of Quantum Key Distribution. | Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim |
| 2000 | ASIACRYPT | Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. | Danny Gutfreund, Michael Ben-Or |
| 1998 | PODC | A Tight Lower Bound for Randomized Synchronous Consensus. | Ziv Bar-Joseph, Michael Ben-Or |
| 1997 | STOC | Fault-Tolerant Quantum Computation With Constant Error. | Dorit Aharonov, Michael Ben-Or |
| 1996 | FOCS | Polynomial Simulations of Decohered Quantum Computers. | Dorit Aharonov, Michael Ben-Or |
| 1994 | FOCS | Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) | Michael Ben-Or |
| 1994 | PODC | Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). | Michael Ben-Or, Boaz Kelmer, Tal Rabin |
| 1993 | STOC | Asynchronous secure computation. | Michael Ben-Or, Ran Canetti, Oded Goldreich |
| 1992 | STOC | Computing with Faulty Arrays | Yonatan Aumann, Michael Ben-Or |
| 1991 | FOCS | Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) | Yonatan Aumann, Michael Ben-Or |
| 1989 | CRYPTO | Efficient Identification Schemes Using Two Prover Interactive Proofs. | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson |
| 1989 | STOC | Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) | Tal Rabin, Michael Ben-Or |
| 1988 | CRYPTO | Everything Provable is Provable in Zero-Knowledge. | Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Hstad, Joe Kilian, Silvio Micali, Phillip Rogaway |
| 1988 | STOC | Computing Algebraic Formulas Using a Constant Number of Registers | Michael Ben-Or, Richard Cleve |
| 1988 | STOC | Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions | Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson |
| 1988 | STOC | Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) | Michael Ben-Or, Shafi Goldwasser, Avi Wigderson |
| 1988 | STOC | A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) | Michael Ben-Or, Prasoon Tiwari |
| 1986 | STOC | A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots | Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari |
| 1985 | FOCS | Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values | Michael Ben-Or, Nathan Linial |
| 1985 | ICALP | A Fair Protocol for Signing Contracts (Extended Abstract). | Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest |
| 1985 | PODC | Choice Coordination with Bounded Failure (a Preliminary Version). | Amotz Bar-Noy, Michael Ben-Or, Danny Dolev |
| 1985 | PODC | Fast Asynchronous Byzantine Agreement (Extended Abstract). | Michael Ben-Or |
| 1984 | STOC | A Theorem on Probabilistic Constant Depth Computations | Mikls Ajtai, Michael Ben-Or |
| 1984 | STOC | The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) | Michael Ben-Or, Dexter Kozen, John H. Reif |
| 1983 | PODC | Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). | Michael Ben-Or |
| 1983 | STOC | Lower Bounds for Algebraic Computation Trees (Preliminary Report) | Michael Ben-Or |
| 1983 | STOC | On the Cryptographic Security of Single RSA Bits | Michael Ben-Or, Benny Chor, Adi Shamir |
| 1981 | FOCS | Probabilistic Algorithms in Finite Fields | Michael Ben-Or |