The 2023 Dijkstra Prize Award Committee concluded its deliberations and we are happy to announce that the papers
“Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,”
by Michael Ben-Or, Shafi Goldwasser and Avi Wigderson.
Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), Chicago, Illinois, USA, May 1988, pages 1-10.
“Multiparty Unconditionally Secure Protocols,”
by David Chaum, Claude Crépeau and Ivan Damgård.
Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), Chicago, Illinois, USA, May 1988, pages 11-19.
“Verifiable Secret Sharing and Multiparty Protocols with Honest Majority,”
by Tal Rabin and Michael Ben-Or.
Proceedings of the 21st ACM Symposium on Theory of Computing (STOC), Seattle, Washington, USA, May 1989, pages 73-85.
have been selected by the committee to receive the Dijkstra Prize this year for introducing Information-Theoretic Secure Multiparty Computations and showing how to achieve maximal resilience to malicious adversaries while providing unconditional security.
Congratulations!
The Award Committee 2023:
Yehuda Afek, Tel-Aviv University
Magnús Halldórsson, Reykjavik University (chair)
Idit Keidar, Technion
Rotem Oshman, Tel-Aviv University
Ulrich Schmid, TU Wien
Gadi Taubenfield, Reichman University