Tree-based cryptographic access control
From MaRDI portal
Publication:2167711
DOI10.1007/978-3-319-66402-6_5zbMath1496.68053OpenAlexW2744480655MaRDI QIDQ2167711
Naomi Farley, James Alderman, Jason Crampton
Publication date: 25 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-66402-6_5
Related Items (1)
Cites Work
- Unnamed Item
- Provably-secure time-bound hierarchical key assignment schemes
- New constructions for provably-secure time-bound hierarchical key assignment schemes
- Cryptographic Enforcement of Information Flow Policies Without Public Information
- Efficient Provably-Secure Hierarchical Key Assignment Schemes
- Efficient algorithms for finding maximum matching in graphs
- Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes
- Secure Key-Updating for Lazy Revocation
This page was built for publication: Tree-based cryptographic access control