Efficient provably-secure hierarchical key assignment schemes
type: Item
instance of: scholarly article
title: Efficient provably-secure hierarchical key assignment schemes
zbMATH Open document ID: 1236.94074
author: Alfredo De Santis
author: Anna Lisa Ferrara
author: Barbara Masucci
published in: Theoretical Computer Science
publication date: 2011-10-10T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5955917
zbMATH Keywords: access control
zbMATH Keywords: key assignment
zbMATH Keywords: provable security
zbMATH Keywords: efficient key derivation
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.06.024
OpenAlex ID: W2036493810
cites work: The Transitive Reduction of a Directed Graph
cites work: Q4418523
cites work: Q4322074
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
cites work: Computing on a free tree via complexity-preserving mappings
cites work: Variations on a theme by Akl and Taylor: security and tradeoffs
cites work: Efficient Provably-Secure Hierarchical Key Assignment Schemes
cites work: New constructions for provably-secure time-bound hierarchical key assignment schemes
cites work: Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
cites work: Partially Ordered Sets
cites work: Probabilistic encryption
cites work: Q4471356
cites work: A cryptographic key assignment scheme in a hierarchy for access control
cites work: Generic Transformation for Scalable Broadcast Encryption Schemes
cites work: Selecting cryptographic key sizes
cites work: Characterization of security notions for probabilistic private-key encryption
cites work: A dynamic cryptographic key assignment scheme in a tree structure
cites work: Q4281646
cites work: Shortcutting Planar Digraphs
DOI: 10.1016/J.TCS.2011.06.024
description: scientific article; zbMATH DE number 5955917