Yet another efficient access control for user hierarchy

研究成果: Paper同行評審

摘要

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.

原文English
頁面496-501
頁數6
出版狀態Published - 1995 12月 1
事件Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology - Sanderstead, Engl
持續時間: 1995 10月 181995 10月 20

Other

OtherProceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology
城市Sanderstead, Engl
期間95-10-1895-10-20

All Science Journal Classification (ASJC) codes

  • 工程 (全部)

指紋

深入研究「Yet another efficient access control for user hierarchy」主題。共同形成了獨特的指紋。

引用此