Dynamic join-exit amortization and scheduling for time-efficient group key agreement

Mao, Yinian; Sun, Yan; Wu, Min; Liu, K.J.R.

doi:10.1109/infcom.2004.1354681

Cited by 19 publications

(31 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next we compare the rekeying cost in PACK upon single user join and leave events with two existing tree-based contributory group key agreement schemes: TGDH [7] and DST [8]. All three types of cost are considered: time, computation, and communication.…”

Section: Performance Evaluation and Comparisonmentioning

confidence: 99%

“…Contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications [1]- [8]. However, the early design of contributory group key agreement schemes mostly considers the efficiency of initial group key establishment [1]- [3], which encounter high rekeying cost upon group membership changes.…”

Section: Introductionmentioning

confidence: 99%

“…However, the early design of contributory group key agreement schemes mostly considers the efficiency of initial group key establishment [1]- [3], which encounter high rekeying cost upon group membership changes. Recently, logical tree structures are used to improve the scalability of contributory key agreements [7], [8]. Kim et al proposed a tree-based contributory group key agreement protocol called TGDH, where binary balanced tree is adopted to maintain the keying material [7].…”

Section: Introductionmentioning

confidence: 99%

“…In TGDH, the group key can be updated by performing log n rounds of two-party Diffie-Hellman (DH) upon any single user join or departure, where n is the group size. Mao et al proposed another tree-based contributory key agreement scheme called DST [8]. By using a special jointree/exit-tree topology and exploiting cost amortization, DST can reduce the average time cost to Θ(log log n) rounds of two-party DH for single user join or departure.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Minimization of rekeying cost for contributory group communications

Sun²,

Liu³

2005

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.

Self Cite

View full text Add to dashboard Cite

Abstract-While contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of rekeying overhead. In this paper we introduce a contributory group key agreement that achieves the performance lower bound by utilizing a novel logical key tree structure, called PFMH, and the concept of phantom user position. In particular, the proposed scheme only needs O(1) rounds of two-party Diffie-Hellman upon any single user join event and O(log n) rounds of two-party Diffie-Hellman upon any single user leave event. Both theoretical bound analysis and simulation studies show that the proposed scheme achieves much lower rekeying cost than the existing treebased contributory group key agreement schemes.

show abstract

Section: Performance Evaluation and Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Minimization of rekeying cost for contributory group communications

Sun²,

Liu³

2005

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the literature, many group key management protocols have been proposed [6], [7], [9]- [13], [15]- [24]. The early designs of contributory key agreements mostly consider the efficiency of key establishment [25] [26] [27].…”

Section: Introductionmentioning

confidence: 99%

JET: Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management

Mao

Sun

et al. 2006

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management. Index Termssecure group communications, time efficiency, contributory key management, dynamic tree topology.Part of this work was presented in IEEE INFOCOM'04,

show abstract

Pruned nodes in ternary key tree during batch rekeying in group key agreement for cognitive radio ad hoc networks

Renugadevi

Mala

2015

Security Comm Networks

View full text Add to dashboard Cite

Cognitive radio networks need stringent and secure group communication as nodes dynamically access the free portions of radio frequency spectrum to solve the spectrum scarcity in wireless networks. The cognitive radio ad hoc networks can use group key agreement to achieve security in group communication and tree topology to organize the group members in order to reduce the complexity of group operations. This paper proposes a ternary key tree model for tree-based group key agreement in cognitive radio ad hoc networks, and it considers batch rekeying scheme. The range of ids for member, nonmember and pruned nodes in the ternary key tree are analysed in this paper. This paper proposes the analysis of two types of leave operations in the key tree, and the concept of subtree structure is used to analyse the total number of internal nodes that are pruned during leave operations in the key tree through mathematical expressions. This pruned nodes analysis can be used in finding the total number of renewed nodes in the key tree during rekeying process to measure the communication complexity of tree-based group key agreement protocol.Pruned nodes in ternary key tree for cognitive radio ad hoc networks Security Comm. Networks 2015; 8:4289-4307

show abstract

Dynamic join-exit amortization and scheduling for time-efficient group key agreement

Cited by 19 publications

References 23 publications

Minimization of rekeying cost for contributory group communications

Minimization of rekeying cost for contributory group communications

JET: Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management

Pruned nodes in ternary key tree during batch rekeying in group key agreement for cognitive radio ad hoc networks

Contact Info

Product

Resources

About