Michael Ben-Or

10.8k citations
64 papers · 7.3k · 2 hit papers · h-index 31

Impact in

    • Complexity and Algorithms in Graphs
    • Cryptography and Data Security
    • Privacy-Preserving Technologies in Data
    • Quantum Computing Algorithms and Architecture
    • Quantum Information and Cryptography
    • Cryptographic Implementations and Security

Papers in

    • Cryptography and Data Security 24
    • Quantum Information and Cryptography 11
    • Quantum Computing Algorithms and Architecture 9
    • Privacy-Preserving Technologies in Data 8
    • Complexity and Algorithms in Graphs 13
    • Polynomial and algebraic computation 8

Michael Ben-Or

61 papers receiving 6.8k citations

Michael Ben-Or's Hit Papers

Verifiable secret sharing and multiparty protocols with honest majority 1989 · 713 citations
7130+12+25Years since publication50010001.5k

Peers

Michael Ben-Or
Comparison fields: 5 of 100
  • Computational Theory and Mathematics 3.2k
  • Artificial Intelligence 5.7k
  • Computer Networks and Communications 2.0k
  • Computer Graphics and Computer-Aided Design 263
  • Information Systems 1.3k
Replace Eyal Kushilevitz with:
Eyal Kushilevitz Israel
Márió Szegedy United States
Russell Impagliazzo United States
Salil Vadhan United States
Carsten Lund United States
H. W. Lenstra United States
Daniele Micciancio United States
Michael Sipser United States
Joe Kilian United States
Daniel A. Spielman United States
Michael Ben-Or relative to Eyal Kushilevitz Israel Eyal Kushilevitz's profile →
Citations per field
00.5×2.9×
Eyal Kushilevitz · 1×
Citations per year

Countries citing papers authored by Michael Ben-Or

Since Specialization
Citations

This map shows the geographic impact of Michael Ben-Or's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Ben-Or with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Ben-Or more than expected).

Fields of papers citing papers by Michael Ben-Or

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Ben-Or. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Ben-Or. The network helps show where Michael Ben-Or may publish in the future.

Co-authors

The 25 scholars most cited alongside Michael Ben-Or, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michael Ben-Or Line = papers co-authored together Michael Ben-Or links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 64 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Hit paper breakdown →
19881856
2
Verifiable secret sharing and multiparty protocols with honest majority
Hit paper breakdown →
1989713
3 1983415
4 1983405
5 1997344
6
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
1988337
7 1988311
8 2008305
9 1990229
10 1988210
11
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols
2000178
12 1986166
13 1993151
14
Collective Coin Flipping.
1989148
15 1990140
16 2005135
17 1981133
18 1994128
19 199298
20 198588

About Michael Ben-Or

Michael Ben-Or is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Atomic and Molecular Physics, and Optics and Information Systems, having authored 64 papers that have together received 7.3k indexed citations. Recurring topics across this work include Cryptography and Data Security (24 papers), Distributed systems and fault tolerance (20 papers), Complexity and Algorithms in Graphs (13 papers), Quantum Information and Cryptography (11 papers), Quantum Computing Algorithms and Architecture (9 papers), Privacy-Preserving Technologies in Data (8 papers), Polynomial and algebraic computation (8 papers) and Quantum Mechanics and Applications (5 papers). The work is most often cited by research in Computational Theory and Mathematics (3.2k citations), Artificial Intelligence (5.7k citations), Computer Networks and Communications (2.0k citations), Computer Graphics and Computer-Aided Design (263 citations) and Information Systems (1.3k citations). Michael Ben-Or has collaborated with scholars based in Israel, United States and Moldova. Frequent co-authors include Avi Wigderson, Tal Rabin, Dorit Aharonov, Shafi Goldwasser, Oded Goldreich, Nathan Linial, Joe Kilian, Silvio Micali, Dexter Kozen and John H. Reif. Their work appears in journals such as SIAM Journal on Computing, Distributed Computing, npj Quantum Information, Physical Review A and IEEE Transactions on Information Theory.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact