Distributed Trust Algorithms: Difference between revisions
From Konfidi
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
<th>Concatenation of x -> y</th> | <th>Concatenation of x -> y</th> | ||
<th>Multiple paths</th> | <th>Multiple paths</th> | ||
<th>notes</th> | <th>notes</th> | ||
</tr> | </tr> | ||
| Line 19: | Line 18: | ||
<td>(x*y)<sup>½</sup></td> | <td>(x*y)<sup>½</sup></td> | ||
<td>maximum</td> | <td>maximum</td> | ||
<td></td> | <td></td> | ||
</tr> | </tr> | ||
| Line 30: | Line 28: | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
<td></td> | </tr> | ||
<tr> | |||
<td>[http://www.trustlet.org/wiki/MoleTrust MoleTrust]</td> | |||
<td>N</td> | |||
<td>[0,1]</td> | |||
<td>(x*y)</td> | |||
<td>weighted</td> | |||
<td>avoid cycles, a couple cutoff thresholds</td> | |||
</tr> | </tr> | ||
<tr> | <tr> | ||
<td>[http://www.advogato.org/trust-metric.html Advogato]</td> | <td>[http://www.advogato.org/trust-metric.html Advogato]</td> | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
| Line 49: | Line 54: | ||
<td>Y, starting to</td> | <td>Y, starting to</td> | ||
<td>bilattice</td> | <td>bilattice</td> | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
| Line 59: | Line 63: | ||
<td>N</td> | <td>N</td> | ||
<td>untrusted, marginal, full, ultimate</td> | <td>untrusted, marginal, full, ultimate</td> | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
</tr> | </tr> | ||
</table> | </table> | ||
| Line 92: | Line 84: | ||
<td>1-(1-y)<sup>x</sup></td> | <td>1-(1-y)<sup>x</sup></td> | ||
<td>average</td> | <td>average</td> | ||
<td>trust values intertwined with # of "good" or "bad" experiences with an entity. Pay attention to "recommendation trust"</td> | <td>trust values intertwined with # of "good" or "bad" experiences with an entity. Pay attention to "recommendation trust"</td> | ||
</tr> | </tr> | ||
| Line 98: | Line 89: | ||
<tr> | <tr> | ||
<td>[http://en.wikipedia.org/wiki/EigenTrust EigenTrust]</td> | <td>[http://en.wikipedia.org/wiki/EigenTrust EigenTrust]</td> | ||
<td></td> | <td></td> | ||
<td></td> | <td></td> | ||
Revision as of 18:29, 23 June 2008
Between people
| Name | Based on psych. research? | Data model | Concatenation of x -> y | Multiple paths | notes |
|---|---|---|---|---|---|
| Konfidi Multiplicative2 | N | [0,1] | (x*y)½ | maximum | |
| TidalTrust | N | 1-10 | |||
| MoleTrust | N | [0,1] | (x*y) | weighted | avoid cycles, a couple cutoff thresholds |
| Advogato | Uses Network Flow theory; has central root nodes | ||||
| Patricia Victor's | Y, starting to | bilattice | |||
| OpenPGP | N | untrusted, marginal, full, ultimate |
Between agents
Reputation is generally part of the algorithm
| Valuation of Trust in Open Networks Beth, Borcherding, Klein 1994 |
N | [0,1) | 1-(1-y)x | average | trust values intertwined with # of "good" or "bad" experiences with an entity. Pay attention to "recommendation trust" |
| EigenTrust |
