Efficient provably-secure hierarchical key assignment schemes

Theoretical Computer Science

Volumn 412, Issue 41, 2011, Pages 5684-5699

  Santis, Alfredo De ^a   Ferrara, Anna Lisa ^b   Masucci, Barbara ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Access control; Efficient key derivation; Key assignment; Provable security

Indexed keywords

BROADCAST ENCRYPTION SCHEMES; BUILDING BLOCKES; COMPUTATIONAL ASSUMPTIONS; DYNAMIC UPDATE; EFFICIENT KEY DERIVATION; ENCRYPTION KEY; HIERARCHICAL KEY ASSIGNMENT; INDISTINGUISHABILITY; KEY ASSIGNMENT; PRIVATE INFORMATION; PROVABLE SECURITY; PROVABLY SECURE; PUBLIC INFORMATION; PUBLIC KEYS; SYMMETRIC ENCRYPTION SCHEMES;

ACCESS CONTROL;

CRYPTOGRAPHY;

EID: 80052271043     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.06.024     Document Type: Article

References (34)

1. A.V. Aho, M.R. Garey, and J.D. Ullman The transitive reduction of a directed graph SIAM Journal on Computing 1 1972 131 137
2. S.G. Akl, and P.D. Taylor Cryptographic solution to a problem of access control in a hierarchy ACM Transactions on Computer Systems 1 3 1983 239 248
3. N. Alon, B. Schieber, Optimal preprocessing for answering on-line product queries, Technical Report TR 71/87, Institute of Computer Science, Tel-Aviv University, 1987.
4. M.J. Atallah, M. Blanton, N. Fazio, and K.B. Frikken Dynamic and efficient key management for access hierarchies ACM Transactions on Information and System Security 12 3 2009
5. M.J. Atallah, M. Blanton, K.B. Frikken, Dynamic and efficient key management for access hierarchies, in: Proc. of the 12th ACM Conference on Computer and Communications Security, CCS 2005, Alexandria, Virginia, USA, November 2005, pp. 190201.
6. M.J. Atallah, M. Blanton, K.B. Frikken, Key management for non-tree access hierarchies, in: Proc. of the 11th ACM Symposium on Access Control Models and Technologies, SACMAT 2006, Lake Tahoe, CA, USA, June 2006, pp. 1118. (Pubitemid 44300737)
7. G. Ateniese, A. De Santis, A.L. Ferrara, and B. Masucci Provably-secure time-bound hierarchical key assignment schemes Journal of Cryptology 2011 10.1007/s00145-010-9094-6 Preliminary version in Proc. of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, Virginia, USA, November 2006, pp. 288297
8. M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A concrete security treatment of symmetric encryption, in: Proc. of the 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 394403.
9. M. Bellare, and B.S. Yee Forward-security in private-key cryptography Proc. of Topics in Cryptology, CT-RSA 2003, San Francisco, CA, USA, April 2003 Lecture Notes in Computer Science vol. 2612 2003 1 18
10. H.L. Bodlaender, G. Tel, and N. Santoro Trade-offs in non-reversing diameter Nordic Journal on Computing 1 1994 111 134
11. D. Boneh, X. Boyen, and E. Goh Hierarchical identity-based encryption with constant size ciphertexts Proc. of Advances in Cryptology, Eurocrypt 2005, Aarhus, Denmark, May 2005 Lecture Notes in Computer Science vol. 3494 2005 440 456 (Pubitemid 41313968)
12. D. Boneh, C. Gentry, and B. Waters Collusion resistant broadcast encryption with short ciphertexts and private keys Proc. of Advances in Cryptology, Crypto 2005, Santa Barbara, CA, USA, August 2005 Lecture Notes in Computer Science vol. 3621 2005 258 275 (Pubitemid 43902118)
13. B. Chazelle Computing on a free tree via complexity-preserving mappings Algorithmica 2 1987 337 361
14. J. Crampton, K. Martin, P. Wild, On key assignment for hierarchical access control, in: Proc. of the 19th IEEE Computer Security Foundations Workshop, CSFW 2006, S. Servolo Island, Venice, Italy, July 2006, pp. 98111. (Pubitemid 46499720)
15. P. D'Arco, A. De Santis, A.L. Ferrara, and B. Masucci Variations on a theme by akl and taylor: security and tradeoffs Theoretical Computer Science 411 2010 213 227
16. A. De Santis, A.L. Ferrara, and B. Masucci Efficient provably-secure hierarchical key assignment schemes Proc. of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, Cesky Krumlov, Czech Republic, August 2007 Lecture Notes in Computer Science vol. 4708 2007 371 382 Extended version avail. as Rep. 2006/479 at the IACR Cryptology ePrint Archive
17. A. De Santis, A.L. Ferrara, and B. Masucci New constructions for provably-secure time-bound hierarchical key assignment schemes Theoretical Computer Science 407 13 2008 213 230
18. Y. Dodis, and N. Fazio Public key trace and revoke schemes secure against adaptive chosen ciphertext attacks Proc. of the 6th International Workshop on Theory and Practice in Public Key Cryptography, PKC 2003, Miami, Florida, January 2003 Lecture Notes in Computer Science vol. 2567 2003 100 115 (Pubitemid 137638345)
19. B. Dushnik, and E.W. Miller Partially ordered sets American Journal of Mathematics 63 1941 600 610
20. K. Fu, S. Kamara, T. Kohno, Key regression: enabling efficient key distribution for secure distributed storage, in: Proc. of Network and Distributed System Security Symposium, NDSS 2006, San Diego, CA, USA.
21. S. Goldwasser, and S. Micali Probabilistic encryption Journal of Computer and System Sciences 28 1984 270 299
22. L. Harn, and H.Y. Lin A cryptographic key generation scheme for multilevel data security Computers & Security 9 6 1990 539 546
23. W. Hesse, Directed graphs requiring large number of shortcuts, in: Proc. of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2003, Baltimore, Maryland, USA, January 2003, pp. 665669.
24. M.S. Hwang A cryptographic key assignment scheme in a hierarchy for access control Mathematical and Computational Modeling 26 1 1997 27 31
25. J.Y. Hwang, D.H. Lee, and J. Lim Generic transformation for scalable broadcast encryption schemes Proc. of Advances in Cryptology, Crypto 2005, Santa Barbara, CA, USA, August 2005 Lecture Notes in Computer Science vol. 3621 2005 276 292
26. A.K. Lenstra, and E.R. Verheul Selecting cryptographic key sizes Journal of Cryptology 14 4 2001 255 293 (Pubitemid 33770276)
27. J. Katz, and M. Yung Characterization of security notions for probabilistic private-key encryption Journal of Cryptology 19 2006 67 95 (Pubitemid 43023011)
28. H.T. Liaw, S.J. Wang, and C.L. Lei A dynamic cryptographic key assignment scheme in a tree structure Computers and Mathematics with Applications 25 6 1993 109 114
29. C.H. Lin Dynamic key management schemes for access control in a hierarchy Computer Communications 20 1997 1381 1385
30. S.J. MacKinnon, P.D. Taylor, H. Meijer, and S.G. Akl An optimal algorithm for assigning cryptographic keys to control access in a hierarchy IEEE Transactions on Computers C-34 9 1985 797 802 (Pubitemid 16494331)
31. R.S. Sandhu Cryptographic implementation of a tree hierarchy for access control Information Processing Letters 27 1988 95 98
32. M. Thorup On shortcutting digraphs Proc. of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '92, Wiesbaden-Naurod, Germany, June 1992 Lecture Notes in Computer Science vol. 657 1992 205 211
33. M. Thorup Shortcutting planar digraphs Combinatorics, Probability & Computing 4 1995 287 315
34. A.C. Yao, Space-time tradeoff for answering range queries, in: Proc. of the 14th annual ACM Symposium on the Theory of Computing, STOC 1982, San Francisco, CA, USA, May 1982, pp. 128136.