Michael Ben-Or

Michael Ben-Or ({{langx|he|מיכאל בן-אור}}) is an Israeli computer scientist , the Jean and Helena Alfassa Professor of computer science at the Hebrew University of Jerusalem. His research interests include Theoretical Computer Science, Distributed Computation, Fault-Tolerance, Cryptography and Quantum Computation.[https://simons.berkeley.edu/people/michael-ben-or Michael Ben-Or][https://www.cs.huji.ac.il/w~benor/ Michael Ben-Or רוא-ןב לאכימ]

He received his PhD in Mathematics from the Hebrew University in 1982.

Three of his papers received the Dijkstra Prize in Distributed Computing:

• 2023: For the papers, "for introducing Information-Theoretic Secure Multiparty Computations and showing how to achieve maximal resilience to malicious adversaries while providing unconditional security.":[https://www.eatcs.org/index.php/dijkstra-prize Dijkstra Prize][https://www.podc.org/2023-edsger-w-dijkstra-prize-in-distributed-computing/ 2023 Edsger W. Dijkstra Prize in Distributed Computing]
• Michael Ben-Or, Shafi Goldwasser and Avi Wigderson for "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation" in Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), Chicago, Illinois, USA, May 1988, pages 1-10.
• Tal Rabin and Michael Ben-Or for "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority" in Proceedings of the 21st ACM Symposium on Theory of Computing (STOC), Seattle, Washington, USA, May 1989, pages 73-85
• 2015: Michael Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols", in Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 27-30, August 1983