loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1
A Dynamic Mechanism for Determining Relationships in a Partially Ordered User Hierarchy
Fukuoka, Japan
March 29-March 31
ISBN: 0-7695-2051-0
Chin-Chen Chang, National Chung Cheng University, Taiwan
Iuon-Chang Lin, National Chung Cheng University, Taiwan
Hui-Min Tsai, National Chung Cheng University, Taiwan
In a protection system, some mechanism is needed for determining the relationship between any two users so as to be used to help the decision making requests to change access attributes. In this paper, we propose a mechanism in the partially ordered user hierarchy, instead of the tree hierarchy discussed till now, by assigning each user an interpolating polynomial constructed from the user's own id number and his fathers'. In this way, any two users' relationship can be quickly determined from evaluating their associated polynomials. Moreover, whenever a new user is added into or deleted from the user hierarchy, none or only some relevant polynomial needs to be updated, different from allover the information needs to be reconstructed as shown in the previously proposed schemes.
Citation:
Chin-Chen Chang, Iuon-Chang Lin, Hui-Min Tsai, "A Dynamic Mechanism for Determining Relationships in a Partially Ordered User Hierarchy," aina, vol. 1, pp.133, 18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.