Secure group communication using binomial trees

Aparna, R.; Amberker, B. B.; Pola, Divya; Bathia, Pranjal

doi:10.1109/ants.2009.5409894

Cited by 4 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When u new joins the group, a single binomial subtree S′ 6 is obtained and is shown in Figure 9(b). In Figure 9(b) h = 6 and the members of binomial subtree S 3 require keys of binomial subtrees S′ 4 , S′ 5 and S′ 6 . The key of binomial subtree S′ 6 is encrypted with the old group key, the binomial subtree key of S′ 5 is encrypted using the binomial subtree key of S′ 4 , and the binomial subtree key of S′ 4 is encrypted with the binomial subtree key of S 3 .…”

Section: N Oddmentioning

confidence: 99%

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

Aparna¹,

Amberker

2010

Int J Network Mgmt

Self Cite

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

Section: N Oddmentioning

confidence: 99%

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

Aparna¹,

Amberker

2010

Int J Network Mgmt

Self Cite

View full text Add to dashboard Cite

show abstract

“…Schemes based on LKH use hierarchical key tree to manage secure groups. BLKH scheme manages secure groups by maintaining Binomial Key Trees [BKTs] to store node information and key information [4]. Based on the number of members in the cluster, the BKT consists of multiple binomial subtrees that are rooted at different nodes.…”

Section: Blkh Schemementioning

confidence: 99%

Binomial Tree based Key Establishment Schemes for Heterogeneous Wireless Sensor Networks

H.S¹,

Siddappa²

2018

IJET

View full text Add to dashboard Cite

Clustering is one of the techniques used in Wireless Sensor Networks (WSNs) to enhance the network lifetime. Network lifetime can further be improved by reducing the number of computations performed by cluster members and cluster head. This paper presents two low cost key establishment schemes for clustered sensor networks which use binomial trees for managing the clusters: BLKH (Binomial tree based Logical Key Hierarchy) scheme and BWLKH (Binomial tree based Wireless Logical Key Hierarchy) scheme. The proposed schemes avoid rebalancing of key trees during join/leave operations by replacing logical key tree by binomial key tree. In both schemes, the number of new keys generated and the number of encryptions performed during node addition/eviction are less compared to LKH++ and WLKH schemes and are quite efficient. The proposed schemes increase the performance of a sensor node by minimizing the computations at cluster members. Thus, the schemes are scalable and suitable for large scale sensor networks.

show abstract

“…Here, we consider the value of h = log 2 N , which is the maximum possible value and in case of leave event, h l denotes the height of the last binomial subtree before user leaves the group. Different cases depicted in Table I are explained in detail in References 16, 17.…”

Section: Binomial Treementioning

confidence: 99%

“…It handles only simultaneous leave operations. In References 16, 17, a binomial key tree (BKT) concept is used to manage a secure group and authors address the rekeying costs involved during join and leave operations. It is shown that the scheme is efficient in terms of the computation and communication costs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient scheme to handle bursty behavior in secure group communication using binomial key trees

Aparna¹,

Amberker

2010

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

Secure group communication (SGC) is one of the important research areas and numerous applications are relied upon SGC model. In some applications, such as pay-per-view, periodical electronic information distribution, etc., many users join and leave the group at the same moment known as bursty behavior. In this paper, we propose a scheme for handling bursty behavior. We use binomial key tree (BKT) for managing the secure group, which is quite efficient in handling rekeying strategies. We handle all the possible bursty behavior scenarios and analyze the communication and computation costs for the worst cases. We compare our scheme with the scheme proposed by Wong et al. and show that our scheme is efficient in terms of cost of encryptions and cost of key generation. Efficient scheme to handle bursty behavior Key of binomial subtree S 4 is encrypted with keys of binomial subtrees S 3 : {K 1−24 } K 1−20 ,K 9−24 , Key of each binomial subtree S 3 is encrypted with keys of two binomial subtrees S 2 : {K 1−20 } K 1−18 ,K 5−20 , {K 9−24 } K 9−22 ,K 13−24 , Key of each binomial subtree S 2 is encrypted with keys of two binomial subtrees S 1 Efficient scheme to handle bursty behavior Number of Rekey messagesFollowing rekey messages are constructed to convey changed keys to group members:

show abstract

Secure group communication using binomial trees

Cited by 4 publications

References 6 publications

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

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

Binomial Tree based Key Establishment Schemes for Heterogeneous Wireless Sensor Networks

An efficient scheme to handle bursty behavior in secure group communication using binomial key trees

Contact Info

Product

Resources

About