|
Published Articles >> Table of Contents >> Abstract
18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1
p. 133
A Dynamic Mechanism for Determining Relationships in a Partially Ordered User Hierarchy
Chin-Chen Chang, National Chung Cheng University, Taiwan
Iuon-Chang Lin, National Chung Cheng University, Taiwan
Hui-Min Tsai, National Chung Cheng University, Taiwan
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2004.1283900
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Citation:
Chin-Chen Chang, Iuon-Chang Lin, Hui-Min Tsai,
"A Dynamic Mechanism for Determining Relationships in a Partially Ordered User Hierarchy,"
aina,
p. 133,
18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1,
2004
|
|
