Towards Truthful Feedback in P2P Data Structures

  • Erik Buchmann
  • Klemens Böhm
  • Christian von der Weth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4275)


Peer-to-Peer data structures (P2P data structures) let a large number of anonymous peers share the data-management workload. A common assumption behind such systems is that peers behave cooperatively. But as with many distributed systems where participation is voluntary, and the participants are not clearly observable, unreliable behavior is the dominant strategy. This calls for reputation systems that help peers choose reliable peers to interact with. However, if peers exchange feedback on experiences with other peers, spoof feedback becomes possible, compromising the reputation system. In this paper we propose and evaluate measures against spoof feedback in P2P data structures. While others have investigated mechanisms for truthtelling recently, we are not aware of any studies in P2P environments. The problem is more difficult in our context because detecting unreliable peers is more difficult as well. On the other hand, a peer can observe the utility of feedback obtained from other peers, and our approach takes advantage of this. To assess the effectiveness of our approach, we have conducted extensive analytical and experimental evaluations. As a result, truthful feedback tends to have a much higher weight than spoof feedback, and collaboration attacks are difficult to carry out under our approach.


Reputation System Collusion Attack Local Repository Incoming Query Exponential Moving Average 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Resnick, P., Kuwabara, K., Zeckhauser, R., Friedman, E.: Reputation Systems. Communications of the ACM (CACM) 43 (2000)Google Scholar
  2. 2.
    Khopkar, T., Li, X., Resnick, P.: Self-Selection, Slipping, Salvaging, Slacking, and Stoning: The Impacts of Negative Feedback at eBay. In: Proceedings of the 6th ACM Conference on Electronic Commerce (EC 2005), pp. 223–231 (2005)Google Scholar
  3. 3.
    Jurca, R., Faltings, B.: “CONFESS”. Eliciting Honest Feedback Without Independent Verification Authorities. In: Faratin, P., Rodríguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS, vol. 3435, pp. 59–72. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Miller, N., Resnick, P., Zeckhauser, R.: Eliciting Informative Feedback: The Peer Prediction Method. Management Science 51, 1359–1373 (2005)CrossRefGoogle Scholar
  5. 5.
    Prelec, D.: A Bayesian Truth Serum for Subjective Data. Science 306, 462–466 (2004)CrossRefGoogle Scholar
  6. 6.
    Gummadi, K., Gummadi, R., Gribble, S.D., Ratnasamy, S., Shenker, S., Stoica, I.: The Impact of DHT Routing Geometry on Resilience and Proximity. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 2003) (2003)Google Scholar
  7. 7.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 2001) (2001)Google Scholar
  8. 8.
    Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In: Proceedings of the 21th ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183–192 (2002)Google Scholar
  10. 10.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 2001) (2001)Google Scholar
  11. 11.
    Böhm, K., Buchmann, E.: Free Riding-Aware Forwarding in Content-Addressable Networks. International Journal on Very Large Data Bases (VLDB) (2006)Google Scholar
  12. 12.
    Back, A.: Hashcash - A Denial of Service Counter-Measure (2002),
  13. 13.
    Jakobsson, M., Juels, A.: Proofs of Work and Bread Pudding Protocols. In: Proceedings of the 4th International Conference on Communications and Multimedia Security (CMS 1999) (1999)Google Scholar
  14. 14.
    Dewan, P., Dasgupta, P.: Securing P2P Networks Using Peer Reputations: Is There a Silver Bullet? In: Proceedings of the 2nd IEEE Consumer Communications and Networking Conference (CCNC 2005) (2005)Google Scholar
  15. 15.
    Aberer, K., Despotovic, Z.: Managing Trust in a Peer-2-Peer Information System. In: Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM 2001) (2001)Google Scholar
  16. 16.
    Garcia-Molina, H., Schlosser, M.T., Kamvar, S.D.: The EigenTrust Algorithm for Reputation Management in P2P Networks. In: Proceedings of the 12th International World Wide Web Conference (WWW 2003) (2003)Google Scholar
  17. 17.
    Xiong, L., Liu, L.: PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities. IEEE Transactions on Knowledge and Data Engineering (TKDE) 16 (2004)Google Scholar
  18. 18.
    Prelec, D., Weaver, R.G.: Truthful Answers are Surprisingly Common:Experimental Tests of the Bayesian Truth Serum. In: Proceedings of the Conference on Econometrics and Experimental Economics (CEEE 2006) (2006)Google Scholar
  19. 19.
    Cornelli, F., Damiani, E., di Vimercati, S.D.C., Paraboschi, S., Samarati, P.: Choosing Reputable Servents in a P2P Network. In: Proceedings of the 11th International World Wide Web Conference (WWW 2002), pp. 376–386 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Erik Buchmann
    • 1
  • Klemens Böhm
    • 1
  • Christian von der Weth
    • 1
  1. 1.Universität Karlsruhe (TH)Germany

Personalised recommendations