Key management scheme for multi-layer secure group communication

2012

Security Comm Networks

Secure group communication model poses the challenge of key management to enforce the access control among the users of the group. Secure group key management schemes should be designed such that there is less rekeying and storage cost involved to manage the group keys. We propose a centralized, scalable, share‐based secure group key management scheme employing a new approach on the basis of the polynomial interpolation technique. We prove the security of the scheme. We design a multilayer share‐based key management scheme to manage the keys in the multilayer communication model. A new aggregate tree structure is proposed to manage the keys in the multilayer communication model. We analyze and evaluate the performance of the designed schemes in detail for storage and rekeying cost. We show that the proposed share‐based group key management scheme and the multilayer key management schemes are efficient in terms of storage and rekeying cost in comparison with two schemes based on threshold secret‐sharing method available in the literature. Copyright © 2012 John Wiley & Sons, Ltd.

“…Our scheme is share‐based scheme where shares are chosen from GF ( p ). The scheme in made an effort to reduce the storage, but the scheme is share and key based.…”

Section: Analysis Results and Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secure group and multi‐layer group communication schemes based on polynomial interpolation

Purushothama

2012

Security Comm Networks

“…Further, it finds the keys required for encrypting the changed keys by using Boolean function minimization technique. In Reference 15, the scheme proposed in Reference 11 has been extended to m ‐ ary tree and authors propose algorithms for single leave, two members leave, and multiple members leave events. It handles only simultaneous leave operations.…”

Section: Introductionmentioning

confidence: 99%

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

Aparna¹,

2010

Security Comm Networks

Self 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:

“…We construct individual key trees for different layers and then integrate them. We use the same model that is explained for Dexter et al scheme and try to reduce the amount of storage required at both KDC and users [22]. For auxiliary keys, we use random elements, and we compute the group keys as described below.…”

Section: Proposed Key Management Scheme For Multilayer Sgcmentioning

confidence: 99%

Key Management Schemes for Multilayer and Multiple Simultaneous Secure Group Communication

Aparna¹,

ISRN Communications and Networking

2012

Self Cite

Many emerging applications are based on group communication model and many group communications like multimedia distribution and military applications require a security infrastructure that provides multiple levels of access control for group members. The group members are divided into a number of subgroups and placed at different privilege levels based on certain criteria. A member at higher level must be capable of accessing communication in its own level as well as its descendant lower levels but not vice versa. In this paper we propose a key management scheme for this multilayer group communication. We achieve substantial reduction in storage and encryption cost compared to the scheme proposed by Dexter et al. We also address periodic group rekeying. Applications like scientific discussion and project management may lead to a scenario in which it is necessary to set up multiple secure groups simultaneously, and few members may be part of several secure groups. Managing group keys for simultaneous secure groups is critical. In this paper we propose a novel key management scheme for multiple simultaneous groups.