A New and Efficient Key Management Scheme for Content Access Control within Tree Hierarchies

Hassen, Hani Ragab; Bouabdallah, Abdelmadjid; Bettahar, Hatem

doi:10.1109/ainaw.2007.32

Cited by 6 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hassen [11] proposes another extension by introducing intra-level changes on the tree. This approach enables key graphs to change the affiliation of a node to a group.…”

Section: Related Workmentioning

confidence: 99%

Versatile Key Management for Secure Cloud Storage

Graf

Lang

Hohenadel

et al. 2012

2012 IEEE 31st Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

Not only does storing data in the cloud utilize specialized infrastructures facilitating immense scalability and high availability, but it also offers a convenient way to share any information with user-defined third-parties. However, storing data on the infrastructure of commercial third party providers, demands trust and confidence. Simple approaches, like merely encrypting the data by providing encryption keys, which at most consist of a shared secret supporting rudimentary data sharing, do not support evolving sets of accessing clients to common data. Based on approaches from the area of stream-encryption, we propose an adaption for enabling scalable and flexible key management within heterogeneous environments like cloud scenarios. Representing access-rights as a graph, we distinguish between the keys used for encrypting hierarchical data and the encrypted updates on the keys enabling flexible join-/leaveoperations of clients. This distinction allows us to utilize the high availability of the cloud as updating mechanism without harming confidentiality. Our graph-based key management results in an adaption of nodes related to the changed key. The updates on the keys again continuously create an overhead related to the number of these updated nodes. The proposed scalable approach utilizes cloud-based infrastructures for confidential data and key sharing in collaborative workflows supporting variable client-sets.

show abstract

“…Hassen [11] proposes another extension by introducing intra-level changes on the tree. This approach enables key graphs to change the affiliation of a node to a group.…”

Section: Related Workmentioning

confidence: 99%

Versatile Key Management for Secure Cloud Storage

Graf

Lang

Hohenadel

et al. 2012

2012 IEEE 31st Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

show abstract

“…Several key management schemes [7], [8], [9], [10] have been proposed to construct a single logical key graph for hierarchical access control in group and multicast communication. The idea of these key management schemes can be used in the distance education DRM system.…”

Section: Introductionmentioning

confidence: 99%

An efficient hierarchical rights authorization scheme for offline content protection

Ouyang

Gao

Liu

et al. 2008

2008 IEEE International Symposium on IT in Medicine and Education

View full text Add to dashboard Cite

Digital Rights Management (DRM) technology aims to distribute digital contents to users in a controlled manner that can protect the copyright of contents.Most previous DRM schemes do not consider user relations and content relations, thus it results in inefficiency and produces much overhead. In this paper, an efficient hierarchical rights authorization scheme for offline content protection (HRAS) is proposed in distance education system of university/college. Based on certain hierarchical rights relations of users and course contents in distance education system, a logical key graph is constructed in HRAS and two algorithms are designed respectively to construct the key graph. A comparison with other DRM schemes has shown that HRAS is efficient and has low overhead.

show abstract

“…The complexity of some of the existing dependent-keys key management schemes [9,[11][12][13]17,20] when applied to linear hierarchies was evaluated in [6]. Table 5 uses this evaluation and compares the complexity of KTLH to the dependentkeys schemes, namely direct and indirect schemes.…”

Section: Comparison To the Existing Schemesmentioning

confidence: 99%

“…We have chosen the key tables-based key management scheme for linear hierarchies (KTLH) key management scheme [6] because of its complex and random behavior. Applying Markov processes to other key management schemes is likely to be of similar or less complexity.…”

Section: Our Contributionmentioning

confidence: 99%

A key management scheme evaluation using Markov processes

Ragab-Hassen

Lounes

2016

Int. J. Inf. Secur.

View full text Add to dashboard Cite

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

A New and Efficient Key Management Scheme for Content Access Control within Tree Hierarchies

Cited by 6 publications

References 27 publications

Versatile Key Management for Secure Cloud Storage

Versatile Key Management for Secure Cloud Storage

An efficient hierarchical rights authorization scheme for offline content protection

A key management scheme evaluation using Markov processes

Contact Info

Product

Resources

About