Trust network analysis with subjective logic
Published 1 January 2006
Audun Jøsang, Ross Hayward, Simon Pope
Citations382
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formalising a 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.
Keywords
Social SciencesComputer Science
The PageRank Citation Ranking : Bringing Order to the Web
12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
The Eigentrust algorithm for reputation management in P2P networks
3,353 Citations2003Sepandar Kamvar, Mario Schlösser +1 more
An algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global trust value, based on the peer's history of uploads is described.
Decision Support SystemsA survey of trust and reputation systems for online service provision
3,306 Citations2005Audun Jøsang, Roslan Ismail +1 more
The purpose of this article is to give an overview of existing and proposed systems that can be used to derive measures of trust and reputation for Internet transactions, to analyse the current trends and developments in this area, and to propose a research agenda forTrust and reputation systems.
AIS Electronic Library (AISeL) (Association for Information Systems)The Beta Reputation System
1,452 Citations2002Roslan Ismail, Audun Jøsang
A new reputation system based on using beta probability density functions to combine feedback and derive reputation ratings is described which is flexibility and simplicity as well as its foundation on the theory of statistics.
IEEE Communications Surveys & TutorialsA survey of trust in internet applications
1,149 Citations2000Tyrone Grandison, Morris Sloman
This survey examines the various definitions of trust in the literature and provides a working definition of trust for Internet applications and some influential examples of trust management systems.
International Journal of Uncertainty Fuzziness and Knowledge-Based SystemsA LOGIC FOR UNCERTAIN PROBABILITIES
1,008 Citations2001Audun Jøsang
A framework which is called subjective logic uses elements from the Dempster-Shafer belief theory and it is shown that it is compatible with binary logic and probability calculus.
Filtering Out Unfair Ratings in Bayesian Reputation Systems
516 Citations2004A. Whitby, Audun Jøsang +1 more
This paper describes a statistical ltering technique for excluding unfair ratings, and illustrates its effectiveness through simulations.
SDSI - A Simple Distributed Security Infrastructure
483 Citations1996Butler Lampson, Ronald L. Rivest
SDSI combines a simple public-key infrastructure design with a means of defining groups and issuing group-membership certificates, and its design emphasizes linked local name spaces rather than a hierarchical global name space.
Artificial IntelligenceThe consensus operator for combining beliefs
193 Citations2002Audun Jøsang
This paper describes how the consensus operator can be applied to dogmatic conflicting opinions, i.e. when the degree of conflict is very high, and overcomes shortcomings of Dempster's rule and other operators that have been proposed for combining possibly conflicting beliefs.
Simplification and Analysis of Transitive Trust Networks
179 Citations2006Audun Jøsang, Elizabeth Gray +1 more
An approach to trust network analysis using subjective logic (TNA-SL), that uses a concise notation with which trust transitivity and parallel combination of trust paths can be expressed and allows trust measures to be expressed as beliefs, so that derived trust can be automatically and securely computed with subjective logic.
Lecture notes in computer scienceWhy isn't trust transitive?
165 Citations1997Bruce Christianson, William S. Harbison
The notion of trust is distinguished from a number of other (transitive) notions with which it is frequently confused, and it is argued that “proofs” of the unintensional transitivity of trust typically involve unpalatable logical assumptions as well as undesirable consequences.
Lecture notes in computer scienceSimulating the Effect of Reputation Systems on E-markets
96 Citations2003Audun Jøsang, Shane Hird +1 more
The simulation confirms the hypothesis that the presence of the reputation system improves the quality of the market and shows that a market with limited duration rather than infinite longevity of transaction feedback provides the best conditions under which agents can adapt to each others change in behaviour.
Strategies for combining conflicting dogmatic beliefs
79 Citations2003Audun Jøsang, Milan Daniel +1 more
Proposals for combining dogmatic or highly conpicting beliefs and how they handle cases when the beliefs are conflicting and dogmatic are described.
SuperstringRep: reputation-enhanced service discovery
45 Citations2005Ryan Wishart, Ricky Robinson +2 more
A new protocol is presented, SuperstringRep, which combines service discovery with service scores to create a system-wide score for services which reflects the quality of service they offer, and provides the service scores right when the client needs them: while selecting a service to interact with.
Lecture notes in computer scienceConditional Deduction Under Uncertainty
43 Citations2005Audun Jøsang, Simon Pope +1 more
This paper describes a method for conditional deduction with beliefs which is a generalisation of probabilistic conditional inference and Modus Ponens and allows partial ignorance to be included in the analysis and deduction of statements and hypothesis.
Theory of Computing SystemsRouting in Series Parallel Networks
15 Citations2003Paola Flocchini, Flaminia L. Luccio
The time and space complexities of Distance Routing in Series Parallel Graphs are computed, and they are compared with the relative complexities of Interval Routing, showing the improvement of distance Routing especially in terms of time complexity.
International Conference Information ProcessingNormalising the Consensus Operator for Belief Fusion
15 Citations2006Audun Jøsang, Simon Pope +1 more