Authorization Logic

Authorization logics are logics for describing authorization in (distributed) computing systems. In particular, authorization logics have principals, which represent the different parts of the computing system, and a modality for each, often written with A says, where A is a principal. Thus, we can say A says φ when φ is a sentence that A believes to be true. What makes authorization logics different from standard modal logics in the inclusion of a speaks for connective among principals, where A speaks for B if, whenever A believes a sentence, so does B. This allows for delegation among principals in a system.

My work in authorization logics is listed below:

• First-Order Logic for Flow-Limited Authorization with Pedro H. Azevedo de Amorim, Ethan Cecchetti, Ross Tate, and Owen Arden. Published in Computer Security Foundations, 2020.

• Belief Semantics of Authorization Logics With Michael Clarkson. Published in Computer and Communication Security, 2013.

• Nexus Authorization Logic (NAL): Logical Results With Michael Clarkson. Published as a George Washington Unviersity Technical Report, 2012.