In 1992, Liaw and Lei proposed a scheme for determining relationships between users in a hierarchy in information systems. They mentioned that it is very difficult to add extra relationships into all previously proposed schemes. In this paper, we propose an efficient approach to solve this problem. The proposed scheme also has the following advantages. (1) The storage space required in the system is reduced from O(n2) to O(n). (2) New users and new relationships can be easily inserted into the system.
|出版狀態||Published - 1995 十二月 1|
|事件||Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology - Sanderstead, Engl|
持續時間: 1995 十月 18 → 1995 十月 20
|Other||Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology|
|期間||95-10-18 → 95-10-20|
All Science Journal Classification (ASJC) codes