15-317 Constructive Logic
Lecture 25: Authorization Logic

In this lecture we apply the ideas behind lax logic to give a logical treated to authorization, where principals in a distributed system can digitally sign logical propositions from which access control decision are derived by logical inference.

• Reading:
  • Non-Interference in Constructive Authorization Logic,
    Deepak Garg and Frank Pfenning, Proceedings of the 19th Computer Security Foundations Workshop (CSFW'06), pp.283-296, July 2006.
• Previous lecture: Lax Logic
• Next lecture: none
• Key concepts:
  • Affirmations
  • Lax modality indexed by principals
  • Proposition K says A
  • Sequent calculus for authorization logic

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning