Trust network analysis with subjective logic

ABSTRACT

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.

REFERENCES

• 1: Matt Blaze , Joan Feigenbaum , Jack Lacy, Decentralized Trust Management, Proceedings of the 1996 IEEE Symposium on Security and Privacy, p.164, May 06-08, 1996
• 2: Bruce Christianson , William S. Harbison, Why Isn't Trust Transitive?, Proceedings of the International Workshop on Security Protocols, p.171-176, April 10-12, 1996
• 3: [3] M.H. DeGroot and M.J. Schervish. Probability and Statistics (3rd Edition). Addison-Wesley, 2001.
• 4: [4] C. Ellison et al. RFC 2693 - SPKI Certification Theory. IETF, September 1999. url: http://www.ietf.org/rfc/rfc2693.txt.
• 5: [5] P. Flocchini and F.L. Luccio. Routing in Series Parallel Networks. Theory of Computing Systems, 36(2):137-157, 2003.
• 6: [6] T. Grandison and M. Sloman. A Survey of Trust in Internet Applications. IEEE Communications Surveys and Tutorials, 3, 2000.
• 7: Audun Jøsang, A logic for uncertain probabilities, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, v.9 n.3, p.279-311, June 2001
• 8: Audun Jøsang, The consensus operator for combining beliefs, Artificial Intelligence, v.141 n.1, p.157-170, October 2002 [doi>10.1016/S0004-3702(02)00259-X]
• 9: [9] A. Jøsang, M. Daniel, and P. Vannoorenberghe. Strategies for Combining Conflicting Dogmatic Beliefs. In Xuezhi Wang, editor, Proceedings of the 6th International Conference on Information Fusion, 2003.
• 10: [10] A. Jøsang, E. Gray, and M. Kinateder. Simplification and Analysis of Transitive Trust Networks (to appear). Web Intelligence and Agent Systems, 00(00):00-00, 2005.
• 11: [11] A. Jøsang, S. Hird, and E. Faccer. Simulating the Effect of Reputation Systems on e-Markets. In P. Nixon and S. Terzis, editors, Proceedings of the First International Conference on Trust Management (iTrust), Crete, May 2003.
• 12: [12] A. Jøsang and R. Ismail. The Beta Reputation System. In Proceedings of the 15th Bled Electronic Commerce Conference, Bled, Slovenia, June 2002.
• 13: [13] A. Jøsang, R. Ismail, and C. Boyd. A Survey of Trust and Reputation Systems for Online Service Provision (to appear). Decision Support Systems, 00(00):00-00, 2006.
• 14: [14] A. Jøsang and S. Pope. Normalising the Consensus Operator for Belief Fusion. In Proceedings of the 18th Australian Joint Conference on Artificial Intelligence , Sydney 2005.
• 15: Audun Jøsang , Simon Pope, Semantic constraints for trust transitivity, Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling, p.59-68, January 01, 2005, Newcastle, New South Wales, Australia
• 16: [16] Audun Jøsang, Simon Pope, and Milan Daniel. Conditional deduction under uncertainty. In Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005), 2005.
• 17: Sepandar D. Kamvar , Mario T. Schlosser , Hector Garcia-Molina, The Eigentrust algorithm for reputation management in P2P networks, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary [doi>10.1145/775152.775242]
• 18: [18] Liberty-Alliance. Liberty ID-FF Architecture Overview. Version: 1.2-errata-v1.0. http://www.projectliberty.org/specs/liberty-idffarch-overview-v1.2.pdf, 2003.
• 19: [19] Liberty-Alliance. Liberty Trust Models Guidelines . http://www.projectliberty.org/specs/liberty-trust-models-guidelines-v1.0.pdf, Draft Version 1.0-15 edition, 2003.
• 20: [20] G. Mahoney, W. Myrvold, and G.C. Shoja. Generic Reliability Trust Model. In A. Ghorbani and S. Marsh, editors, Proceedings of the 3rd Annual Conference on Privacy, Security and Trust, St.Andrews, New Brunswick, Canada, October 2005.
• 21: [21] L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.
• 22: [22] Simon Pope and Audun Jøsang. Analsysis of competing hypotheses using subjective logic. In Proceedings of the 10th International Command and Control Research and Technology Symposium (IC-CRTS) . United States Department of Defense Command and Control Research Program (DoDCCRP), 2005.
• 23: [23] Ronald L. Rivest and Butler Lampson. SDSI - A simple distributed security infrastructure. Presented at CRYPTO'96 Rumpsession, 1996.
• 24: Ryan Wishart , Ricky Robinson , Jadwiga Indulska , Audun Jøsang, SuperstringRep: reputation-enhanced service discovery, Proceedings of the Twenty-eighth Australasian conference on Computer Science, p.49-57, January 01, 2005, Newcastle, Australia
• 25: [25] A. Withby, A. Jøsang, and J. Indulska. Filtering Out Unfair Ratings in Bayesian Reputation Systems. The Icfain Journal of Management Research, 4(2):48-64, 2005.
• 26: [26] WS-Trust. Web Services Trust Language (WS-Trust). ftp://www6.software.ibm.com/software/developer/ library/ws-trust.pdf, February 2005.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems; Graph algorithms

General Terms:
Algorithms, Design, Performance, Security