By Topic

A key assignment scheme for controlling access in partially ordered user hierarchies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chin-Chen Chang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chaiyi, Taiwan ; Iuon-Chang Lin ; Hui-Min Tsai ; Hsiao-Hsi Wang

A key assignment scheme whose security is based on solving discrete logarithms is proposed to work out a solution on the access control problem in an arbitrary partially ordered user hierarchy. Each user is assigned a secret key used to efficiently derive his successors' secret key and assigned an encryption key at the same time used to encrypt his information items or files only. Thus, any user can freely change his own encryption key for some security reasons without caring about those security classes with lower clearances to make their information items been reenciphered. And moreover, make a security class be added into or deleted from the hierarchy without changing any issued keys.

Published in:

Advanced Information Networking and Applications, 2004. AINA 2004. 18th International Conference on  (Volume:2 )

Date of Conference:

29-31 March 2004