Michael Ben-Or

66 papers A* 32A 4B 1C 1Journal 22Unranked 3

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