A Testbed for Comparing Trust Computation Algorithms
G. Theodorakopoulos and J. S. Baras
25th Army Science Conference, Orlando, FL, November 27-30, 2006
Trust is the expectation of a person about another person’s behavior. Trust is important for many secu- rity related decisions about, e.g., granting or revoking privileges, controlling access to sensitive resources and information, or evaluating intelligence gathered from multiple sources. More often than not, the issue is complicated even further because the person making the decision has no direct trust relationship with every single subject whose trustworthiness needs to be eval- uated. So, the decision maker needs to rely on recom- mendations by others, and then somehow aggregate the trust related information that is collected. In this work we provide an algebraic framework in which we can describe multiple ways that trust related informa- tion can be aggregated to form a single value. We show the similarities and differences that the various so called trust computation algorithms have, and asso- ciate these with the algebraic properties of the frame- work that we consider.