作者: G. Ateniese , M. Steiner , G. Tsudik
DOI: 10.1109/49.839937
关键词:
摘要: 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 same time, efficient. This paper studies problem authenticated key agreement in groups with emphasis on efficient provably authentication, confirmation, integrity. It begins by considering two-party extends results to group Diffie-Hellman (1976) agreement. In process, some new security properties (unique groups) encountered discussed.