An Authorization Logic With Explicit Time

Authors:
Henry DeYoung;Deepak Garg;Frank Pfenning
Affiliations:
-;-;-
Venue:
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Year:
2008

Citing 0
Cited 7

AURA: a programming language for authorization and audit

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
xDomain: cross-border proofs of access

Proceedings of the 14th ACM symposium on Access control models and technologies
Encoding information flow in Aura

Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
Encoding information flow in AURA

ACM SIGPLAN Notices
Security-typed programming within dependently typed programming

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Stateful authorization logic: proof theory and a case study

STM'10 Proceedings of the 6th international conference on Security and trust management
Stateful authorization logic --Proof theory and a case study

Journal of Computer Security - STM'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination. We also demonstrate formal connections to proof-carrying authorization's existing approach for handling time and comment on the enforceability of our logic in the same framework. Finally, we illustrate the expressiveness of the logic through examples, including those with complex interactions between time, authorization, and mutable state.