Scalable and lightweight key distribution for secure group communications

Lee, Fu-Yuan; Shieh, Shiuh-Pyng

doi:10.1002/nem.515

Cited by 10 publications

(10 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Group Key Management Protocol, the KDC (Lee and Shieh, 2004;Al-Talib et al, 2009;David Manz et al,2010) helps the first member to join the group and creates a Group Key Packet (GKP) that consists of a Group Traffic Encryption Key (GTEK) and a Group Key Encryption Key (GKEK). The KDC sends a copy of the GKP whenever a new member wants to join the group.…”

Section: Related Workmentioning

confidence: 99%

A New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group Communication

Begum¹,

Purusothaman²

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key management. Since the group members are dynamic in nature such as joining or leaving the group, the key updating is performed among the valid members without interrupting the multicast session so that non group members can't have access to the future renewed keys. Approach: The main aim is to develop a scheme which can reduce the cost of computational overhead, number of messages needed during the time of key refreshing and the number of keys stored in servers and members. The cost of establishing the key and renewal is proportionate to the size of the group and subsequently fetches a bottleneck performance in achieving scalability. By using a Cluster Based Hierarchical Key Distribution Protocol, the load of key management can be shared among dummy nodes of a cluster without revealing the group messages to them. Results: Especially, the existing model incurs a very less computational and communication overhead during renewal of keys. The proposed scheme yields better scalability because of the fact that the Key computational cost, the keys stored in key server and numbers of rekey-messages needed are very less. Conclusion: Our proposed protocol is based on Elliptic curve cryptography algorithm to form secure group key, even with smaller key size, it is capable of providing more security. This protocol can be used both in wired or wireless environments.

show abstract

Section: Related Workmentioning

confidence: 99%

A New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group Communication

Begum¹,

Purusothaman²

2011

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…, i. The new group key, S′ h , is encrypted with the old group key, the 10 , k 9-10 , k 1-11 } {k 9 , k 9-10 ,k 1-11 } {k 11 , and u new key of binomial subtree S′ t is encrypted with the key of binomial subtree S′ t−1 , t = h − 1, h − 2, . .…”

Section: N Oddmentioning

confidence: 99%

“…• new keys generated are, group key K′ 1-9 , binomial subtree keys K 5-9 , K [8][9] . Thus, h = 3 new keys are generated; • number of encryptions performed: 2h = 6; and • number of rekey messages constructed: h + 1 = 4.…”

Section: Examplementioning

confidence: 99%

“…Table 1 compares the performance of our SGBT scheme with THE LKH scheme [18]. It depicts the encryption cost and number of rekey messages constructed by KS in order to convey changed keys to members {k 11 , k 11-12 , k 9-12 , k' 1-14 } {k 10 , k 9-10 , 9 , k 9-10 , k 9-12 , k' 1-14 } {k 6 , k' 1-14 } Figure 14. Continued of the group during membership change.…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

A key management scheme for secure group communication using binomial key trees

Aparna¹,

Amberker

2010

Int J Network Mgmt

View full text Add to dashboard Cite

SUMMARYNumerous emerging applications, such as teleconferencing, board meetings, pay-per-view and scientifi c discussions, rely on a secure group communication model. Scalable group rekeying is an important issue in the secure group communication model as the nature of the group is dynamic. The number of encryptions performed and rekey messages constructed should be minimized to carry out updating of the group key, and secure delivery of the group key should be carried out in an effi cient manner. In this paper, we propose a new scheme to manage the secure group using the binomial key tree approach. In this scheme, the number of encryptions performed and rekey messages constructed during membership change are fewer compared to the scheme proposed by Wong and others. Further, it is not required to balance the tree after each membership change. We show that, for a large group, the average encryption cost and rekey message cost are independent of the size of the group for join operation and logarithmic in size of the group for leave operation. Hence our scheme is scalable.

show abstract

“…All these schemes deal solely with the node-level dynamics. Conversely, there are many key management schemes which are good at supporting user groups and copying with user-level dynamics [30][31][32]. However, few of these schemes can handle both node-level and user-level dynamics efficiently.…”

Section: Related Workmentioning

confidence: 99%

A dynamic key management solution to access hierarchy

2007

View full text Add to dashboard Cite

SUMMARYHierarchical access control (HAC) has been a fundamental problem in computer and network systems. Since Akl and Taylor proposed the first HAC scheme based on number theory in 1983, cryptographic key management techniques for HAC have appeared as a new and promising class of solutions to the HAC problem. Many cryptographic HAC schemes have been proposed in the past two decades. One common feature associated with these schemes is that they basically limited dynamic operations at the node level. In this paper, by introducing the innovative concept of 'access polynomial' and representing a key value as the sum of two polynomials in a finite field, we propose a new key management scheme for dynamic access hierarchy. The newly proposed scheme supports full dynamics at both the node level and user level in a uniform yet efficient manner. Furthermore, the new scheme allows access hierarchy to be a random structure and can be flexibly adapted to many other access models such as 'transfer down' and 'depth-limited transfer'.

show abstract

Scalable and lightweight key distribution for secure group communications

Cited by 10 publications

References 31 publications

A New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group Communication

A New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group Communication

A key management scheme for secure group communication using binomial key trees

A dynamic key management solution to access hierarchy

Contact Info

Product

Resources

About