Simple, efficient and strongly KI-secure hierarchical key assignment schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7779 LNCS, Issue , 2013, Pages 101-114

  Freire, Eduarda S V ^a   Paterson, Kenneth G ^a   Poettering, Bertram ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL POLICIES; FORWARD-SECURE; HIERARCHICAL KEY ASSIGNMENT; KEY DERIVATIONS; PSEUDO-RANDOM FUNCTIONS; PSEUDORANDOM GENERATORS; SECURITY MODEL; STORAGE REQUIREMENTS;

ACCESS CONTROL; POTASSIUM IODIDE;

CRYPTOGRAPHY;

EID: 84874338954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36095-4_7     Document Type: Conference Paper

References (27)

1. Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems 1(3), 239-248 (1983)
2. MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers 34(9), 797-802 (1985)
3. Harn, L., Lin, H.Y.: A cryptographic key generation scheme for multilevel data security. Computers & Security 9(6), 539-546 (1990)
4. Chen, T.S., Chung, Y.F.: Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Computers & Security 21(6), 565-570 (2002)
5. Shen, V., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security 21(2), 164-171 (2002)
6. Wu, T.C., Chang, C.C.: Cryptographic key assignment scheme for hierarchical access control. Int. Journal of Computer Systems Science and Engineering 16(1), 25-28 (2001)
7. Yeh, J.H., Chow, R., Newman, R.: A key assignment for enforcing access control policy exceptions. In: Int. Symposium on Internet Technology, pp. 54-59 (1998)
8. Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190-202 (2006)
9. Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: ACM Conference on Computer and Communications Security, pp. 288-297 (2006)
10. Tzeng, W.G.: A secure system for data access based on anonymous authentication and time-dependent hierarchical keys. In: ACM Symposium on Information, Computer and Communications Security, pp. 223-230 (2006)
11. Wang, S.Y., Laih, C.S.: An efficient solution for a time-bound hierarchical key assignment scheme. IEEE Transactions on Dependable and Secure Computing 3(1), 91-100 (2006)
12. De Santis, A., Ferrara, A.L., Masucci, B.: Efficient Provably-Secure Hierarchical Key Assignment Schemes. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 371-382. Springer, Heidelberg (2007)
13. Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12(3) (2009)
14. D'Arco, P., De Santis, A., Ferrara, A.L., Masucci, B.: Variations on a theme by Akl and Taylor: Security and tradeoffs. Theoretical Computer Science 411(1), 213-227 (2010)
15. Crampton, J., Daud, R., Martin, K.M.: Constructing Key Assignment Schemes from Chain Partitions. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV. LNCS, vol. 6166, pp. 130-145. Springer, Heidelberg (2010)
16. Freire, E.S.V., Paterson, K.G.: Provably Secure Key Assignment Schemes from Factoring. In: Parampalli, U., Hawkes, P. (eds.) ACISP 2011. LNCS, vol. 6812, pp. 292-309. Springer, Heidelberg (2011)
17. Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. J. Cryptology 25(2), 243-270 (2012)
18. Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: Computer Security Foundations Workshop, pp. 98-111 (2006)
19. Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1-15. Springer, Heidelberg (1996) (Pubitemid 126106226)
20. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231-262 (2004)
21. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing 15(2), 364-383 (1986)
22. Blum, M., Goldwasser, S.: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 289-299. Springer, Heidelberg (1985)
23. Bellare, M., Yee, B.S.: Forward-Security in Private-Key Cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 1-18. Springer, Heidelberg (2003)
24. Freire, E.S.V., Paterson, K.G., Poettering, B.: Simple, efficient and strongly KI-secure hierarchical key assignment schemes (2012), http://eprint.iacr.org/2012/645
25. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics 51(1), 161-166 (1950)
26. Dodis, Y., Gennaro, R., Håstad, J., Krawczyk, H., Rabin, T.: Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 494-510. Springer, Heidelberg (2004)
27. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792-807 (1986)