Beyond proof-of-compliance: security analysis in trust management
Authors:
Open Access
- 1 May 2005
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 52 (3) , 474-514
Abstract
Trust management is a form of distributed access control that allows one principal to delegate some access decisions to other principals. While the use of delegation greatly enhances flexibility and scalability, it may also reduce the control that a principal has over the resources it owns. Security analysis asks whether safety, availability, and other properties can be maintained while delegating to partially trusted principals. We show that in contrast to the undecidability of classical Harrison--Ruzzo--Ullman safety properties, our primary security properties are decidable. In particular, most security properties we study are decidable in polynomial time. The computational complexity of containment analysis, the most complicated security property we study, varies according to the expressive power of the trust management language.Keywords
This publication has 19 references indexed in Scilit:
- Delegation logicACM Transactions on Information and System Security, 2003
- The Role of Trust Management in Distributed Systems Security1999
- Role-based access control modelsComputer, 1996
- A calculus for access control in distributed systemsACM Transactions on Programming Languages and Systems, 1993
- Authentication in distributed systemsACM Transactions on Computer Systems, 1992
- The schematic protection modelJournal of the ACM, 1988
- Towards a Theory of Declarative Knowledge1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- A Linear Time Algorithm for Deciding Subject SecurityJournal of the ACM, 1977
- Protection in operating systemsCommunications of the ACM, 1976