# Eigentrust

The **EigenTrust** algorithm is a reputation management algorithm for peer-to-peer networks, developed by Sep Kamvar, Mario Schlosser, and Héctor García Molina The algorithm provides each peer in the network a unique global trust value based on the peer's history of uploads and thus aims to reduce the amount of inauthentic data in a network.

## Overview

Peer-to-peer systems available today are open, often anonymous and lack accountability. Hence a user with malicious intent can introduce into the peer-to-peer network resources that may be inauthentic, corrupted or malicious. This reflects poorly on the credibility of current peer-to-peer systems. A research team from Stanford provides a reputation management system, where each peer in the system has a unique global trust value based on the peer's history of uploads. Any peer requesting resources will be able to access the trust value of a peer and avoid downloading files from untrusted peers.

## Algorithm

The Eigentrust algorithm is based on the notion of transitive trust: If a peer *i* trusts any peer *j*, it would also trust the peers trusted by *j*. Each peer *i* calculates the local trust value *s*_{ij } for all peers that have provided it with authentic or fake downloads based on the satisfactory or unsatisfactory transactions that it has had.

- <math>s_{ij} = \operatorname{sat}(i,j) - \operatorname{unsat}(i,j)</math>

where sat (*i*, *j*) refers to the number of satisfactory responses that peer *i* has received from peer *j*,
and unsat(*i*, *j*) refers to the number of unsatisfactory responses that peer *i* has received from peer *j*.

The local value is normalized, to prevent malicious peers from assigning arbitrarily high local trust values to colluding malicious peers and arbitrarily low local trust values to good peers. The normalized local trust value *c*_{ij} is then

- <math>c_{ij} = \frac{\max(s_{ij},0)}{\sum_{j} \max(s_{ij}, 0)} </math>

The local trust values are aggregated at a central location or in a distributed manner to create a trust vector for the whole network. Based on the idea of transitive trust, a peer *i* would ask other peers it knows to report the trust value of a peer *k* and weigh responses of these peers by the trust peer *i* places in them.

- <math> t_{ik} = \sum_{j} c_{ij} c_{jk} </math>

If we assume that a user knew the *c*_{ij} values for the whole network in the form of a matrix *C*, then trust vector <math>\bar t_{i} </math> that defines the trust value for <math> t_{ik} </math> is given by

- <math>\bar t_{i} = C^T\bar c_{i}.\, </math>

In the equation shown above, if C is assumed to be aperiodic and strongly connected, powers of the matrix C will converge to a stable value at some point.

- <math>\bar t = (C^T)^x \bar c_{i}. \, </math>

It seems that for a large value of *x*, the trust vector <math>\bar t_{i} </math> will converge to the same vector for every peer in the network. The vector <math>\bar t_{i} </math> is known as the left principal eigenvector of the matrix *C*. We also note that since <math>\bar t_{i} </math> is same for all nodes in the network, it represents the global trust value.

Based on the results above a simple centralized trust value computing algorithm can be written. Note that we assume that all the local trust values for the whole network are available and present in the matrix *C*. We also note that, if the equation shown above converges, we can replace the initial vector <math>\bar c_{i}</math> by a vector <math>\bar e</math> that is an m-vector representing uniform probability distribution over all m peers. The basic EigenTrust algorithm is shown below:

- <math>\bar t_{0} = \bar e ;</math>

**repeat**

- <math>\bar t^{(k+1)} = C^T \bar t^{(k)} ;</math>

- <math>{\delta} = || t^{(k+1)} - t^{(k)} || ; </math>

**until**<math>{\delta} < \mathrm{error} ; </math>