Abstract
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.
Original language | English |
---|---|
Pages | 496-501 |
Number of pages | 6 |
Publication status | Published - 1995 Dec 1 |
Event | Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology - Sanderstead, Engl Duration: 1995 Oct 18 → 1995 Oct 20 |
Other
Other | Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology |
---|---|
City | Sanderstead, Engl |
Period | 95-10-18 → 95-10-20 |
All Science Journal Classification (ASJC) codes
- Engineering(all)