A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Complexity of Linear Authorization Logics
2012
2012 27th Annual IEEE Symposium on Logic in Computer Science
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
doi:10.1109/lics.2012.61
dblp:conf/lics/Nigam12
fatcat:mpujo73eovhhjaosobmvkr273a