论文信息 - A Petri net representation of the Take-Grant model

A Petri net representation of the Take-Grant model

The Take-Grant model is formalised with a Petri net notation. It is shown that this approach offers a convenient way to deal with the problem of determining the cooperation required to share or steal rights. An algorithm is proposed that finds all rights that a subject can steal with the help of a given set of conspirators. With the Petri net abstraction, the problem can be solved in linear time. It is compared to another algorithm exposed in the literature that requires n/sup 2/ operations for a n subject graph. >

D. Marc

[1] Lawrence Snyder. Theft and Conspiracy in the Take-Grant Protection Model , 1981, J. Comput. Syst. Sci..

[2] S. H. von Solms,et al. Designing and implementation of a new security model , 1989 .

[3] Matt Bishop. Hierarchical Take-Grant Protection systems , 1981, SOSP.

[4] Richard J. Lipton,et al. A Linear Time Algorithm for Deciding Subject Security , 1977, JACM.

[5] Lawrence Snyder. On the synthesis and analysis of protection systems , 1977, SOSP '77.

[6] Butler W. Lampson,et al. A note on the confinement problem , 1973, CACM.

[7] Carl E. Landwehr,et al. Formal Models for Computer Security , 1981, CSUR.

[8] Lawrence Snyder,et al. Formal Models of Capability-Based Protection Systems , 1981, IEEE Transactions on Computers.

[9] Joachim Biskup. Some Variants of the Take-Grant Protection Model , 1984, Inf. Process. Lett..

[10] Jeffrey D. Ullman,et al. On protection in operating systems , 1975, SOSP.

[11] Theodore M. P. Lee. Statistical models of trust: TCBs vs. people , 1989, Proceedings. 1989 IEEE Symposium on Security and Privacy.

[12] Lawrence Snyder,et al. The transfer of information and authority in a protection system , 1979, SOSP '79.

[13] S. H. Von Solms,et al. Protection Graph Rewriting Grammars and the Take/Grant Security Model , 1988 .