Balanced batch LKH: new proposal, implementation and performance evaluation

Pegueroles, Josep; Rico-Novella, Francisco

doi:10.1109/iscc.2003.1214218

Cited by 34 publications

(16 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach is used in [18], [19], [20], [21], [22], [23]. This not only alleviates the individual rekeying problems described in Section 1 (that is, inefficiency, rekey message delay, and high join/depart rates), but also reduces the number of group rekey events.…”

Section: Batch Rekeyingmentioning

confidence: 99%

“…Balanced Batch Logical Key Hierarchy (LKH) [21], [22] has also been proposed to alleviate the inefficiency in Marking Algorithm 1 [18], but this algorithm is only suitable for a binary key tree ðk ¼ 2Þ and the author does not offer a solution for a key tree with other outdegrees.…”

Section: Related Workmentioning

confidence: 99%

“…Furthermore, there are additional key storage and encryption/ decryption requirements for both the GC and group members. As for Marking Algorithm 1, the probability of the key tree becoming unbalanced is very high [21], which can result in a higher decryption for some of the members.…”

Section: Application Scenariosmentioning

confidence: 99%

“…Second, if the delay in a rekey message delivery is high or the rate of join/ depart requests is high, a member may need a large amount of memory to temporarily store the rekey and data messages before they are decrypted. Batch rekeying [18], [19], [20], [21], [22], [23] has been proposed to alleviate these problems as a trade-off between performance and security. In this scheme, the GC does not perform rekeying immediately; instead, it consolidates the total number of joining and departing members during a time period before performing the rekeying.…”

mentioning

confidence: 99%

“…The efficiency of the key tree approach critically depends on whether the key tree is balanced [21], [24], [25], [26]. A key tree is considered balanced if the distance from the root to any two leaf nodes differs by not more than 1 [26].…”

mentioning

confidence: 99%

See 4 more Smart Citations

Dynamic Balanced Key Tree Management for Secure Multicast Communications

Ng¹,

Howarth

Sun

et al. 2007

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-A secure multicast communication is important for applications such as pay-per-view and secure videoconferencing. A key tree approach has been proposed by other authors to distribute the multicast group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or depart request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or depart. In this paper, we present two Merging Algorithms suitable for batch join requests. To additionally handle batch depart requests, we extend these two algorithms to a Batch Balanced Algorithm. Simulation results show that our three algorithms not only maintain a balanced key tree, but their rekeying costs are lower compared with those of existing algorithms.

show abstract

Section: Batch Rekeyingmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Application Scenariosmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Dynamic Balanced Key Tree Management for Secure Multicast Communications

Ng¹,

Howarth

Sun

et al. 2007

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

Balanced key tree management for multi‐privileged groups using (N, T) policy

Muthulakshmi

Anitha

2011

Security Comm Networks

View full text Add to dashboard Cite

Many internet applications are based on group communication model. For secure group communication scenario, key management is an important issue. In a hierarchical architecture, key trees are used. When users join or leave a key tree, all the ancestor nodes in the leave path till root gets affected. It encroaches threat to forward secrecy as well as backward secrecy. This poses a need for rekeying whenever users join or leave. Periodic batch rekeying is a process where the key server waits until the rekey interval is elapsed and does the rekeying process. Nevertheless, there are many key management schemes; there is still research fostering in key management in group communication for multi-privileged users, where the users of the group have access to multiple resources, unlike the traditional case with single resource. This paper addresses batch user join or leave case in multi-privileged environment. A variation of batch rekeying is introduced by using min(N, T) policy so that the users need not wait until the rekey interval is reached and the probabilistic analysis based on it are provided. It also discusses about the improvement in terms of number of rekeying done and provides a balanced tree when multiple users join/leave.

show abstract