On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures

DOI10.1007/978-3-319-40367-0_3zbMath1346.94096OpenAlexW2494420979MaRDI QIDQ2817802

Francesco Palmieri, Aniello Castiglione, Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci

Publication date: 2 September 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40367-0_3

zbMATH Keywords

access controlkey assignmentdynamic structuresdynamic adversarystrong key indistinguishabilitystrong key recovery

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Hierarchical Conditional Proxy Re-Encryption: A New Insight of Fine-Grained Secure Data Sharing, CDPS: a cryptographic data publishing system, Supporting dynamic updates in storage clouds with the Akl-Taylor scheme

Cites Work

• Provably-secure time-bound hierarchical key assignment schemes
• Efficient provably-secure hierarchical key assignment schemes
• Cryptographic key assignment schemes for any access control policy
• New constructions for provably-secure time-bound hierarchical key assignment schemes
• Variations on a theme by Akl and Taylor: security and tradeoffs
• 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
• Unconditionally secure key assignment schemes
• Provably Secure Key Assignment Schemes from Factoring
• Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants
• Efficient Provably-Secure Hierarchical Key Assignment Schemes
• Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes
• The Transitive Reduction of a Directed Graph