Dynamic and efficient key management for access hierarchies

ACM Transactions on Information and System Security

Volumn 12, Issue 3, 2009, Pages

  Atallah, Mikhail J ^a,e   Blanton, Marina ^b   Fazio, Nelly ^c   Frikken, Keith B ^d  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c IBM RESEARCH   (United States)

^d MIAMI UNIVERSITY   (United States)

^e Purdue University   (United States)

Author keywords

Efficient key derivation; Hierarchical access control; Key management

Indexed keywords

DIRECTED GRAPHS; EFFICIENT KEY DERIVATION; HIERARCHICAL ACCESS CONTROL; KEY MANAGEMENT; PRIVATE INFORMATIONS; PROVABLY SECURE; PSEUDO-RANDOM FUNCTIONS; PUBLIC INFORMATIONS; RANDOM ORACLE MODELS; SPACE COMPLEXITY; SYMMETRIC KEYS;

GRAPH THEORY; SECURITY SYSTEMS;

ACCESS CONTROL;

EID: 60349128962     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/1455526.1455531     Document Type: Article

References (72)

1. AKL, S. AND TAYLOR, P. 1983. Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1, 3 (Sept.), 239-248.
2. ALON, N. AND SCHIEBER, B. 1987. Optimal preprocessing for answering on-line product queries. Tech. rep. TR 71/87, Institute of Computer Science, Tel-Aviv University.
3. ANDERSON, R. AND KUHN, M. 1996. Tamper resistance - a cautionary note. In Proceedings of the USENIX Workshop on Electronic Commerce (EC'96). 1-11.
4. ANDERSON, R. AND KUHN, M. 1997. Low cost attacks on tamper resistant devices. In Proceedings of the Security Protocols Workshop. Lecture Notes on Computer Science, vol. 1361. 125-136.
5. ATALLAH, M., FRIKKEN, K., AND BLANTON, M. 2005. Dynamic and efficient key management for access hierarchies. In Proceedings of the ACM Conference on Computer and Communications Security (CCS'05). 190-201.
6. BELL, D. AND LAPADULA, L. 1973. Secure computer systems: Mathematical foundations. Tech. rep. MTR-2547, MITRE Corporation.
7. BELLARE, M., CANETTI, R., AND KRAWCZYK, H. 1996. Keying hash functions for message authentication. In Proceedings of the Annual International Cryptology Conference (CRYPTO'96), vol. 1109. 1-15.
8. BIRGET, J., ZOU, X., NOUBIR, G., AND RAMAMURTHY, B. 2001. Hierarchy-based access control in distributed environments. In Proceedings of the IEEE International Conference on Communications (ICC'01). 229-233.
9. BODLAENDER, H., TEL, G., AND SANTORO, N. 1994. Trade-offs in non-reversing diameter. Nordic J. Comput. 1, 111-134.
10. CHANG, C. AND BUEHRER, D. 1993. Access control in a hierarchy using a one-way trapdoor function. Comput. Math. Appl. 26, 5, 71-76.
11. CHANG, C., LIN, I., TSAI, H., WANG, H., AND TAICHUNG, T. 2004. A key assignment scheme for controlling access in partially ordered user hierarchies. In Proceedings of the International Conference on Advanced Information Networking and Application (AINA'04). 376-378.
12. CHAZELLE, B. 1987. Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337-361.
13. CHEN, T. AND CHUNG, Y. 2002. Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Comput. Secur. 565-570.
14. CHEN, T., CHUNG, Y., AND TIAN, C. 2004. A novel key management scheme for dynamic access control in a user hierarchy. In Proceedings of the IEEE Annual International Computer Software and Applications Conference (COMPSAC'04). 396-401.
15. CHICK, G. AND TAVARES, S. 1990. Flexible access control with master keys. In Proceedings of the Proceedings of the Annual International Cryptology Conference (CRYPTO'96). Lecture Notes on Computer Science, vol. 435. 316-322.
16. CHIEN, H. AND JAN, J. 2003. New hierarchical assignment without public key cryptography. Comput. Secur. 22, 6, 523-526.
17. CHOU, J., LIN, C., AND LEE, T. 2004. A novel hierarchical key management scheme based on quadratic residues. In Proceedings of the International Symposium on Parallel and Distributed Processing and Applications (ISPA'04). Vol. 3358. 858-865.
18. CRAMER, R. AND SHOUP, V. 2003. Design and analysis of practical public-key encryption scheme secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33, 1, 167-226.
19. CRAMPTON, J. 2003. On permissions, inheritance and role hierarchies. In ceedings of the ACM Conference on Computer and Communications Security (CCS'03). 85-92.
20. DAS, M., SAXENA, A., GULATI, V., AND PHATAK, D. 2005. Hierarchical key management scheme using polynomial interpolation. SIGOPS Oper. Syst. Rev. 39, 1, 40-47.
21. DE SANTIS, A., FERRARA, A., AND MASUCCI, B. 2007. Efficient provably-secure hierarchical key assignment schemes. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS'07). Lecture Notes on Computer Science, vol. 4708. 371-382.
22. DENNING, D., AKL, S., MORGENSTERN, M., AND NEUMANN, P. 1986. Views for multilevel database security. In Proceedings of the IEEE Symposium on Security and Privacy (SP'86). 156-172.
23. DODIS, Y., FAZIO, N., KIAYIAS, A., AND YUNG, M. 2005. Scalable public-key tracing and revoking. J. Dist. Comput. 17, 4, 323-347.
24. DUSHNIK, B. AND MILLER, E. 1941. Partially ordered sets. American Journal of Mathematics 63, 600-610.
25. ELKIN, M. AND PELEG, D. 2005. Approximating k-spanner problems for k 2. Theor. Comput. Sci. 337, 1-3, 249-277.
26. FERRAIOLO, D. AND KUHN, D. 1992. Role based access control. In Proceedings of the National Computer Security Conference (NISSC'92). 554-563.
27. FEEEAEA, A. AND MASUCCI, B. 2003. An information-theoretic approach to the access control problem. In Proceedings of the Italian Conference on Theoretical Computer Science (ICTCS'03). vol. 2841. 342-354.
28. FEAIM, L. 1983. Scomp: A solution to multilevel security problem. IEEE Comput. 16, 7, 126-143.
29. GOLDREICH, O. 2004. Foundations of Cryptography. Vol. 2. Basic Applications.
30. HAREL, D. AND TARJAN, R. 1984. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 2, 338-355.
31. HAEN, L. AND LIN, H. 1990. A cryptographic key generation scheme for multilevel data security. Comput. Secur. 9, 6, 539-546.
32. HE, M., FAN, P., KADERALI, F., AND YUAN, D. 2003. Access key distribution scheme for levelbased hierarchy. In Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'03). 942-945.
33. HUANG, H. AND CHANG, C. 2004. A new cryptographic key assignment scheme with timeconstraint access control in a hierarchy. Comput. Stand. Interfaces 26, 159-166.
34. HWANG, M. 1999a. An improvement of novel cryptographic key assignment scheme for dynamic access control in a hierarchy. IEICE Trans. Fundam. E82-A, 2 (Mar.), 548-550.
35. HWANG, M. 1999b. A new dynamic key generation scheme for access control in a hierarchy. Nordic J. Comput. 6, 4, 363-371.
36. HWANG, M. AND YANG, W. 2003. Controlling access in large partially ordered hierarchies using cryptographic keys. J. Syst. Softw. 67, 2 (Aug.), 99-107.
37. LIAW, H., WANG, S., AND LEI, C. 1993. A dynamic cryptographic key assignment scheme in a tree structure. Comput. Math. Appl. 25, 6, 109-114.
38. LIN, C. 2001. Hierarchical key assignment without public-key cryptography. Comput. Secur. 20, 7, 612-619.
39. LIN, I., HWANG, M., AND CHANG, C. 2003. A new key assignment scheme for enforcing complicated access control policies in hierarchy. Future Gen. Comput. Syst. 19, 4, 457-462.
40. LU, W. AND SUNDARESHAN, M. 1988. A moredle for multilevel security in computer networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'88). 1095-1104.
41. MACKINNON, S., TAYLOR, P., MEIJER, H., AND AKL, S. 1985. An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. 34, 9, 797-802.
42. MAHESHWARI, P. 2003. Enterprise application integration using a component-based architecture. In Proceedings of the IEEE Annual International Computer Software and Applications Conference (COM-SAC'03). 557-563.
43. MCHUGH, J. AND MOORE, A. 1986. A security policy and formal top level specification for a multilevel secure local area network. In Proceedings of the IEEE Symposium on Security and Privacy (SP'86). 34-49.
44. OHTA, K., OKAMOTO, T., AND KOYAMA, K. 1991. Membership authentication for hierarchical multigroups using the extended fiat-shamir scheme. In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT'91). 446-457.
45. OVERMARS, M. AND VAN LEEUWEN, J. 1981a. Dynamization of order decomposable set problems. J. Algorithms 2, 3, 245-260.
46. OVERMARS, M. AND VAN LEEUWEN, J. 1981b. Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23, 2, 166-204.
47. PELEG, D. AND SCHAEFFER, A. 1989. Graph spanners. Theor. Comput. Sci. 13, 99-116.
48. RAY, I., RAY, I., AND NARASIMHAMURTHI, N. 2002. A cryptographic solution to implement access control in a hierarchy and more. In Proceedings of the ACM Symposium on Access Control Models and Technologies (SACMAT'02). 65-73.
49. ROSE, J. AND GASTEIGER, J. 1994. Hierarchical classification as an aid to database and hitlist browsing. In Proceedings of the International Conference on Information and Knowledge Management (CIKM'94). 408-414.
50. SANDHU, R. 1987. On some cryptographic solutions for access control in a tree hierarchy. In Proceedings of the Fall Joint Computer Conference on Exploring Technology: Today and Tomorrow (CSC-ER'87). 405-410.
51. SANDHU, R. 1988. Cryptographic implementation of a tree hierarchy for access control. Inform. Process. Lett. 27, 2 (Jan.), 95-98.
52. SANDHU, R., COYNE, E., FEINSTEIN, H., AND YOUMAN, C. 1996. Role-based access control models. IEEE Comput. 29, 2, 38-47.
53. SANTIS, A. D., FERRARA, A., AND MASUCCI, B. 2004. Cryptographic key assignment schemes for any access control policy. Inform. Process. Lett. 92, 4 (Nov.), 199-205.
54. SCHNYDER, W. 1989. Planar graphs and poset dimension. Order 5, 323-343.
55. SHEN, V. AND CHEN, T. 2002. A novel key management scheme based on discrete logarithms and polynomial interpolations. Comput. Secur. 21, 2, 164-171.
56. SUN, Y. AND LIU, K. 2004. Scalable hierarchical access control in secure group communications. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04). 1296-1306.
57. THORUP, M. 1992. On shortcutting digraphs. In Proceedings of the International Workshop on Graph=Theoretic Concepts in Computer Science (WG'92). 205-211.
58. THORUP, M. 1995. Shortcutting planar digraphs. Comb. Probab. Comput. 4, 287-315.
59. THORUP, M. 1997. Parallel shortcutting of rooted trees. J. Algorithms 23, 1, 139-159.
60. TROTTER, W. 1992. Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins University Press, Baltimore, MD.
61. TSAI, H. AND CHANG, C. 1995. A cryptographic implementation for dynamic access control in a user hierarchy. Comput. Secur. 14, 2, 159-166.
62. TZENG, W. 2002. A time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE Trans. Knowl. Data Eng. 14, 1, 182-188.
63. VAN LEEUWEN, J. AND OVERMARS, M. 1981. The art of dynamizing. Math. Found. Comp. Sci. 121-131.
64. WU, J. AND WEI, R. 2004. An access control scheme for partially ordered set hierarchy with provable security. Cryptology ePrint Archive, Report 2004/295. http://eprint.iacr.org/.
65. WU, T. AND CHANG, C. 2001. Cryptograpic key assignment scheme for hierarchical access control. Int. J. Comput. Syst. Sci. Eng. 1, 1, 25-28.
66. YANNAKAKIS, M. 1982. The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3, 351-358.
67. YAO, A. 1982. Space-time tradeoff for answering range queries. In Proceedings of the ACM Symposium on Theory of Computing (STOC'82). 128-136.
68. YEH, J., CHOW, R., AND NEWMAN, R. 1998. A key assignment for enforcing access control policy exceptions. In Proceedings of the International Symposium on Internet Technology. 54-59.
69. ZHANG, Q. AND WANG, Y. 2004. A centralized key management scheme for hierarchical access control. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM'04). 2067-2071.
70. ZHENG, Y., HARDJONO, T., AND PIEPRZYK, J. 1992. Sibling intractable function families and their applications. In Proceedings of Advances in Cryptology (ASIACRYPT'91). Lecture Notes on Computer Science, vol. 739. 124-138.
71. ZHENG, Y., HARDJONO, T., AND SEBERRY, J. 1993. New solutions to the problem of access control in a hierarchy. Tech. rep. Department of Computer Science, University of Wollongong.
72. ZHONG, S. 2002. A practical key management scheme for access control in a user hierarchy. Comput. Secur. 21, 8, 750-759.