Multilayer multicast key management with threshold cryptography

Dexter, Scott; Belostotskiy, Roman; Eskicioğlu, Ahmet M.

doi:10.1117/12.526662

Cited by 6 publications

(33 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Though it requires more amount of computation as compared to (t−1) degree polynomial, it improves the resistance of the system to attack; hence, the system is more secure. Table 1 gives the comparison of our scheme with the scheme proposed by Dexter et al [21] in terms of storage and encryption cost. Table 2 compares the performance of our scheme with Dexter et al scheme [21].…”

Section: Comparisonmentioning

confidence: 99%

“…The scheme proposed in [19,20] is key-based, where each layer has its own session key and whenever there is a membership change in any layer, corresponding session key is changed and securely transmitted to appropriate group members. The scheme proposed in [21] is share based. For each layer, a polynomial of degree t is considered, and t distinct shares of this polynomial are stored at the members of that layer (prepositioned information) and KDC sends (t + 1)th share as an activating share so that members can compute group key for that layer.…”

Section: Applications Of Multilayer Sgcmentioning

confidence: 99%

“…In Dexter et al scheme [21], each user u ∈ P i stores the shares of the keys along the path from leaf to the root, i = 1, 2, . .…”

Section: Comparisonmentioning

confidence: 99%

“…In Dexter et al scheme [21], the group key for each layer i is computed by constructing a (t − 1) degree polynomial and evaluated at 0. In our scheme, as we move up the hierarchy, degree of the polynomial is incremented by 1.…”

Section: Comparisonmentioning

confidence: 99%

“…In [21], integrated key graph as in [19,20] is used, but for key management it uses share-based scheme. The key management scheme proposed in [21] is explained as follows:…”

Section: Multilayer Secure Group Communicationmentioning

confidence: 99%

See 4 more Smart Citations

Key Management Schemes for Multilayer and Multiple Simultaneous Secure Group Communication

Aparna¹,

Amberker

2012

ISRN Communications and Networking

View full text Add to dashboard 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.

show abstract

Section: Comparisonmentioning

confidence: 99%

Section: Applications Of Multilayer Sgcmentioning

confidence: 99%

“…In Dexter et al scheme [21], each user u ∈ P i stores the shares of the keys along the path from leaf to the root, i = 1, 2, . .…”

Section: Comparisonmentioning

confidence: 99%

Section: Comparisonmentioning

confidence: 99%

“…In [21], integrated key graph as in [19,20] is used, but for key management it uses share-based scheme. The key management scheme proposed in [21] is explained as follows:…”

Section: Multilayer Secure Group Communicationmentioning

confidence: 99%

See 3 more Smart Citations

Key Management Schemes for Multilayer and Multiple Simultaneous Secure Group Communication

Aparna¹,

Amberker

2012

ISRN Communications and Networking

View full text Add to dashboard Cite

show abstract

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

Purushothama

Amberker

2012

Security Comm Networks

View full text Add to dashboard Cite

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.

show abstract