Trust network analysis with subjective logic

Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formalising trust relationships, e.g. as reputation scores or as subjective trust measures, trust between parties within the community can be derived by analysing the trust paths linking the parties together. This article describes a method for trust network analysis using subjective logic (TNA-SL). It provides a simple notation for expressing transitive trust relationships, and defines a method for simplifying complex trust networks so that they can be expressed in a concise form and be computationally analysed. Trust measures are expressed as beliefs, and subjective logic is used to compute trust between arbitrary parties in the network. We show that TNA-SL is efficient, and illustrate possible applications with examples.

[1]  JøsangAudun,et al.  Simplification and analysis of transitive trust networks , 2006 .

[2]  Audun Jøsang,et al.  Normalising the Consensus Operator for Belief Fusion , 2006 .

[3]  Paola Flocchini,et al.  Routing in Series Parallel Networks , 2003, Theory of Computing Systems.

[4]  Joan Feigenbaum,et al.  Decentralized trust management , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[5]  A. Jøsang,et al.  Filtering Out Unfair Ratings in Bayesian Reputation Systems , 2004 .

[6]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[7]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[8]  Walter L. Smith.  Probability and Statistics , 1959, Nature.

[9]  Audun Jøsang,et al.  Simulating the Effect of Reputation Systems on E-markets , 2003, iTrust.

[10]  Giovanni Della-Libera,et al.  Web Services Trust Language (WS-Trust) , 2002 .

[11]  Morris Sloman,et al.  A survey of trust in internet applications , 2000, IEEE Communications Surveys & Tutorials.

[12]  Wendy J. Myrvold,et al.  Generic Reliability Trust Model , 2005, PST.

[13]  Ronald L. Rivest,et al.  SDSI - A Simple Distributed Security Infrastructure , 1996 .

[14]  Audun Jøsang,et al.  Analysis of Competing Hypotheses using Subjective Logic , 2005 .

[15]  Audun Jøsang,et al.  Conditional Deduction Under Uncertainty , 2005, ECSQARU.

[16]  Audun Jøsang,et al.  A survey of trust and reputation systems for online service provision , 2007, Decis. Support Syst..

[17]  Audun Jøsang,et al.  A Logic for Uncertain Probabilities , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[18]  Audun Jøsang,et al.  AIS Electronic Library (AISeL) , 2017 .

[19]  Audun Jøsang,et al.  Simplification and analysis of transitive trust networks , 2006, Web Intell. Agent Syst..

[20]  Audun Jøsang,et al.  Semantic Constraints for Trust Transitivity , 2005, APCCM.

[21]  P. Vannoorenberghe,et al.  Strategies for combining conflicting dogmatic beliefs , 2003, Sixth International Conference of Information Fusion, 2003. Proceedings of the.

[22]  Audun Jøsang,et al.  The consensus operator for combining beliefs , 2002, Artif. Intell..

[23]  Jadwiga Indulska,et al.  SuperstringRep: Reputation-enhanced Service Discovery , 2005, ACSC.

[24]  Bruce Christianson,et al.  Why Isn't Trust Transitive? , 1996, Security Protocols Workshop.