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

Authors: Chin-Chen Chang, Iuon-Chang Lin, Hui-Min Tsai

Addresses: 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

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.

Keywords: access control; interpolating method; user hierarchy; user relationships; polynomials; cryptography; information security.

DOI: 10.1504/IJHPCN.2005.009425

International Journal of High Performance Computing and Networking, 2005 Vol.3 No.5/6, pp.378 - 384

Published online: 31 Mar 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article