A Novel Cryptographic Key Assignment Scheme with ID-Based Access Control in a Hierachy

• Autorzy: Huang H-F. , Chang C-C.
• Języki publikacji: EN

Abstrakty

EN

The hierarchical cryptographic key assignment is used to assign cryptographic keys to a set of partially ordered classes so that the user in a higher class can derive the cryptographic key for users in a lower class. However, the existing secure schemes for the cryptographic key assignment in a hierarchy do not consider the situation where a user may be employed for only a period of time. If a user resigned from his position and he premeditatedly eavesdrops on data transmissions, then he can also decrypt some data to obtain useful messages. Thus, all messages are likely to be compromised throughout the system. In this paper, we propose a new cryptographic key assignment scheme in which the cryptographic keys are generated from the identity number of users. Our aim is to minimize the potential damage over a public network. Therefore, as a user who has resigned from his class premeditatedly eavesdrops on later messages, he cannot decrypt the message with his old keys. Moreover, in the proposed method, the key generation and key derivation are quite simple, and the number of the public/secret parameters for each authenticated user is fixed which differs from most previously proposed schemes.

Słowa kluczowe

EN

access control; cryptographic key assignment

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 84, nr 3-4
• Strony: 353--361
• Opis fizyczny: bibliogr. 11 poz.

Twórcy

autor

Huang H-F.

autor

Chang C-C.

• Department of Information Management, National Taichung Institute of Technology, Taichung, Taiwan 404, R.O.C.,

Bibliografia

• [1] S. G. Akl and P. D. Taylor, "Cryptographic Solution to a Problem of Access Control in a Hierarchy", ACM Transactions on Computer Systems, vol. 1, no. 3, pp. 239-248, 1983
• [2] S. J. Mackinnon, P. D. Taylor, H. Heijer and S. G. Akl, "An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy", IEEE Transactions on Computers, vol. 34, no. 9, pp. 797-802,1985.
• [3] R. S. Sandhu, "Cryptographic Implementation of a Tree Hierarchy for Access Control", Information Processing Letters, no. 27, pp. 95-98, 1988.
• [4] L. Harn and H. Y. Lin, "A Cryptographic Key Generation Scheme for Multilevel Data Security", Computers and Security, vol. 9, no. 6, pp. 539-546,1990.
• [5] C. C. Chang, R. J. Hwang, and T.C. Wu, "Cryptographic Key Assignment Scheme for Access Control in a Hierarchy", Information Systems, vol. 17, no. 3, pp. 243-247, 1992.
• [6] F. H. Kuo, V. R. L. Shen, T. S. Chen and F. Lai, "Cryptographic Key Assignment Scheme for Dynamic Access Control in a User Hierarchy", IEE Proceedings-Computers and Digital Techniques, vol. 146, no. 5, pp. 235-240, Sept 1999.
• [7] D.P. Maher, "Crypto Backup and Key Escrow", Communications of ACM, vol. 39, no. 3, pp. 48-53, 1996.
• [8] R.L. Rivest, A. Shamir and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of ACM, vol. 21, no. 2, pp. 120-126, February 1978.
• [9] W. G. Tzeng, "A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy", IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 1, pp. 182-188, Jan/Feb 2002.
• [10] X. Yi, "Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy", IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 1054-1055, July/Aug 2003.
• [11] J. Wu and R. Wei, "An access control scheme for partially ordered set hierarchy with provable security", Selected Areas in Cryptograph, pp. 221-232, 2005