Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Stateful Authorization Logic Proof Theory and a Case Study
 

Summary: Stateful Authorization Logic
Proof Theory and a Case Study
Deepak Garg and Frank Pfenning
Carnegie Mellon University
{dg,fp}@cs.cmu.edu
Abstract. Authorization policies can be conveniently represented and
reasoned about in logic. Proof theory is important for many such appli-
cations of logic. However, so far, there has been no systematic study of
proof theory that incorporates system state, upon which access policies
often rely. The present paper fills this gap by presenting the design and
proof theory of an authorization logic BL that, among other features,
includes direct support for external procedures to verify predicates on
system state. We discuss design choices in the interaction between state
and other features of the logic and validate the logic both foundationally,
by proving relevant metatheoretic properties of the logic's proof system,
and empirically, through a case study of policies that control access to
sensitive intelligence information in the U.S.
Keywords: Authorization logic, proof theory, stateful policies, case study
1 Introduction
Many authorization policies rely on conditions that are controlled by the envi-

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Pfenning, Frank - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences; Mathematics