On Key Assignment for Hierarchical Access Control

Crampton, Jason; Martin, Keith M.; Wild, Peter

doi:10.1109/csfw.2006.20

Cited by 93 publications

(98 citation statements)

References 48 publications

(89 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Generally, key assignment schemes rely on public information for key derivation [8]. An interesting feature of the schemes in the previous section is that no public information is used.…”

Section: Schemes With No Public Informationmentioning

confidence: 99%

“…There are many schemes in the literature for enforcing an information flow policy using cryptographic techniques (see the survey paper of Crampton et al [8], for example). Fig.…”

Section: Key Assignment Schemesmentioning

confidence: 99%

“…Such schemes are used to enforce a no-read-up information flow policy using cryptographic techniques. A recent survey of such schemes proposed a classification into four generic types of scheme [8]. These schemes offer different trade-offs in terms of the amount of storage required and the complexity of key derivation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Constructing Key Assignment Schemes from Chain Partitions

Crampton

Daud

Martin

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In considering a problem in access control for scalable multimedia formats, we have developed new methods for constructing a key assignment scheme. Our first contribution is to improve an existing cryptographic access control mechanism for scalable multimedia formats. We then show how our methods can be applied to a chain partition to develop alternative mechanisms for scalable multimedia formats and how these methods can themselves be extended to create a new type of key assignment scheme.

show abstract

“…Generally, key assignment schemes rely on public information for key derivation [8]. An interesting feature of the schemes in the previous section is that no public information is used.…”

Section: Schemes With No Public Informationmentioning

confidence: 99%

“…There are many schemes in the literature for enforcing an information flow policy using cryptographic techniques (see the survey paper of Crampton et al [8], for example). Fig.…”

Section: Key Assignment Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Constructing Key Assignment Schemes from Chain Partitions

Crampton

Daud

Martin

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A simple way to realize an encryption based scheme would be to assign a key k u to each class u ∈ V and a public information p (u,v) G (u, v) decryptions, where dist G (u, v) denotes the length of the shortest path between u and v in G. Such a scheme belongs to the family of iterative key encrypting key assignment schemes (IKEKAS), defined by Crampton et al [13], where each user is required to store a single secret value, corresponding to its key, and |E| values are made public. As regards as the security of the schemes, it depends on the security properties of the underlying encryption scheme.…”

Section: A Construction Based On Symmetric Encryption Schemesmentioning

confidence: 99%

“…Subsequently, many researchers have proposed different schemes that either have better performances or allow insertions and deletions of classes in the hierarchy (e.g., [4,21,23,27,28,29,31]). A detailed classification of many schemes in the literature has been recently provided by Crampton et al [13], according to several parameters, such as the memory requirements for public and private information, the complexity of key derivation, the complexity of handling dynamic updates to the hierarchy, and the resistance to collusive attacks. Atallah et al [4] first addressed the problem of formalizing security requirements for hierarchical key assignment schemes.…”

Section: Introductionmentioning

confidence: 99%

Efficient Provably-Secure Hierarchical Key Assignment Schemes

Santis

Ferrara

Masucci

2007

Mathematical Foundations of Computer Science 2007

View full text Add to dashboard Cite

A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private information of a higher class can be used to derive the keys of all classes lower down in the hierarchy.In this paper we design and analyze hierarchical key assignment schemes which are provablysecure and support dynamic updates to the hierarchy with local changes to the public information and without requiring any private information to be re-distributed.• We first consider the problem of constructing a hierarchical key assignment scheme by using as a building block a symmetric encryption scheme. We propose a new construction which is provably secure with respect to key indistinguishability, requires a single computational assumption, and improves on previous proposals.• Then, we show how to reduce key derivation time at the expense of an increment of the amount of public information, by improving a previous result.• Finally, we show how to construct a hierarchical key assignment scheme by using as a building block a public-key broadcast encryption scheme. In particular, one of our constructions provides constant private information and public information linear in the number of classes in the hierarchy.

show abstract

Identity‐based key management for cloud computing

Zhu

Mei

Xie

2016

Security Comm Networks

View full text Add to dashboard Cite

Recently, cloud computing has drawn much attention from research and industrial communities. With adoption of cloud computing, data providers can reap huge economic benefits by outsourcing their data to cloud. Because of serious privacy concerns, sensitive data should be encrypted before being outsourced. In order to share the encrypted and outsourced data, data providers need to distribute different keys to legal users. Thus, in the scenario of multiple data providers, a legal user may receive lots of keys from different providers and suffer from heavy burden from key management. In this paper, we proposed an identity-based key management scheme, which can let a legal user only maintain a single root key regardless of the number of data providers. Based on the root key, a legal user can derive different resource keys to decrypt ciphertexts from different data providers. With the help of outsourcing decryption technique, a legal user could reduce the decryption overhead by outsourcing some decryption work to cloud. We proofed the correctness and analyzed the security of the proposed scheme, further implemented the proposed scheme, and conducted extensive experiments. The results demonstrate the efficiency and practicality of our scheme.

show abstract

On Key Assignment for Hierarchical Access Control

Abstract: Abstract

Cited by 93 publications

References 48 publications

Constructing Key Assignment Schemes from Chain Partitions

Constructing Key Assignment Schemes from Chain Partitions

Efficient Provably-Secure Hierarchical Key Assignment Schemes

Identity‐based key management for cloud computing

Contact Info

Product

Resources

About