Theoretical Computer Science
A calculus for access control in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Non-Interference in Constructive Authorization Logic
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Decision problems for propositional linear logic
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Policy Compliance in Collaborative Systems
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
Logic in Access Control (Tutorial Notes)
Foundations of Security Analysis and Design V
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
A modal deconstruction of access control logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Collaborative Planning with Confidentiality
Journal of Automated Reasoning
Bounded memory Dolev-Yao adversaries in collaborative systems
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A linear logic of authorization and knowledge
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
A general proof system for modalities in concurrent constraint programming
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
Linear authorization logics (LAL) are logics based on linear logic that can be used for modeling effect-based authentication policies. LAL has been used in the context of the Proof-Carrying Authorization framework, where formal proofs are constructed in order for a principal to gain access to some resource elsewhere. This paper investigates the complexity of the provability problem, that is, determining whether a linear authorization logic formula is provable or not. We show that the multiplicative propositional fragment of LAL is already undecidable in the presence of two principals. On the other hand, we also identify a first-order fragment of LAL for which provability is PSPACE-complete. Finally, we argue by example that the latter fragment is natural and can be used in practice.