東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The Application of Graph Theory to A...

Brown, Eric.

FindBook

Google Book

Amazon

博客來

The Application of Graph Theory to Access Control Systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Application of Graph Theory to Access Control Systems./
作者:	Brown, Eric.
面頁冊數:	131 p.
附註:	Source: Masters Abstracts International, Volume: 52-06.
Contained By:	Masters Abstracts International52-06(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1554552
ISBN:	9781303853579

The Application of Graph Theory to Access Control Systems.
Brown, Eric.

The Application of Graph Theory to Access Control Systems. - 131 p.

Source: Masters Abstracts International, Volume: 52-06.

Thesis (M.S.)--University of Nebraska at Omaha, 2014.

Computer systems contain vital information that must be protected. One of the crucial aspects of protection is access control. A review of some of the research into ways in which access to the information in computers can be controlled focuses on a question about safety. The safety question asks, "Can a user ever gain access to a resource for which he is not authorized?" This question cannot be answered in general because of the unbounded, unrestricted nature of a general-purpose access control system. It can be answered only for systems that are specifically designed to restrict the actions that can be taken by users of a system so that all of its possible future states, with respect to a certain right `leaking' to an unauthorized user, can be predicted. There is a tension between the power to take useful actions within a system, and the ability to predict safety.

ISBN: 9781303853579Subjects--Topical Terms:

626642
Computer Science.

The Application of Graph Theory to Access Control Systems.
LDR:02844nam a2200289 4500 001 1966920
005 20141112075546.5
008 150210s2014 ||||||||||||||||| ||eng d
020 $a 9781303853579
035 $a (MiAaPQ)AAI1554552
035 $a AAI1554552
040 $a MiAaPQ $c MiAaPQ
100 1 $a Brown, Eric. $3 1269530
245 1 4 $a The Application of Graph Theory to Access Control Systems.
300 $a 131 p.
500 $a Source: Masters Abstracts International, Volume: 52-06.
500 $a Adviser: Victor Winter.
502 $a Thesis (M.S.)--University of Nebraska at Omaha, 2014.
520 $a Computer systems contain vital information that must be protected. One of the crucial aspects of protection is access control. A review of some of the research into ways in which access to the information in computers can be controlled focuses on a question about safety. The safety question asks, "Can a user ever gain access to a resource for which he is not authorized?" This question cannot be answered in general because of the unbounded, unrestricted nature of a general-purpose access control system. It can be answered only for systems that are specifically designed to restrict the actions that can be taken by users of a system so that all of its possible future states, with respect to a certain right `leaking' to an unauthorized user, can be predicted. There is a tension between the power to take useful actions within a system, and the ability to predict safety.
520 $a Another way to ensure safety is to express all of a system's security policies as constraints. Then the access control system itself can be unrestricted, but each action is checked to ensure that no security policy has been violated so far. These are very complex and difficult to manage and, therefore, are difficult systems for which to verify the safety property.
520 $a This thesis models an alternative access control system, consolidating disparate research and balancing expressive power and safety analysis. The system, called Graph Plus, uses a graph representation of the protection state. It has decidable safety algorithms, and many useful operations. The usefulness is further enhanced by combining the constraint philosophy with the restricted model philosophy into one hybrid system. Additional operations have been included that can be analyzed by the efficient safety algorithms of the underlying model. This safety analysis acts as a constraint upon the additional operations, so that safety can be retained even with the additional operations added to the model. The model and its implementation are described.
590 $a School code: 1060.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a University of Nebraska at Omaha. $b Computer Science. $3 1020791
773 0 $t Masters Abstracts International $g 52-06(E).
790 $a 1060
791 $a M.S.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1554552