default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Ben-Or
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
- award (2015): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]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: 668 (2022)- 2021
- [i6]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 abs/2105.04733 (2021)
2010 – 2019
- 2019
- [p2]Michael Ben-Or, Shafi Goldwasser, Avi Wigderson:
Completeness theorems for non-cryptographic fault-tolerant distributed computation. Providing Sound Foundations for Cryptography 2019: 351-371 - [p1]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-prover interactive proofs: how to remove intractability assumptions. Providing Sound Foundations for Cryptography 2019: 373-410 - 2018
- [c41]Michael Ben-Or
, Lior Eldar:
A Quasi-Random Approach to Matrix Spectral Analysis. ITCS 2018: 6:1-6:22 - 2015
- [i5]Michael Ben-Or, Lior Eldar:
The Quasi-Random Perspective on Matrix Spectral Analysis with Applications. CoRR abs/1505.08126 (2015) - 2014
- [j14]Michael Ben-Or, Avinatan Hassidim, Haran Pilpel:
Quantum Multiprover Interactive Proofs with Communicating Provers. SIAM J. Comput. 43(3): 987-1011 (2014) - 2010
- [c40]Dorit Aharonov, Michael Ben-Or, Elad Eban:
Interactive Proofs For Quantum Computations. ICS 2010: 453-469 - [c39]Ezra N. Hoch, Michael Ben-Or, Danny Dolev:
A Fault-Resistant Asynchronous Clock Function. SSS 2010: 19-34 - [c38]Michael Ben-Or, Danny Dolev, Ezra N. Hoch:
Brief Announcement: Simple Gradecast Based Algorithms. DISC 2010: 194-197 - [i4]Michael Ben-Or, Danny Dolev, Ezra N. Hoch:
Simple Gradecast Based Algorithms. CoRR abs/1007.1049 (2010) - [i3]Ezra N. Hoch, Michael Ben-Or, Danny Dolev:
A Fault-Resistant Asynchronous Clock Function. CoRR abs/1007.1709 (2010)
2000 – 2009
- 2008
- [j13]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): 49-70 (2008) - [j12]Dorit Aharonov, Michael Ben-Or:
Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM J. Comput. 38(4): 1207-1282 (2008) - [c37]Michael Ben-Or, Avinatan Hassidim:
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). FOCS 2008: 221-230 - [c36]Michael Ben-Or, Avinatan Hassidim, Haran Pilpel:
Quantum Multi Prover Interactive Proofs with Communicating Provers. FOCS 2008: 467-476 - [c35]Michael Ben-Or, Danny Dolev, Ezra N. Hoch:
Fast self-stabilizing byzantine tolerant digital clock synchronization. PODC 2008: 385-394 - [i2]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 abs/0810.4840 (2008) - 2006
- [c34]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: 249-260 - [c33]Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan:
Byzantine agreement in the full-information model in O(log n) rounds. STOC 2006: 179-186 - 2005
- [c32]Michael Ben-Or, Avinatan Hassidim:
Fast quantum byzantine agreement. STOC 2005: 481-485 - [c31]Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim:
The Universal Composable Security of Quantum Key Distribution. TCC 2005: 386-406 - 2004
- [c30]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. APPROX-RANDOM 2004: 273-285 - [i1]Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j11]Michael Ben-Or, Ran El-Yaniv:
Resilient-optimal interactive consistency in constant time. Distributed Comput. 16(4): 249-262 (2003) - [j10]Michael Ben-Or, Danny Gutfreund:
Trading Help for Interaction in Statistical Zero-Knowledge Proofs. J. Cryptol. 16(2): 95-116 (2003) - 2000
- [c29]Danny Gutfreund, Michael Ben-Or:
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. ASIACRYPT 2000: 429-442
1990 – 1999
- 1998
- [j9]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): 331-354 (1998) - [c28]Gadi Shamir, Michael Ben-Or, Danny Dolev:
BARTER: A Backbone Architecture for Trade of Electronic Content. Trends in Distributed Systems for Electronic Commerce 1998: 65-79 - [c27]Ziv Bar-Joseph, Michael Ben-Or:
A Tight Lower Bound for Randomized Synchronous Consensus. PODC 1998: 193-199 - 1997
- [c26]Dorit Aharonov, Michael Ben-Or:
Fault-Tolerant Quantum Computation With Constant Error. STOC 1997: 176-188 - 1996
- [j8]Michael Ben-Or, Dana Ron:
Agreement in the Presence of Faults, on Networks of Bounded Degree. Inf. Process. Lett. 57(6): 329-334 (1996) - [c25]Dorit Aharonov, Michael Ben-Or:
Polynomial Simulations of Decohered Quantum Computers. FOCS 1996: 46-55 - 1994
- [c24]Michael Ben-Or:
Algebraic Computation Trees in Characteristi p>0 (Extended Abstract). FOCS 1994: 534-539 - [c23]Michael Ben-Or, Boaz Kelmer, Tal Rabin:
Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). PODC 1994: 183-192 - 1993
- [c22]Michael Ben-Or, Ran Canetti, Oded Goldreich:
Asynchronous secure computation. STOC 1993: 52-61 - 1992
- [j7]Michael Ben-Or, Richard Cleve:
Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1): 54-58 (1992) - [c21]Yonatan Aumann, Michael Ben-Or:
Computing with Faulty Arrays. STOC 1992: 162-169 - 1991
- [c20]Yonatan Aumann, Michael Ben-Or:
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract). FOCS 1991: 440-446 - 1990
- [j6]Michael Ben-Or, Prasoon Tiwari:
Simple algorithms for approximating all roots of a polynomial with real roots. J. Complex. 6(4): 417-442 (1990) - [j5]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36(1): 40-46 (1990)
1980 – 1989
- 1989
- [j4]Michael Ben-Or, Nathan Linial:
Collective Coin Flipping. Adv. Comput. Res. 5: 91-115 (1989) - [j3]Amotz Bar-Noy, Michael Ben-Or, Danny Dolev:
Choice Coordination with Limited Failure. Distributed Comput. 3(2): 61-72 (1989) - [c19]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO 1989: 498-506 - [c18]Tal Rabin, Michael Ben-Or:
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). STOC 1989: 73-85 - 1988
- [j2]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): 1081-1092 (1988) - [c17]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: 37-56 - [c16]Michael Ben-Or, Shafi Goldwasser, Avi Wigderson:
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). STOC 1988: 1-10 - [c15]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 1988: 113-131 - [c14]Michael Ben-Or, Richard Cleve:
Computing Algebraic Formulas Using a Constant Number of Registers. STOC 1988: 254-257 - [c13]Michael Ben-Or, Prasoon Tiwari:
A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). STOC 1988: 301-309 - 1986
- [j1]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry. J. Comput. Syst. Sci. 32(2): 251-264 (1986) - [c12]Michael Ben-Or:
Randomized Agreement Protocols. Fault-Tolerant Distributed Computing 1986: 72-83 - [c11]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: 340-349 - 1985
- [c10]Michael Ben-Or, Nathan Linial:
Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values. FOCS 1985: 408-416 - [c9]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52 - [c8]Michael Ben-Or:
Fast Asynchronous Byzantine Agreement (Extended Abstract). PODC 1985: 149-151 - [c7]Amotz Bar-Noy, Michael Ben-Or, Danny Dolev:
Choice Coordination with Bounded Failure (a Preliminary Version). PODC 1985: 309-316 - 1984
- [c6]Michael Ben-Or, Dexter Kozen, John H. Reif:
The Complexity of Elementary Algebra and Geometry (Preliminary Abstract). STOC 1984: 457-464 - [c5]Miklós Ajtai, Michael Ben-Or:
A Theorem on Probabilistic Constant Depth Computations. STOC 1984: 471-474 - 1983
- [c4]Michael Ben-Or:
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). PODC 1983: 27-30 - [c3]Michael Ben-Or:
Lower Bounds for Algebraic Computation Trees (Preliminary Report). STOC 1983: 80-86 - [c2]Michael Ben-Or, Benny Chor, Adi Shamir:
On the Cryptographic Security of Single RSA Bits. STOC 1983: 421-430 - 1981
- [b1]Michael Ben-Or:
אלגוריתמים הסתברותיים בשדות סופיים (Probabilistic algorithms in finite fields.). Hebrew University of Jerusalem, Israel, 1981 - [c1]Michael Ben-Or:
Probabilistic Algorithms in Finite Fields. FOCS 1981: 394-398
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-07 23:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
