A practical key management scheme for access control in a user hierarchy

Computers and Security

Volumn 21, Issue 8, 2002, Pages 750-759

  Zhong, Sheng ^a  

^a Yale University   (United States)

Author keywords

Access control; Hash function; Key management; Randomization; User hierarchy

Indexed keywords

DATA STORAGE EQUIPMENT; INFORMATION MANAGEMENT; SECURITY OF DATA; TOPOLOGY;

KEY MANAGEMENT;

HIERARCHICAL SYSTEMS;

EID: 0036920852     PISSN: 01674048     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-4048(02)00815-5     Document Type: Article

References (32)

1. Dorothy E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-243, 1976.
2. D.E. Denning, S.G. Akl, M. Morgenstern, and P.G. Neumann. Views for multilevel database security. In 1986 IEEE Computer Society Symposium on Security and Privacy, pages 156-172. IEEE, 1986.
3. W.P. Lu and M.K. Sundareshan. A model for multilevel security in computer networks. In INFOCOM, pages 1095-1104, 1988.
4. K. Ohta, T. Okamoto, and K. Koyama. Membership authentication for hierarchical multi-groups using the extended Fiat-Sharnir scheme. In Advances in Cryptology - Proceedings of CRYPTO 90, volume 473 of Lecture Notes in Computer Science, pages 446-457, 1991.
5. K. Siil. Adaptive applications to multilevel secure UNIX systems. In 7th International Conference and Exhibition on Information Security, 1991.
6. Selim G. Akl and Peter D. Taylor. Cryptographic solution in a multilevel security problem. In CRYPTO '82, pages 237-459, 1983.
7. Selim G. Akl and Peter D. Taylor. Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems, 1(3):239-248, 1983.
8. Stephen J. MacKinnon, Peter D. Taylor, Henk Meijer, and Selim G. Akl. An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers, 34(0):797-802, 1985.
9. Ravi S. Sandhu. Cryptographic implementation of a tree hierarchy for access control, Information Processing Letters, 27(2):95-98, 1988.
10. G.C. Chick and S.E. Tavares. Flexible access control with master keys. In Advances in Cryptology - Proceedings of CRYPTO 89, volume 435 of Lecture Notes in Computer Science, pages 316-322, 1990.
11. L. Ham and H.Y. Lin. A cryptographic key generation scheme for multilevel data security. Computers and Security, 9:539-546, 1990.
12. C.S. Laih and T. Hwang. A brach orientated key management solution to dynamic access control in a hierarchy. In IEEE Symposium on Applied Computing, pages 422-429, 1991.
13. C.C. Chang, R.J. Hwang, and T.C. Wu. Cryptographic key assignment scheme for access control in a hierarchy. Information Systems, 17(3):243-247, 1992.
14. C.C. Chang and D.J. Buehrer. Access control in a hierarchy using a one-way trap door function. Computers and Mathematics with Applications, 26(5):71-76, 1993.
15. Y. Zheng, T. Hardjono, and J. Seberry. New solutions to the problem of access control in a hierarchy. http://citeseer.nj.nec.com/28503.html, 1993.
16. T.C. Wu and C.C. Chang. Controlling access in tree hierarchies. Information Sciences, 78:69-76, 1994.
17. H.M. Tsai and C.C. Chang. A cryptographic implementation for dynamic access control in a user hierarchy. Computers and Security, 14:159-166, 1995.
18. T.C. Wu, T.S. Wu, and W.H. He. Dynamic access control scheme based on the chinese remainder theorem. Computer Systems Science and Engineering, (2):92-99, 1995.
19. C.H. Lin. Dynamic key management schemes for access control in a hierarchy. Computer Communications, 29:1381-1385, 1997.
20. V.R.L. Shen, T.S. Chen, and F. Lai. Modified cryptographic key assignment scheme for a group-oriented user hierarchy. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A(10):2032-2034, 1997.
21. V.R.L. Shen, T.S. Chen, and F. Lai. Novel cryptographic key assignment scheme for dynamic access control in a hierarchy. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A(10):2035-2037, 1997.
22. N.Y. Lee and T. Hwang. Comments on 'dynamic key management schemes for access control in a hierarchy'. Computer Communications, 22:87-89, 1999.
23. X. Zou, B. Ramamurthy, and S.S. Magliveras. Chinese remainder theorem based hierarchical access control for secure group communication. In ICICS '01, volume 2229 of Lecture Notes in Computer Science, pages 381-385, 2001.
24. V.R.L. Shen, T.S. Chen, and F. Lai. A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers and Security, 21(2):164-171, 2002.
25. Y. Zheng, T. Hardjono, and J. Pieprzvk. Sibling intractable function families and their applications. In Advances in Cryptology - Proceedings of Asiacrypt '91, volume 739 of Lecture Notes in Computer Science, pages 124-138, 1992.
26. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vodhan, and Ke Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 1-18, 2001.
27. O. Goldreich, S. Goldwasser and S. Micali. On the cryptopgrahic applications of random functions. In Advances in Cryptology - Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 276-288, 1985.
28. O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33:792-807, 1986.
29. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology - Proceedings of CRYPTO 86, volume 263 of Lecture Notes in Computer Science, pages 186-194, Springer-Verlag, 1987.
30. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc, First Annual Conference on Computer and Communications Security. ACM, 1993.
31. R. Rivest. The MD5 message-digest algorithm. RFC 1321, 1992.
32. Federal information Processing Standards Publication 180-1. Secure hash standard, 1995.