Efficient provably-secure hierarchical key assignment schemes
From MaRDI portal
Publication:719310
DOI10.1016/j.tcs.2011.06.024zbMath1236.94074OpenAlexW2036493810MaRDI QIDQ719310
Alfredo De Santis, Barbara Masucci, Anna Lisa Ferrara
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.024
Related Items (2)
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
- Unnamed Item
- Unnamed Item
- New constructions for provably-secure time-bound hierarchical key assignment schemes
- Variations on a theme by Akl and Taylor: security and tradeoffs
- Probabilistic encryption
- Computing on a free tree via complexity-preserving mappings
- A cryptographic key assignment scheme in a hierarchy for access control
- A dynamic cryptographic key assignment scheme in a tree structure
- Characterization of security notions for probabilistic private-key encryption
- Efficient Provably-Secure Hierarchical Key Assignment Schemes
- Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
- Shortcutting Planar Digraphs
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Generic Transformation for Scalable Broadcast Encryption Schemes
- The Transitive Reduction of a Directed Graph
- Partially Ordered Sets
- Selecting cryptographic key sizes
This page was built for publication: Efficient provably-secure hierarchical key assignment schemes
