Variations on a theme by Akl and Taylor: security and tradeoffs

DOI10.1016/j.tcs.2009.09.028zbMath1191.68272MaRDI QIDQ1041239

Alfredo De Santis, Barbara Masucci, Paolo D'Arco, Anna Lisa Ferrara

Publication date: 1 December 2009

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

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

zbMATH Keywords

efficiency; provable security; access control; key assignment

Mathematics Subject Classification ID

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Provably-secure time-bound hierarchical key assignment schemes, Efficient provably-secure hierarchical key assignment schemes, 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
• Cryptographic key assignment schemes for any access control policy
• Probabilistic encryption
• On the normal number of prime factors of \(\phi(n)\)
• Efficient Provably-Secure Hierarchical Key Assignment Schemes
• A method for obtaining digital signatures and public-key cryptosystems
• Foundations of Cryptography
• A Revocation Scheme with Minimal Storage at Receivers