Sciweavers

13 search results - page 1 / 3
» Provably-secure time-bound hierarchical key assignment schem...
Sort
View
TCS
2008
13 years 4 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
ESORICS
2007
Springer
13 years 10 months ago
Incorporating Temporal Capabilities in Existing Key Management Schemes
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
CCS
2007
ACM
13 years 10 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport
CCS
2006
ACM
13 years 8 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...
CSFW
2006
IEEE
13 years 10 months ago
On Key Assignment for Hierarchical Access Control
A key assignment scheme is a cryptographic technique for implementing an information flow policy, sometimes known as hierarchical access control. All the research to date on key ...
Jason Crampton, Keith M. Martin, Peter R. Wild