Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Authorization Logic with Explicit Time Henry DeYoung Deepak Garg Frank Pfenning
 

Summary: An Authorization Logic with Explicit Time
Henry DeYoung Deepak Garg Frank Pfenning
Carnegie Mellon University
E-mail: hdeyoung@andrew.cmu.edu, {dg,fp}@cs.cmu.edu
Abstract
We present an authorization logic that permits reason-
ing with explicit time. Following a proof-theoretic ap-
proach, we study the meta-theory of the logic, including
cut elimination. We also demonstrate formal connections to
proof-carrying authorization's existing approach for han-
dling time and comment on the enforceability of our logic
in the same framework. Finally, we illustrate the expres-
siveness of the logic through examples, including those with
complex interactions between time, authorization, and mu-
table state.
1. Introduction
Most secure systems restrict operations that users, ma-
chines, and other principals can perform on files and other
resources. A reference monitor authorizes (or denies) re-
quests to access resources, in consultation with a set of rules

  

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