Michael Ben-Or

Publication Activity (10 Years)

Years Active: 1981-2022
Publications (10 Years): 3

Top Topics

Covariance Matrix

Spectral Analysis

Top Venues

SIAM J. Comput.

Publications

Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. Quantum 6 (2022)
Kfir Sulimany, Rom Dudkiewicz, Simcha Korenblit, Hagai S. Eisenberg, Yaron Bromberg, Michael Ben-Or
Fast and Simple One-Way High-Dimensional Quantum Key Distribution. CoRR (2021)
Michael Ben-Or, Lior Eldar
A Quasi-Random Approach to Matrix Spectral Analysis. ITCS (2018)
Michael Ben-Or, Lior Eldar
The Quasi-Random Perspective on Matrix Spectral Analysis with Applications. CoRR (2015)
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
Quantum Multiprover Interactive Proofs with Communicating Provers. SIAM J. Comput. 43 (3) (2014)
Michael Ben-Or, Danny Dolev, Ezra N. Hoch
Simple Gradecast Based Algorithms CoRR (2010)
Michael Ben-Or, Danny Dolev, Ezra N. Hoch
Brief Announcement: Simple Gradecast Based Algorithms. DISC (2010)
Dorit Aharonov, Michael Ben-Or, Elad Eban
Interactive Proofs For Quantum Computations. ICS (2010)
Ezra N. Hoch, Michael Ben-Or, Danny Dolev
A Fault-Resistant Asynchronous Clock Function. SSS (2010)
Ezra N. Hoch, Michael Ben-Or, Danny Dolev
A Fault-Resistant Asynchronous Clock Function CoRR (2010)
Michael Ben-Or, Avinatan Hassidim, Haran Pilpel
Quantum Multi Prover Interactive Proofs with Communicating Provers. FOCS (2008)
Dorit Aharonov, Michael Ben-Or
Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM J. Comput. 38 (4) (2008)
Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath
The Pursuit For Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. CoRR (2008)
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) (2008)
Michael Ben-Or, Danny Dolev, Ezra N. Hoch
Fast self-stabilizing byzantine tolerant digital clock synchronization. PODC (2008)
Michael Ben-Or, Avinatan Hassidim
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). FOCS (2008)
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam D. Smith
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. FOCS (2006)
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
Byzantine agreement in the full-information model in O(log n) rounds. STOC (2006)
Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim
The Universal Composable Security of Quantum Key Distribution. TCC (2005)
Michael Ben-Or, Avinatan Hassidim
Fast quantum byzantine agreement. STOC (2005)
Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. APPROX-RANDOM (2004)
Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions Electron. Colloquium Comput. Complex. (052) (2004)
Michael Ben-Or, Ran El-Yaniv
Resilient-optimal interactive consistency in constant time. Distributed Comput. 16 (4) (2003)
Michael Ben-Or, Danny Gutfreund
Trading Help for Interaction in Statistical Zero-Knowledge Proofs. J. Cryptol. 16 (2) (2003)
Danny Gutfreund, Michael Ben-Or
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. ASIACRYPT (2000)
Ziv Bar-Joseph, Michael Ben-Or
A Tight Lower Bound for Randomized Synchronous Consensus. PODC (1998)
Gadi Shamir, Michael Ben-Or, Danny Dolev
BARTER: A Backbone Architecture for Trade of Electronic Content. Trends in Distributed Systems for Electronic Commerce (1998)
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) (1998)
Dorit Aharonov, Michael Ben-Or
Fault-Tolerant Quantum Computation With Constant Error. STOC (1997)
Dorit Aharonov, Michael Ben-Or
Polynomial Simulations of Decohered Quantum Computers. FOCS (1996)
Michael Ben-Or, Dana Ron
Agreement in the Presence of Faults, on Networks of Bounded Degree. Inf. Process. Lett. 57 (6) (1996)
Michael Ben-Or, Boaz Kelmer, Tal Rabin
Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). PODC (1994)
Michael Ben-Or
Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) FOCS (1994)
Michael Ben-Or, Ran Canetti, Oded Goldreich
Asynchronous secure computation. STOC (1993)
Yonatan Aumann, Michael Ben-Or
Computing with Faulty Arrays STOC (1992)
Michael Ben-Or, Richard Cleve
Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21 (1) (1992)
Yonatan Aumann, Michael Ben-Or
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) FOCS (1991)
Michael Ben-Or, Prasoon Tiwari
Simple algorithms for approximating all roots of a polynomial with real roots. J. Complex. 6 (4) (1990)
Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36 (1) (1990)
Tal Rabin, Michael Ben-Or
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) STOC (1989)
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO (1989)
Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
Choice Coordination with Limited Failure. Distributed Comput. 3 (2) (1989)
Michael Ben-Or, Nathan Linial
Collective Coin Flipping. Adv. Comput. Res. 5 (1989)
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)
Michael Ben-Or, Prasoon Tiwari
A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) STOC (1988)
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) (1988)
Michael Ben-Or, Richard Cleve
Computing Algebraic Formulas Using a Constant Number of Registers STOC (1988)
Michael Ben-Or, Shafi Goldwasser, Avi Wigderson
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) STOC (1988)
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions STOC (1988)
Michael Ben-Or
Randomized Agreement Protocols. Fault-Tolerant Distributed Computing (1986)
Michael Ben-Or, Dexter Kozen, John H. Reif
The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32 (2) (1986)
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)
Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
A Fair Protocol for Signing Contracts (Extended Abstract). ICALP (1985)
Michael Ben-Or
Fast Asynchronous Byzantine Agreement (Extended Abstract). PODC (1985)
Michael Ben-Or, Nathan Linial
Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values FOCS (1985)
Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
Choice Coordination with Bounded Failure (a Preliminary Version). PODC (1985)
Michael Ben-Or, Dexter Kozen, John H. Reif
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) STOC (1984)
Miklós Ajtai, Michael Ben-Or
A Theorem on Probabilistic Constant Depth Computations STOC (1984)
Michael Ben-Or
Lower Bounds for Algebraic Computation Trees (Preliminary Report) STOC (1983)
Michael Ben-Or
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). PODC (1983)
Michael Ben-Or, Benny Chor, Adi Shamir
On the Cryptographic Security of Single RSA Bits STOC (1983)
Michael Ben-Or
Probabilistic Algorithms in Finite Fields FOCS (1981)