Trust-management (TM) languages need a declarative and formal foundation. Although Datalog was used in several TM languages and has been the best logical foundation for TM languages to date, Datalog does not meet the practical need for policies about common structured resources, such as file hierarchies. By using ideas from the field of constraint databases, we showed that Datalog extended with constraints is a promising and expressive alternative that eliminates some deficiencies of Datalog without sacrificing any of the attractive features that make Datalog appealing for trust management. This is joint work with John Mitchell.
Trust management has delegation as its key power. Because one organization may delegate partial control to another organization, it is natural to ask what permissions may be granted as the result of policy changes by other organizations. We studied security properties such as safety and availability in the RT framework using a trust-management model. We showed that many properties can be determined efficiently using logic programs, and proved that the most complicated cases are decidable but intractable. These results are somewhat surprising. In Harrison, Ruzzo, and Ullman 1976, it was shown that a basic form of safety analysis in the context of the well-known access matrix model is undecidable. Our trust-management model is more powerful in certain ways than the HRU access matrix model, and the security properties we considered are more than simple safety. In our paper, we explained the differences between the HRU model and our TM model.