On the complexity of linear authorization logics

DOI10.1109/LICS.2012.61MaRDI QIDQ2986827zbMATH OpenWikidataFDO

Authors Vivek Nigam

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/LICS.2012.61

zbMATH Keywords

authorization logicscomplexitylinear logicsubexponentials

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A framework for linear authorization logics
• A linear logic of authorization and knowledge
• Logical approaches to authorization policies
• Primal Infon Logic: Derivability in Polynomial Time
• A Logic for State-Modifying Authorization Policies

Cited in

(10)

• On subexponentials, focusing and modalities in concurrent systems
• A framework for linear authorization logics
• Dynamic spaces in concurrent constraint programming
• A rewriting framework and logic for activities subject to regulations
• Bounded memory Dolev-Yao adversaries in collaborative systems
• A concurrent constraint programming interpretation of access permissions
• Compact proof certificates for linear logic
• Undecidability of multiplicative subexponential logic
• Subexponentials in non-commutative linear logic
• A linear logic of authorization and knowledge

This page was built for publication: On the complexity of linear authorization logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986827)