Skip to main content

A New Trust Model Based on Advanced D-S Evidence Theory for P2P Networks

  • Conference paper
Formal Aspects in Security and Trust (FAST 2006)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4691))

Included in the following conference series:

  • 396 Accesses

Abstract

Building trust relationship between peers in a large-scale distributed P2P file-sharing system is a fundamental and challenging research topic. Recommendation based trust mechanism is widely employed to establish the trust relationship. However, most existing approaches can not efficiently deal with inconsistent or conflicting recommendation information, and uncertainty of information. Dempster-Shafer (D-S) evidence theory is preponderant in tackling uncertainty of information, but classical combination rule always results in unreasonable results especially when evidences severely conflict each other. In this paper, we improve the combination rule for D-S evidence theory and develop a novel trust model based on it. For the problem of security, some measures are also proposed to defense against several malicious attacks. Experimental results show that the proposed model can significantly improve the successful transaction rate of P2P networks and effectively detect malicious behaviors in P2P networks.

This work was supported by the National Basic Research Program of China (Grant No. 2003CB314806 and 2006CB701306), the National Natural Science Foundation of China (No. 90204003 and 60472067).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Damiani, E., di Vimercati, S.D.C., Paraboschi, S., Samarati, P.: A reputation-based approach for choosing reliable resources in peer-to-peer networks. In: Proceedings of the 9th ACM conference on Computer and communications security, pp. 207–216. ACM Press, NewYork (2002)

    Chapter  Google Scholar 

  2. Cornelli, F., Damiani, E., di Vimercati, S.D.C., Paraboschi, S.: Choosing reputable servents in a P2P network. In: Proceedings of the 11th Int’l World Wide Web Conf., pp. 441–449. ACM Press, Hawaii (2002)

    Google Scholar 

  3. Kamvar, S.D., Schlosser, M., Garcia-Molina, H.: The EigenTrust Algorithm for Reputation Management in P2P Networks. In: Proceedings of the 12th International conference of WWW, Budapest, Hungary (2003)

    Google Scholar 

  4. Wang, Y., Vassileva, J.: Trust and Reputation Model in Peer-to-Peer Networks. In: Proceedings of the Third International Conference on Peer-to-Peer Computing(P2P 2003) (2003)

    Google Scholar 

  5. Xiong, L., Liu, L.: PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities. IEEE Transactions on Knowledge and Data Engineering 16, 843–857 (2004)

    Article  Google Scholar 

  6. Yu, B., Singh, M.P.: An Evidential Model of Distributed Reputation Management. In: Falcone, R., Barber, S., Korba, L., Singh, M.P. (eds.) AAMAS 2002. LNCS (LNAI), vol. 2631, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Song, S.S., Hwang, K., Zhou, R.F.: Trusted P2PTransactions with Fuzzy Reputation Aggregation. IEEE Internet Computing 2, 18–28 (2005)

    Google Scholar 

  8. Dempster, A.P.: Upper and lower probabilities induced by a multi—valued mapping. Ann Mathematical Statistics (1967)

    Google Scholar 

  9. Shafer, G.: A mathematical theory of evidence, pp. 10–28. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  10. Yager.: On the Dempster-Shafer framework and new combination rules. Information Science 41, 93–137 (1989)

    Article  MathSciNet  Google Scholar 

  11. Sun, Q., Ye, X.Q., Gu, W.K.: A new composition method for evidence theory. Chinese Journal of Electronics 28, II7–119 (2002)

    Google Scholar 

  12. Xu, H., Semt, P.: Some strategies for explanations in evidence reasoning. IEEE Trans.on Syst.,Man and Cybern Part A: Systems Human 28, 599–607 (1996)

    Google Scholar 

  13. http://p2p.stanford.edu/www/demos.htm

  14. Schlosser, M., Condie, T., Kamvar, S.: Simulating a File-Sharing P2P Network. In: First Workshop on Semantics in P2P and Grid Computing (December 2002)

    Google Scholar 

  15. Sun, Y., Han, Z., Yu, W., Ray, K.J.: A trust evaluation framework in distributed network: vulnerability analysis and defense against attacks. In: IEEE Infocom 2006, Barcelona, Spain (2006)

    Google Scholar 

  16. Zhang, D.G., Xu, G.Y., Shi, Y.C.: Extended method of evidence theory for pervasive computing. Chinese Journal of Computers 27, 918–927 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Theo Dimitrakos Fabio Martinelli Peter Y. A. Ryan Steve Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tian, C., Zou, S., Wang, W., Cheng, S. (2007). A New Trust Model Based on Advanced D-S Evidence Theory for P2P Networks. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds) Formal Aspects in Security and Trust. FAST 2006. Lecture Notes in Computer Science, vol 4691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75227-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75227-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75226-4

  • Online ISBN: 978-3-540-75227-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics