Michael Ben-Or

According to our database, Michael Ben-Or authored at least 59 papers between 1981 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

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

2021

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

2019

Completeness theorems for non-cryptographic fault-tolerant distributed computation.

Michael Ben-Or, Shafi Goldwasser, Avi Wigderson

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

Multi-prover interactive proofs: how to remove intractability assumptions.

Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018

A Quasi-Random Approach to Matrix Spectral Analysis.

Michael Ben-Or, Lior Eldar

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2015

The Quasi-Random Perspective on Matrix Spectral Analysis with Applications.

Michael Ben-Or, Lior Eldar

CoRR, 2015

2014

Quantum Multiprover Interactive Proofs with Communicating Provers.

Michael Ben-Or, Avinatan Hassidim, Haran Pilpel

SIAM J. Comput., 2014

2010

Simple Gradecast Based Algorithms

Michael Ben-Or, Danny Dolev, Ezra N. Hoch

CoRR, 2010

Brief Announcement: Simple Gradecast Based Algorithms.

Michael Ben-Or, Danny Dolev, Ezra N. Hoch

Proceedings of the Distributed Computing, 24th International Symposium, 2010

A Fault-Resistant Asynchronous Clock Function.

Ezra N. Hoch, Michael Ben-Or, Danny Dolev

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Interactive Proofs For Quantum Computations.

Dorit Aharonov, Michael Ben-Or, Elad Eban

Proceedings of the Innovations in Computer Science, 2010

2008

Fault-Tolerant Quantum Computation with Constant Error Rate.

Dorit Aharonov, Michael Ben-Or

SIAM J. Comput., 2008

Fast self-stabilizing byzantine tolerant digital clock synchronization.

Michael Ben-Or, Danny Dolev, Ezra N. Hoch

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Quantum Multi Prover Interactive Proofs with Communicating Provers.

Michael Ben-Or, Avinatan Hassidim, Haran Pilpel

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well).

Michael Ben-Or, Avinatan Hassidim

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006

Byzantine agreement in the full-information model in O(log n) rounds.

Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority.

Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

The Universal Composable Security of Quantum Key Distribution.

Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Fast quantum byzantine agreement.

Michael Ben-Or, Avinatan Hassidim

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

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

2003

Trading Help for Interaction in Statistical Zero-Knowledge Proofs.

Michael Ben-Or, Danny Gutfreund

J. Cryptol., 2003

Resilient-optimal interactive consistency in constant time.

Michael Ben-Or, Ran El-Yaniv

Distributed Comput., 2003

2000

Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems.

Danny Gutfreund, Michael Ben-Or

Proceedings of the Advances in Cryptology, 2000

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

A Tight Lower Bound for Randomized Synchronous Consensus.

Ziv Bar-Joseph, Michael Ben-Or

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

BARTER: A Backbone Architecture for Trade of Electronic Content.

Gadi Shamir, Michael Ben-Or, Danny Dolev

Proceedings of the Trends in Distributed Systems for Electronic Commerce, 1998

1997

Fault-Tolerant Quantum Computation With Constant Error.

Dorit Aharonov, Michael Ben-Or

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Agreement in the Presence of Faults, on Networks of Bounded Degree.

Michael Ben-Or, Dana Ron

Inf. Process. Lett., 1996

Polynomial Simulations of Decohered Quantum Computers.

Dorit Aharonov, Michael Ben-Or

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1994

Asynchronous Secure Computations with Optimal Resilience (Extended Abstract).

Michael Ben-Or, Boaz Kelmer, Tal Rabin

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Algebraic Computation Trees in Characteristi p>0 (Extended Abstract)

Michael Ben-Or

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Asynchronous secure computation.

Michael Ben-Or, Ran Canetti, Oded Goldreich

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Computing Algebraic Formulas Using a Constant Number of Registers.

Michael Ben-Or, Richard Cleve

SIAM J. Comput., 1992

Computing with Faulty Arrays

Yonatan Aumann, Michael Ben-Or

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991

Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)

Yonatan Aumann, Michael Ben-Or

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

A fair protocol for signing contracts.

Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest

IEEE Trans. Inf. Theory, 1990

Simple algorithms for approximating all roots of a polynomial with real roots.

Michael Ben-Or, Prasoon Tiwari

J. Complex., 1990

1989

Choice Coordination with Limited Failure.

Amotz Bar-Noy, Michael Ben-Or, Danny Dolev

Distributed Comput., 1989

Collective Coin Flipping.

Michael Ben-Or, Nathan Linial

Adv. Comput. Res., 1989

Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)

Tal Rabin, Michael Ben-Or

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Efficient Identification Schemes Using Two Prover Interactive Proofs.

Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson

Proceedings of the Advances in Cryptology, 1989

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

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)

Michael Ben-Or, Prasoon Tiwari

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

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

Michael Ben-Or, Shafi Goldwasser, Avi Wigderson

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions

Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Everything Provable is Provable in Zero-Knowledge.

Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway

Proceedings of the Advances in Cryptology, 1988

1986

The Complexity of Elementary Algebra and Geometry.

Michael Ben-Or, Dexter Kozen, John H. Reif

J. Comput. Syst. Sci., 1986

Randomized Agreement Protocols.

Michael Ben-Or

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1985

Fast Asynchronous Byzantine Agreement (Extended Abstract).

Michael Ben-Or

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Choice Coordination with Bounded Failure (a Preliminary Version).

Amotz Bar-Noy, Michael Ben-Or, Danny Dolev

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

A Fair Protocol for Signing Contracts (Extended Abstract).

Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest

Proceedings of the Automata, 1985

Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values

Michael Ben-Or, Nathan Linial

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)

Michael Ben-Or, Dexter Kozen, John H. Reif

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A Theorem on Probabilistic Constant Depth Computations

Miklós Ajtai, Michael Ben-Or

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

On the Cryptographic Security of Single RSA Bits

Michael Ben-Or, Benny Chor, Adi Shamir

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Lower Bounds for Algebraic Computation Trees (Preliminary Report)

Michael Ben-Or

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract).

Michael Ben-Or

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

1981

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

Michael Ben-Or

PhD thesis, 1981

Probabilistic Algorithms in Finite Fields

Michael Ben-Or

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981