Provably-secure time-bound hierarchical key assignment schemes

DOI10.1007/s00145-010-9094-6zbMath1278.94041MaRDI QIDQ431793

Alfredo De Santis, Barbara Masucci, Anna Lisa Ferrara, Giuseppe Ateniese

Publication date: 3 July 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-010-9094-6

zbMATH Keywords

bilinear maps; key recovery; access hierarchy; key indistinguishability; security against adaptive adversaries; security against static adversaries; symmetric encryption scheme; temporal constraint; time-bound hierarchical key assignment scheme; time-dependent encryption keys

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Provably-secure time-bound hierarchical key assignment schemes, New constructions for provably-secure time-bound hierarchical key assignment schemes, Cryptographically-enforced hierarchical access control with multiple keys, Variations on a theme by Akl and Taylor: security and tradeoffs, Tree-based cryptographic access control, Supporting dynamic updates in storage clouds with the Akl-Taylor scheme, Cryptographic Enforcement of Information Flow Policies Without Public Information, On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures, Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness

Cites Work

• Provably-secure time-bound hierarchical key assignment schemes
• Cryptographic key assignment schemes for any access control policy
• New constructions for provably-secure time-bound hierarchical key assignment schemes
• The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
• Variations on a theme by Akl and Taylor: security and tradeoffs
• Probabilistic encryption
• Short signatures from the Weil pairing
• 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
• Number-theoretic constructions of efficient pseudo-random functions
• Keying Hash Functions for Message Authentication
• Efficient Provably-Secure Hierarchical Key Assignment Schemes
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Identity-Based Encryption from the Weil Pairing
• Advances in Cryptology - EUROCRYPT 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• The Transitive Reduction of a Directed Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item