Using Trust and Reputation Information to Choose Both Request Responders and Servers in Peer-to-Peer Networks

In current reputation-based trust models for P2P applications trust and reputation information are mainly used to choose service providers, they are helpless when facing this malicious attack: malicious nodes respond received queries at random in spite of whether it locally has queried resources. Once they are chosen as a provider, they will transmit a fake, even a malicious file. We present a hierarchical, especially reputation-based two-level trust model. In our model trust and reputation information are used to choose both request responders and service providers. So our model can restrain malicious behaviors from the headstream and withstand this attack. Furthermore in our model peers can receive more and better services; trust value in node can be concentrated at a considerable fast speed and malicious nodes can be identified quickly.

[1]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[2]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[3]  Rakesh Kumar,et al.  Pollution in P2P file sharing systems , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Ling Liu,et al.  PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities , 2004, IEEE Transactions on Knowledge and Data Engineering.

[5]  Guy L. Steele,et al.  Multiprocessing compactifying garbage collection , 1975, CACM.

[6]  Ajay D. Kshemkalyani,et al.  On the security of polling protocols in peer-to-peer systems , 2004 .

[7]  George E. Collins,et al.  A method for overlapping and erasure of lists , 1960, CACM.

[8]  Paul Resnick,et al.  Reputation Systems: Facilitating Trust in Internet Interactions , 2000 .

[9]  Ralf Ackermann,et al.  Security-Related Issues in Peer-to-Peer Networks , 2005, Peer-to-Peer Systems and Applications.

[10]  Karl Aberer,et al.  Managing trust in a peer-2-peer information system , 2001, CIKM '01.

[11]  Henry Lieberman,et al.  A real-time garbage collector based on the lifetimes of objects , 1983, CACM.

[12]  Ernesto Damiani,et al.  A reputation-based approach for choosing reliable resources in peer-to-peer networks , 2002, CCS '02.

[13]  Robert Fenichel,et al.  A LISP garbage-collector for virtual-memory computer systems , 1969, CACM.

[14]  Bill Venners,et al.  Inside the Java Virtual Machine , 1997 .

[15]  Alexandru Nicolau,et al.  Comparison of Compacting Algorithms for Garbage Collection , 1983, TOPL.

[16]  Ernesto Damiani,et al.  Choosing reputable servents in a P2P network , 2002, WWW.

[17]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[18]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[19]  Mostafa H. Ammar,et al.  A reputation system for peer-to-peer networks , 2003, NOSSDAV '03.