Reasoning about policy behavior in logic-based trust management systems: some complexity results and an operational framework

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Pasarella Sánchez, Ana Edelmira
• dc.contributor.author Lobo, Jorge
• dc.date.accessioned 2019-05-13T09:02:01Z
• dc.date.available 2019-05-13T09:02:01Z
• dc.date.issued 2015
• dc.description Comunicació presentada a: IEEE 28th Computer Security Foundations Symposium celebrat del 13 al 17 de juliol de 2015 a Verona, Itàlia.
• dc.description.abstract In this paper we show that the logical framework proposed by Becker et al. [1] to reason about security policy behavior in a trust management context can be captured by an operational framework that is based on the language proposed by Miller in 1989 to deal with scoping and/or modules in logic programming. The framework of Becker et al. uses propositional Horn clauses to represent both policies and credentials, implications in clauses are interpreted in counterfactual logic, a Hilbert-style proof system is defined and a system based on SAT is used to prove whether properties about credentials, permissions and policies are valid, i.e. true under all possible policies. Our contributions in this paper are three. First, we show that this kind of validation can rely on an operational semantics (derivability relation) of a language very similar to Miller's language, which is very close to derivability in logic programs. Second, we are able to establish that, as in propositional logic, validity of formulas is a co-NP-complete problem. And third, we present a provably correct implementation of a goal-oriented algorithm for validity.
• dc.description.sponsorship Edelmira Pasarella is partially supported by funds from the Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) under grant COMMAS (ref. TIN2013-46181-C2-1-R). Jorge Lobo is partially supported by the US Army Research Lab and the UK Ministry of Defence under agreement number W911NF-06-3-0001 and by the Secretaria d'Universitats i Recerca de la Generalitat de Catalunya.
• dc.format.mimetype application/pdf
• dc.identifier.citation Pasarella E, Lobo J. Reasoning about policy behavior in logic-based trust management systems: some complexity results and an operational framework. In: IEEE 28th Computer Security Foundations Symposium; 2015 Jul 13-17: Verona, Italy. New Jersey: Institute of Electrical and Electronics Engineers, 2015. p. 232-42. DOI: 10.1109/CSF.2015.23
• dc.identifier.doi http://dx.doi.org/10.1109/CSF.2015.23
• dc.identifier.issn 2377-5459
• dc.identifier.uri http://hdl.handle.net/10230/37213
• dc.language.iso eng
• dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
• dc.relation.ispartof IEEE 28th Computer Security Foundations Symposium; 2015 Jul 13-17: Verona, Italy. New Jersey: Institute of Electrical and Electronics Engineers, 2015. p. 232-42.
• dc.relation.projectID info:eu-repo/grantAgreement/ES/1PE/TIN2013-461
• dc.rights © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published article can be found at http://dx.doi.org/10.1109/CSF.2015.23
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword Trust Management Systems
• dc.subject.keyword Semantics
• dc.subject.keyword Answer Set Programming
• dc.subject.keyword Logic Programs
• dc.title Reasoning about policy behavior in logic-based trust management systems: some complexity results and an operational framework
• dc.type info:eu-repo/semantics/conferenceObject
• dc.type.version info:eu-repo/semantics/acceptedVersion