New constructions for provably-secure time-bound hierarchical key assignment schemes

DOI10.1016/j.tcs.2008.05.021zbMath1160.68009OpenAlexW1997234350MaRDI QIDQ954992

Anna Lisa Ferrara, Alfredo De Santis, Barbara Masucci

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.021

zbMATH Keywords

provable securityaccess controlefficient key derivationkey assignment

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (10)

Tree-based cryptographic access control ⋮ On optimal cryptographic key derivation ⋮ Steiner transitive-closure spanners of low-dimensional posets ⋮ Provably-secure time-bound hierarchical key assignment schemes ⋮ An efficient solution for hierarchical access control problem in cloud environment ⋮ Steiner Transitive-Closure Spanners of Low-Dimensional Posets ⋮ Efficient provably-secure hierarchical key assignment schemes ⋮ Cryptographic Enforcement of Information Flow Policies Without Public Information ⋮ Supporting dynamic updates in storage clouds with the Akl-Taylor scheme ⋮ On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Provably-secure time-bound hierarchical key assignment schemes
• A cryptographic key assignment scheme in a hierarchy for access control
• A dynamic cryptographic key assignment scheme in a tree structure
• Enforcing the security of a time-bound hierarchical key assignment scheme
• Characterization of security notions for probabilistic private-key encryption
• Efficient Provably-Secure Hierarchical Key Assignment Schemes
• The Complexity of the Partial Order Dimension Problem
• Efficiency of a Good But Not Linear Set Union Algorithm
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• The Transitive Reduction of a Directed Graph
• Partially Ordered Sets

This page was built for publication: New constructions for provably-secure time-bound hierarchical key assignment schemes