Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust (2008)

Author(s): Zhang H, van Moorsel A

    Abstract: The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems and reputation systems. We study the use of peer-to-peer algorithms for finding trust paths and probabilistically assessing trust values in systems where trust is organised similar to the 'web of trust'. We do this through discrete event simulation of random as well as scale free trust networks based on flooding as well as selective search algorithms. Our main conclusion is that in many situations these algorithms can be seen as belonging to a single class of algorithms that perform equally, and only differ through (and are sensitive to) parameter choices. We will also see that flooding is the only applicable method if one stresses the requirement for finding all trust paths, and if networks are less connected.

      • Date: 24-25 September 2008
      • Conference Name: Computer Performance Engineering: 5th European Performance Engineering Workshop (EPEW)
      • Volume: 5261
      • Pages: 242-256
      • Publisher: Springer-Verlag
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published

        Keywords: Peer-to-Peer, Web of Trust, Trust Paths, Trust Inference


        Professor Aad van Moorsel
        Head of School, Professor