资 源 简 介
"Group communications" has become increasingly important in many network applications. With this arises the challenge of efficient group management algorithms. This includes providing confidentiality, authenticity, integrity and scalability. Though the technical issues of securing unicast communications has been well understood, the technical issues of securing group communications are not. An important part of secure group communications is scalability, which can be costly when large dynamic groups are involved. Previous attempts to solve this problem, have had communication cost proportional to the number of clients. In this project, we model the system using "key graphs". This model induces a hierarchy in the group of clients leading to subgroups(group within groups) and so on. There exists at least a two level hierarchy ,groups of workstations forming one level of hierarchy and individual workstations forming the other. Operations like a client joining or l
