Skip to main navigation Skip to search Skip to main content

First-Order Logic for Flow-Limited Authorization

  • Andrew K. Hirsch
  • , Pedro H.Azevedo De Amorim
  • , Ethan Cecchetti
  • , Ross Tate
  • , Owen Arden
  • Cornell University
  • University of California at Santa Cruz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We present the Flow-Limited Authorization First-Order Logic (FLAFOL), a logic for reasoning about authorization decisions in the presence of information-flow policies. We formalize the FLAFOL proof system, characterize its proof-theoretic properties, and develop its security guarantees. In particular, FLAFOL is the first logic to provide a non-interference guarantee while supporting all connectives of first-order logic. Furthermore, this guarantee is the first to combine the notions of non-interference from both authorization logic and information-flow systems. All the theorems in this paper are proven in Coq.

Original languageEnglish
Title of host publicationProceedings - 2020 IEEE 33rd Computer Security Foundations Symposium, CSF 2020
PublisherIEEE Computer Society
Pages123-138
Number of pages16
ISBN (Electronic)9781728165721
DOIs
StatePublished - Jun 2020
Event33rd IEEE Computer Security Foundations Symposium, CSF 2020 - Virtual, Online, United States
Duration: Jun 22 2020 → Jun 25 2020

Publication series

NameProceedings - IEEE Computer Security Foundations Symposium
Volume2020-June
ISSN (Print)1940-1434

Conference

Conference33rd IEEE Computer Security Foundations Symposium, CSF 2020
Country/TerritoryUnited States
CityVirtual, Online
Period06/22/20 → 06/25/20

Keywords

  • authorization
  • authorization logic
  • information flow
  • logic
  • proof theory

Fingerprint

Dive into the research topics of 'First-Order Logic for Flow-Limited Authorization'. Together they form a unique fingerprint.

Cite this