Loading...

An efficient distributed group key management using hierarchical approach with Diffie-Hellman and symmetric algorithm: DHSA

Mortazavi, S. A ; Sharif University of Technology | 2011

1295 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CNDS.2011.5764584
  3. Publisher: 2011
  4. Abstract:
  5. This paper proposes an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, asymmetric and symmetric keys. The leaf nodes in the key tree are the asymmetric keys of the corresponding group members and all the intermediate node keys are symmetric keys assigned to each intermediate node. For asymmetric key, Diffie-Hellman key agreement is introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave
  6. Keywords:
  7. Distributed Group Key Management ; Group Communication ; Hierarchical Group Key Management ; Asymmetric key ; Diffie Hellman ; Diffie-hellman key agreement ; Distributed group communication ; Distributed groups ; Group communications ; Group key ; Group members ; Hierarchical approach ; Hierarchical groups ; Intermediate node ; Key tree ; Many-to-many groups ; Symmetric algorithms ; Symmetric keys ; Diamonds ; Hierarchical systems ; Internet ; Plant extracts ; Telecommunication networks ; Distributed computer systems
  8. Source: 2011 International Symposium on Computer Networks and Distributed Systems, CNDS 2011, 23 February 2011 through 24 February 2011, Tehran ; 2011 , Pages 49-54 ; 9781424491544 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5764584