A linear logic of authorization and knowledge

Conference Paper

We propose a logic for specifying security policies at a very high level of abstraction. The logic accommodates the subjective nature of affirmations for authorization and knowledge without compromising the objective nature of logical inference. In order to accurately model consumable authorizations and resources, we construct our logic as a modal enrichment of linear logic. We show that the logic satisfies cut elimination, which is a proof-theoretic expression of its soundness. We also demonstrate that the logic is amenable to meta-reasoning about specifications expressed in it through several examples. © Springer-Verlag Berlin Heidelberg 2006.

Full Text

Published version (via Digital Object Identifier)

Duke Authors

Reiter, Michael

Cited Authors

Garg, D; Bauer, L; Bowers, KD; Pfenning, F; Reiter, MK

Published Date

January 1, 2006

Published In

Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume / Issue

4189 LNCS /

Start / End Page

297 - 312

Electronic International Standard Serial Number (EISSN)

1611-3349

International Standard Serial Number (ISSN)

0302-9743

International Standard Book Number 10 (ISBN-10)

354044601X

International Standard Book Number 13 (ISBN-13)

9783540446019

Digital Object Identifier (DOI)

10.1007/11863908_19

Citation Source

Scopus

Scholars@Duke