Efficient Provably-Secure Hierarchical Key Assignment Schemes
From MaRDI portal
Recommendations
- Efficient provably-secure hierarchical key assignment schemes
- New constructions for provably-secure time-bound hierarchical key assignment schemes
- Provably-secure time-bound hierarchical key assignment schemes
- On the relations between security notions in hierarchical key assignment schemes for dynamic structures
- Coding and Cryptography
Cited in
(17)- Variations on a theme by Akl and Taylor: security and tradeoffs
- Auditable hierarchy-private public-key encryption
- A note on time-bound hierarchical key assignment schemes
- Tree-based cryptographic access control
- Supporting dynamic updates in storage clouds with the Akl-Taylor scheme
- Enforcing the security of a time-bound hierarchical key assignment scheme
- On the relations between security notions in hierarchical key assignment schemes for dynamic structures
- Provably Secure Key Assignment Schemes from Factoring
- Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants
- A model of hierarchical key assignment scheme
- A novel cryptographic key assignment scheme with ID-based access control in a hierachy
- Provably-secure time-bound hierarchical key assignment schemes
- scientific article; zbMATH DE number 2080181 (Why is no real title available?)
- Transitive-closure spanners: a survey
- Hierarchical key assignment with dynamic read-write privilege enforcement and extended KI-security
- Efficient provably-secure hierarchical key assignment schemes
- New constructions for provably-secure time-bound hierarchical key assignment schemes
This page was built for publication: Efficient Provably-Secure Hierarchical Key Assignment Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525584)