The 2023 Dijkstra Prize Award Committee concluded its deliberations and we are happy to announce that the papers
 
      “Completeness Theorem for Non-Cryptographic Fault-Tolerant Distributed Computation”,
      by Michael Ben-Or, Shafi Goldwasser and Avi Wigderson. Proceedings of the 20th Annual 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 Annual 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 Annual 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

############################


Unsubscribe:

[log in to unmask]

If you don't already have a password for the LISTSERV.ACM.ORG server, we recommend
that you create one now. A LISTSERV password is linked to your email
address and can be used to access the web interface and all the lists to
which you are subscribed on the LISTSERV.ACM.ORG server.

To create a password, visit:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?GETPW1

Once you have created a password, you can log in and view or change your
subscription settings at:

https://LISTSERV.ACM.ORG/SCRIPTS/WA-ACMLPX.CGI?SUBED1=PODC