Hardness amplification of weakly verifiable puzzles
Ran Canetti, Shai Halevi, et al.
TCC 2005
Many modern computing environments involve dynamic peer groups. Distributed simulation, multiuser games, conferencing applications, and replicated servers are just a few examples. Given the openness of today's networks, communication among peers (group members) must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and probably secure key authentication, key confirmation, and integrity. It begins by considering two-party authenticated key agreement and extends the results to Group Diffie-Hellman key agreement. In the process, some new security properties (unique to groups) are encountered and discussed.
Ran Canetti, Shai Halevi, et al.
TCC 2005
Michael Steiner, Peter Buhler, et al.
ACM TISSEC
Philippe Janson, Gene Tsudik
Computer Communications
Liqun Chen, Matthias Enzmann, et al.
FC 2005