An Efficient Key Management for Large Dynamic Groups

  • Authors:
  • Affiliations:
  • Venue:
  • CNSR '04 Proceedings of the Second Annual Conference on Communication Networks and Services Research
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Key management for large dynamic groups is adifficult problem because of scalability and security.SKDC method is very weak in scalability. Logical keyhierarchy (LKH) algorithm proposed in 1997 has greatlyimproved scalability for key management in largedynamic groups. In 1998 one-way-function tree (OFT)method appeared to obtain more efficiency than LKH. ButOFT method has security breaches in collusion attacks. Inthis paper a new method will be presented, which is moreefficient than OFT and resistant to collusion attacks.