DocumentCode :
2924814
Title :
Two simple schemes for access control
Author :
Chan, Man Yiu ; Yeung, Raymond W.
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
355
Abstract :
In an open information system, all the information in the system are known by the public. For such a system, the users are responsible for enciphering their own information in a way that they can be accessed by authorized users only. Let U={U1...,Un,) be the set of users in the system. Associated with each Ui is an authorization list Ai⊂U such that Ui can access the information of Uj if and only if Ui∈Aj. We propose two simple access control schemes. For the first scheme, for any 1⩽i,j,k⩽n, (Uk∈Aj and Uj∈Ai)≫⇒Uk∈Ai . In other words, if Uk can access the information of U j and Uj can access the information of Ui , then Uk can access the information of Ui. This is called hierarchical accessibility. For the second scheme, there is no constraint on the authorisation lists. To our knowledge, this is the first scheme in the literature that supports arbitrary accessibility
Keywords :
cryptography; information systems; open systems; access control; authorization list; encryption; hierarchical accessibility; open information system; Access control; Authorization; Information systems; Public key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.550342
Filename :
550342
Link To Document :
بازگشت