A dynamic mechanism for determining relationships in a partially ordered user hierarchy

Authors:
Chin-Chen Chang;Iuon-Chang Lin;Hui-Min Tsai
Affiliations:
Department of Information Engineering and Computer Science, Feng Chia University, No. 100, Wenhwa Rd., Seatwen, Taichung, Taiwan 40724, ROC.;Department of Management Information Systems, National Chung Hsing University, 250 Kuo Kuang Road, Taichung, Taiwan 402, ROC.;Department of Computer Science and Information Engineering, National Chung Cheng University, 168, University Rd., Min-Hsiung Chia-Yi, Taiwan, ROC
Venue:
International Journal of High Performance Computing and Networking
Year:
2005

Citing 8
Cited 0

A single-key access control scheme in information protection systems

Information Sciences: an International Journal
A survey of key-to-key user hierarchic representation mechanisms

Journal of Information Processing
A scheme to determine the relationship between two users in a hierarchy

Computers and Security
A binary access control method using prime factorization

Information Sciences: an International Journal
A novel access control method using Morton number and prime factorization

Information Sciences: an International Journal
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
A new key assignment scheme for enforcing complicated access control policies in hierarchy

Future Generation Computer Systems - Selected papers from CCGRID 2002
Key assignment for enforcing access control policy exceptions in distributed systems

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 to or deleted from the user hierarchy, none or only some relevant polynomial needs to be updated, differing from the previously proposed schemes where the information needs to be reconstructed all over.