2010 13th International Conference on Network-Based Information Systems 2010
DOI: 10.1109/nbis.2010.95
|View full text |Cite
|
Sign up to set email alerts
|

A Low-Cost Key Derivation Scheme for Hierarchy-Based Access

Abstract: In current content delivery service, contents are usually encrypted for access control mechanism, so several key distribution schemes have been proposed. In this paper, we propose a new key derivation scheme for hierarchy-based access control. We assume that content consumers are listed in digraph structure, and all nodes are assigned seeds(prekeys) for decryption keys. All decryption keys are generated from initial keys assigned in root nodes, and a decryption key is derived from seeds of an ancestor node onl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2011
2011
2012
2012

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…In this efficient scheme [14], key data of nodes on a given directed acyclic graph are derivated from only m initial master keys and any node keys are derived from key data of only parent and ancestor nodes. A similar concept "one-way crosstrees" [5] defers this scheme because reference [14] considers and shows a countermeasure against collusion attacks by malicious nodes on a given directed graph.…”
Section: C) Efficient Key Derivation Schemes In Lattice Graphmentioning
confidence: 99%
See 2 more Smart Citations
“…In this efficient scheme [14], key data of nodes on a given directed acyclic graph are derivated from only m initial master keys and any node keys are derived from key data of only parent and ancestor nodes. A similar concept "one-way crosstrees" [5] defers this scheme because reference [14] considers and shows a countermeasure against collusion attacks by malicious nodes on a given directed graph.…”
Section: C) Efficient Key Derivation Schemes In Lattice Graphmentioning
confidence: 99%
“…A similar concept "one-way crosstrees" [5] defers this scheme because reference [14] considers and shows a countermeasure against collusion attacks by malicious nodes on a given directed graph.…”
Section: C) Efficient Key Derivation Schemes In Lattice Graphmentioning
confidence: 99%
See 1 more Smart Citation
“…[12] [13] The key is never retained on the hard drive, so the attacker can not obtain it without deriving from the password again. The extra time cost (e.g., 1 second) by once key derivation operation is acceptable when the legitimate user activates Cloud Shredder, but the extra time cost will be accumulated to a significant value when the attacker carries out brutal force trial on the password.…”
Section: B Cloud Interfacementioning
confidence: 99%