{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:17:50Z","timestamp":1771489070654,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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 &amp; Security"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0167-4048(03)00514-5","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T16:46:14Z","timestamp":1058892374000},"page":"453-456","source":"Crossref","is-referenced-by-count":21,"title":["Cryptanalyses and improvements of two cryptographic key assignment schemes for dynamic access control in a user hierarchy"],"prefix":"10.1016","volume":"22","author":[{"given":"Chien-Lung","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzong-Sun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-4048(03)00514-5_BIB1","unstructured":"Wu, T.C. and Chang, C.C., 2001. Cryptographic key assignment scheme for hierarchical access control. International Journal of Computer Systems Science and Engineering, Vol. 1 (1), 2001, pp. 25\u201328."},{"key":"10.1016\/S0167-4048(03)00514-5_BIB2","doi-asserted-by":"crossref","unstructured":"Shen, V.R.L. and Chen, T.S., 2002. A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security, Vol. 21 (2), 2002, pp. 164\u2013171.","DOI":"10.1016\/S0167-4048(02)00211-0"},{"key":"10.1016\/S0167-4048(03)00514-5_BIB3","unstructured":"Knuth, D.E., 1981. The art of computer programming, volume 2, seminumerical algorithms, 2nd Edition, Addison-Wesley, MA, 1981."},{"key":"10.1016\/S0167-4048(03)00514-5_BIB4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., 1981. Probabilistic algorithms in finite fields. 22nd Annual Symposium on Foundations of Computer Science, IEEE FOCS\u201981, 1981, pp. 394\u2013398.","DOI":"10.1109\/SFCS.1981.37"},{"key":"10.1016\/S0167-4048(03)00514-5_BIB5","unstructured":"Cohen, H., 1991. A course in computational algebraic number theory, Springer-Verlag, 1991."},{"key":"10.1016\/S0167-4048(03)00514-5_BIB6","doi-asserted-by":"crossref","unstructured":"Diffie, W. and Hellman, M., 1976. New directions in cryptography. IEEE Transactions on Information Theory, IT-22 (6), 1976, pp. 644\u2013654.","DOI":"10.1109\/TIT.1976.1055638"}],"container-title":["Computers &amp; Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404803005145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404803005145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T06:58:33Z","timestamp":1552805913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404803005145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0167404803005145"],"URL":"https:\/\/doi.org\/10.1016\/s0167-4048(03)00514-5","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}