An Efficient Key Management Scheme for Access Control in a User Hierarchy

Zhang, Jianmin; Li, Jian; Liu, Xian De

doi:10.1109/itcs.2009.119

Cited by 4 publications

(2 citation statements)

References 11 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the schemes proposed in this approach use prime numbers fundamental properties (Akl and Taylor [12], Ray et al [13], Zou et al [14]) and other theoretical cryptographic notions (Hardjono et al [15] and Zheng et al [16]). Shen and Chen [17], Zhang et al [18], Tzang et al [19] and Das et al [20] used Newton's polynomial interpolation to correlate classes' indices with their keys.…”

Section: Key Management Schemes For Cachmentioning

confidence: 99%

A key management scheme evaluation using Markov processes

Ragab-Hassen

Lounes

2016

Int. J. Inf. Secur.

View full text Add to dashboard Buy / Rent full text

Content access control aims at ensuring that, in a system with several resources, users can only access resources they are authorized to. Resources are encrypted using cryptographic keys. Generating, distributing and renewing these keys are the challenges faced by key management schemes. While most of the existing key management schemes are typically evaluated by simulation. We propose, for the first time, to use Markovian processes for this purpose. Markovian processes give more accurate evaluation. The key tables-based key management scheme for linear hierarchies (KTLH) is a particularly interesting key management scheme; it was initially proposed for securing group communications, but could easily be adapted to other application such as wireless sensor networks. KTLH requires each user to maintain a set of keys. The keys and size of the key set change dynamically, making the evaluation of the overheads of KTLH a challenging task. Our contribution is threefold, we have (1) modeled KTLH using Markov processes, (2) evaluated KTLH according to its storage, computation and bandwidth overheads and compared it to existing key management schemes and (3) shown how our approach could be generalized to other key management schemes.

show abstract

Section: Key Management Schemes For Cachmentioning

confidence: 99%

A key management scheme evaluation using Markov processes

Ragab-Hassen

Lounes

2016

Int. J. Inf. Secur.

View full text Add to dashboard Buy / Rent full text

show abstract

“…Most of the schemes proposed in this approach use prime numbers fundamental properties (Akl and Taylor [22], Ray et al [29], Zou et al [30]), and other theoretical cryptographic notions, including Chinese reminder theorem (Hardjono et al [31] and Zheng et al [32]). Shen and Chen [33], Zhang et al [34], Tzang et al [35] and Das et al [36] use Newton's polynomial interpolation to correlate classes' indices and their keys. Whereas Aparna et al [37] use threshold cryptography to reduce the cost of key renewal, and Liu et al [38] use elliptic curves.…”

Section: Existing Key Management Schemesmentioning

confidence: 99%

An efficient key management scheme for content access control for linear hierarchies

et al. 2012

View full text Add to dashboard Buy / Rent full text

The content access control problem appears in any context with a set of users and resources. The difference in access rights of the users defines classes where members of a given class have exactly the same access rights. A hierarchy can be defined on the classes. Linear hierarchies constitute a particulary interesting type of hierarchies. They appear in a wide range of applications such as secure multi-layered data streaming and communications within security corps. Many proposals have dealt with key management issues for tree hierarchies but they result in unjustified overhead when applied to linear hierarchies. In this paper, we discuss the general problem of content access control in a hierarchy (CACH). Thereafter, we present the main requirements in key management to ensure confidentiality in linear hierarchies. In particular, we define a model to make a uniform and coherent description of the existing key management schemes. Thereafter, we propose an efficient key management scheme for linear hierarchies that not only provides mechanisms to manage membership changes but also hierarchy shape changes, and we describe it using our model. We conduct intensive simulations which show that our solution scales very well in terms of storage, bandwidth, and computation. Finally, we determine the complexity of some well-known key management schemes and compare them to the complexity of our scheme. This comparison shows that our scheme offers efficient compromises in complexity and overall overheads.

show abstract

An Efficient Key Management Scheme for Access Control in a User Hierarchy

Cited by 4 publications

References 11 publications

A key management scheme evaluation using Markov processes

A key management scheme evaluation using Markov processes

An efficient key management scheme for content access control for linear hierarchies

Contact Info

Product

Resources

About