Tree-based cryptographic access control
From MaRDI portal
Recommendations
- Cryptographic enforcement of information flow policies without public information
- Time-storage trade-offs for cryptographically-enforced access control
- Cryptographic key assignment schemes for any access control policy
- Cryptographically-enforced hierarchical access control with multiple keys
- Controlling access in tree hierarchies
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Cryptographic enforcement of information flow policies without public information
- Efficient Provably-Secure Hierarchical Key Assignment Schemes
- Efficient algorithms for finding maximum matching in graphs
- New constructions for provably-secure time-bound hierarchical key assignment schemes
- Provably-secure time-bound hierarchical key assignment schemes
- Secure key-updating for lazy revocation
- Simple, efficient and strongly KI-secure hierarchical key assignment schemes
Cited in
(10)- Cryptographic role-based access control, reconsidered
- scientific article; zbMATH DE number 1941233 (Why is no real title available?)
- Key derivation algorithms for monotone access structures in cryptographic file systems
- Coding and Cryptography
- Cryptographic enforcement of information flow policies without public information
- Information Security and Cryptology - ICISC 2003
- Controlling access in tree hierarchies
- Time-storage trade-offs for cryptographically-enforced access control
- Leakage-Free Dissemination of Authenticated Tree-Structured Data With Multi-Party Control
- How to Construct Interval Encryption from Binary Tree Encryption
This page was built for publication: Tree-based cryptographic access control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167711)
