Efficient Provably-Secure Hierarchical Key Assignment Schemes
From MaRDI portal
Publication:3525584
DOI10.1007/978-3-540-74456-6_34zbMath1147.68504OpenAlexW1722462003MaRDI QIDQ3525584
Barbara Masucci, Alfredo De Santis, Anna Lisa Ferrara
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_34
Related Items (9)
Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants ⋮ Tree-based cryptographic access control ⋮ Provably-secure time-bound hierarchical key assignment schemes ⋮ New constructions for provably-secure time-bound hierarchical key assignment schemes ⋮ Transitive-Closure Spanners: A Survey ⋮ 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 ⋮ Variations on a theme by Akl and Taylor: security and tradeoffs
This page was built for publication: Efficient Provably-Secure Hierarchical Key Assignment Schemes
