{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:46:32Z","timestamp":1772023592740,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Security"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0167-4048(02)00815-5","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T07:34:16Z","timestamp":1041060856000},"page":"750-759","source":"Crossref","is-referenced-by-count":32,"title":["A practical key management scheme for access control in a user hierarchy"],"prefix":"10.1016","volume":"21","author":[{"given":"Sheng","family":"Zhong","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-4048(02)00815-5_BIB1","doi-asserted-by":"crossref","unstructured":"Dorothy E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236\u2013243, 1976.","DOI":"10.1145\/360051.360056"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB2","doi-asserted-by":"crossref","unstructured":"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\u2013172. IEEE, 1986.","DOI":"10.1109\/SP.1986.10012"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB3","doi-asserted-by":"crossref","unstructured":"W. P. Lu and M. K. Sundareshan. A model for multilevel security in computer networks. In INFOCOM, pages 1095\u20131104, 1988.","DOI":"10.1109\/INFCOM.1988.13028"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB4","unstructured":"K. Ohta, T. Okamoto, and K. Koyama. Membership authentication for hierarchical multi-groups using the extended Fiat-Shamir scheme. In Advances in Cryptology- Proceedings of CRYPTO 90, volume 473 of Lecture Notes in Computer Science, pages 446\u2013457, 1991."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB5","unstructured":"K. Siil. Adaptive applications to multilevel secure UNIX systems. In 7th International Conference and Exhibition on Information Security, 1991."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB6","doi-asserted-by":"crossref","unstructured":"Selim G. Akl and Peter D. Taylor. Cryptographic solution in a multilevel security problem. In CRYPTO '82, pages 237\u2013459, 1983.","DOI":"10.1007\/978-1-4757-0602-4_23"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB7","doi-asserted-by":"crossref","unstructured":"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\u2013248, 1983.","DOI":"10.1145\/357369.357372"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB8","doi-asserted-by":"crossref","unstructured":"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\u2013802, 1985.","DOI":"10.1109\/TC.1985.1676635"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB9","doi-asserted-by":"crossref","unstructured":"Ravi S. Sandhu. Cryptographic implementation of a tree hierarchy for access control. Information Processing Letters, 27(2):95\u201398, 1988.","DOI":"10.1016\/0020-0190(88)90099-3"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB10","doi-asserted-by":"crossref","unstructured":"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\u2013322, 1990.","DOI":"10.1007\/0-387-34805-0_29"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB11","doi-asserted-by":"crossref","unstructured":"L. Harn and H. Y. Lin. A cryptographic key generation scheme for multilevel data security. Computers and Security, 9:539\u2013546, 1990.","DOI":"10.1016\/0167-4048(90)90132-D"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB12","unstructured":"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\u2013429, 1991."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB13","doi-asserted-by":"crossref","unstructured":"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\u2013247, 1992.","DOI":"10.1016\/0306-4379(92)90015-F"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB14","doi-asserted-by":"crossref","unstructured":"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\u201376, 1993.","DOI":"10.1016\/0898-1221(93)90075-7"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB15","unstructured":"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."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB16","doi-asserted-by":"crossref","unstructured":"T. C. Wu and C. C. Chang. Controlling access in tree hierarchies. Information Sciences, 78:69\u201376, 1994.","DOI":"10.1016\/0020-0255(94)90020-5"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB17","doi-asserted-by":"crossref","unstructured":"H. M. Tsai and C. C. Chang. A cryptographic implementation for dynamic access control in a user hierarchy. Computers and Security, 14:159\u2013166, 1995.","DOI":"10.1016\/0167-4048(95)97049-G"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB18","unstructured":"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\u201399, 1995."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB19","doi-asserted-by":"crossref","unstructured":"C. H. Lin. Dynamic key management schemes for access control in a hierarchy. Computer Communications, 29:1381\u20131385, 1997.","DOI":"10.1016\/S0140-3664(97)00100-X"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB20","unstructured":"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\u20132034, 1997."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB21","unstructured":"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\u20132037, 1997."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB22","doi-asserted-by":"crossref","unstructured":"N. Y. Lee and T. Hwang. Comments on 'dynamic key management schemes for access control in a hierarchy'. Computer Communications, 22:87\u201389, 1999.","DOI":"10.1016\/S0140-3664(98)00216-3"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB23","doi-asserted-by":"crossref","unstructured":"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\u2013385, 2001.","DOI":"10.1007\/3-540-45600-7_42"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB24","doi-asserted-by":"crossref","unstructured":"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\u2013171, 2002.","DOI":"10.1016\/S0167-4048(02)00211-0"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB25","unstructured":"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\u2013138, 1992."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB26","unstructured":"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 \u2014 Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 1\u201318, 2001."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB27","unstructured":"O. Goldreich, S. Goldwasser and S. Micali. On the cryptopgrahic applications of random functions. In Advances in Cryptology \u2014 Proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 276\u2013288, 1985."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB28","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33:792\u2013807, 1986.","DOI":"10.1145\/6490.6503"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB29","unstructured":"A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology \u2014 Proceedings of CRYPTO 86, volume 263 of Lecture Notes in Computer Science, pages 186\u2013194, Springer-Verlag, 1987."},{"key":"10.1016\/S0167-4048(02)00815-5_BIB30","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/168588.168596"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB31","doi-asserted-by":"crossref","unstructured":"R. Rivest. The MD5 message-digest algorithm. RFC 1321, 1992.","DOI":"10.17487\/rfc1321"},{"key":"10.1016\/S0167-4048(02)00815-5_BIB32","unstructured":"Federal Information Processing Standards Publication 180-1. Secure hash standard, 1995."}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404802008155?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404802008155?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T15:21:03Z","timestamp":1553959263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404802008155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":32,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0167404802008155"],"URL":"https:\/\/doi.org\/10.1016\/s0167-4048(02)00815-5","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}