Department of Computer Science
University of Stuttgart
4pm Tuesday 11 February 2003
Room 2511, JCMB, King's Buildings
We define a framework in which one can formalize a variety of authorization and policy issues that arise in access control of shared computing resources. Instantiations of the framework address such issues as privacy, recency, validity, and trust. We present an efficient algorithm for solving the authorization problems in the framework. The algorithm is based on the theory of pushdown systems and a generalization of the shortest-path problem. The material presented in the talk is the result of joint work with Thomas Reps, Somesh Jha, and Stuart Stubblebine.