Yet another efficient access control for user hierarchy

Tzone-Lih Hwang, Narn Yih Lee

Research output: Contribution to conferencePaper

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 languageEnglish
Pages496-501
Number of pages6
Publication statusPublished - 1995 Dec 1
EventProceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology - Sanderstead, Engl
Duration: 1995 Oct 181995 Oct 20

Other

OtherProceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology
CitySanderstead, Engl
Period95-10-1895-10-20

Fingerprint

Access control
Information systems

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Hwang, T-L., & Lee, N. Y. (1995). Yet another efficient access control for user hierarchy. 496-501. Paper presented at Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology, Sanderstead, Engl, .
Hwang, Tzone-Lih ; Lee, Narn Yih. / Yet another efficient access control for user hierarchy. Paper presented at Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology, Sanderstead, Engl, .6 p.
@conference{488180b193734c9ea54ac0ebc3a808b9,
title = "Yet another efficient access control for user hierarchy",
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.",
author = "Tzone-Lih Hwang and Lee, {Narn Yih}",
year = "1995",
month = "12",
day = "1",
language = "English",
pages = "496--501",
note = "Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology ; Conference date: 18-10-1995 Through 20-10-1995",

}

Hwang, T-L & Lee, NY 1995, 'Yet another efficient access control for user hierarchy', Paper presented at Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology, Sanderstead, Engl, 95-10-18 - 95-10-20 pp. 496-501.

Yet another efficient access control for user hierarchy. / Hwang, Tzone-Lih; Lee, Narn Yih.

1995. 496-501 Paper presented at Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology, Sanderstead, Engl, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Yet another efficient access control for user hierarchy

AU - Hwang, Tzone-Lih

AU - Lee, Narn Yih

PY - 1995/12/1

Y1 - 1995/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029510674&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029510674&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029510674

SP - 496

EP - 501

ER -

Hwang T-L, Lee NY. Yet another efficient access control for user hierarchy. 1995. Paper presented at Proceedings of the 29th Annual 1995 International Carnahan Conference on Security Technology, Sanderstead, Engl, .