A logic of trust and reputation

Herzig, Andreas; Lorini, Emiliano; Hübner, Jomi Fred; Vercouter, Laurent

doi:10.1093/jigpal/jzp077

Cited by 78 publications

(56 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In order to understand and anticipate potential flaws in complex composition scenarios, several approaches have been proposed for the formal specification and analysis of secure services [10,8]. Among the works dedicated to trust in multi-agent systems, the models closest to ours are [12,15] in which one can express that an agent trusts another agent in doing or forbearing of doing an action that leads to some goal. To our knowledge no work has previously considered the automatic orchestration of security services with policies altogether as ours.…”

Section: Contextmentioning

confidence: 99%

Intruder deducibility constraints with negation. Decidability and application to secured service compositions

Avanesov

Chevalier

Rusinowitch

et al. 2017

Journal of Symbolic Computation

View full text Add to dashboard Cite

Abstract:The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure by a construction for expressing that some data is not accessible to the mediator. Then we give a decision procedure for verifying that a mediator satisfying this non-disclosure policy can be effectively synthesized. This procedure has been implemented in CL-AtSe, our protocol analysis tool. The procedure extends constraint solving for cryptographic protocol analysis in a significative way as it is able to handle negative deducibility constraints without restriction. In particular it applies to all subterm convergent theories and therefore covers several interesting theories in formal security analysis including encryption, hashing, signature and pairing.

show abstract

Section: Contextmentioning

confidence: 99%

Intruder deducibility constraints with negation. Decidability and application to secured service compositions

Avanesov

Chevalier

Rusinowitch

et al. 2017

Journal of Symbolic Computation

View full text Add to dashboard Cite

show abstract

“…The integration of trust models, including related notions, like reputation, provenance, etc., into peer data exchange is still an open area of research. This is specially the case for logic-based models of trust (Herzig et al 2008). See (Hien Nguyen et al 2008 and references therein for probabilistic approaches.…”

Section: A5 On Trustmentioning

confidence: 99%

Consistency and trust in peer data exchange systems

Bertossi

Bravo

2016

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers' sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended -possibly virtual-instances for a peer that are obtained through a data repair semantics that we introduce and investigate. The semantically correct answers from a peer to a query, the so-called peer consistent answers, are defined as those answers that are invariant under all its different solution instances. We show that solution instances can be specified as the models of logic programs with a stable model semantics. The repair semantics is based on null values as used in SQL databases, and is also of independent interest for repairs of single databases with respect to integrity constraints.

show abstract

“…In the following sections, we show how the conceptual framework presented in [1] allows to express and represent such knowledge.…”

Section: Running Scenariomentioning

confidence: 99%

“…Many attempts to formalize concepts like trust and reputation have been carried out in the literature [5], [6], [7]. For the context of digital societies, the lately presented approach by Herzig et al [1] appears to be especially promising, since it goes beyond previous work by proposing a formal model that complies with the cognitive theories of social trust [5] and reputation [8]. Since this trust model is based on a recognized sociological theory, it defines the main constitutive elements of social trust as this concept is used in the human society, which makes it well-suited to assess trust in human users.…”

Section: Introductionmentioning

confidence: 99%

“…• We extend the conceptual framework presented in [1] by introducing the notion of reputation of an agent not to do an action • We present an instantiation of such conceptual framework targeting a meaningful real-world scenario related to Wikipedia • We describe an implementation of such instantiation on top of Jason and CArtAgO This paper is organized as follows: Section II describes the tackled scenario. Section III introduces the conceptual framework which will be used in the remaining of the paper.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation