2007Unpublished venueRequires access

A Distributed Trust-based Reputation Model in P2P System

Yumei Liu, Shoubao Yang, Leitao Guo, Wan-ming Chen, Liangmin Guo

Open publisher page 19 citations

Abstract

The P2P system is an anonymous and dynamic system, thus, some malicious behaviour can't be punished. In order to restrict the malicious behaviour in the P2P system, researchers have focused on establishing effective reputation systems. However, the present reputation system can't avoid the trick of the false reputation feedback. We propose a distributed trust-based reputation model in p2p system (TBRM) to avoid it. The TBRM algorithm differentiated the node's capability of providing honest quality by the nodes reputation value, and the honest evaluation by the trust value. In our model, the reputation value represented the resource quality of the provider, thus, other nodes would like this node have low reputation value. At this time, the false reputation feedback happened. In this paper, we used the trust value to restrict the false reputation feedback For the nodes with low trust value was difficult to get the required resource, we punished the false reputation feedback by low their trust value. We show by both theoretical analysis and simulations that the proposed TBRM algorithm can get quick convergence which is 11 times, high equity for both low and high reputation nodes, and can get a high successful rate of file- downloading. When the malicious nodes' rate is 80%, the proposed TBRM is about 95% successful rate, compared to the algorithm without reputation who is only 27%.

About this research paper

What this paper is about

The P2P system is an anonymous and dynamic system, thus, some malicious behaviour can't be punished. In order to restrict the malicious behaviour in the P2P system, researchers have focused on establishing effective reputation systems. However, the present reputation system can't avoid the trick of the false reputation feedback. We propose a distributed trust-based reputation model in p2p system (TBRM) to avoid it. The TBRM algorithm differentiated the node's capability of providing honest quality by the nodes reputation value, and the honest evaluation by the trust value. In our model, the reputation value represented the resource quality of the provider, thus, other nodes would like this node have low reputation value. At this time, the false reputation feedback happened. In this paper, we used the trust value to restrict the false reputation feedback For the nodes with low trust value was difficult to get the required resource, we punished the false reputation feedback by low their trust value. We show by both theoretical analysis and simulations that the proposed TBRM algorithm can get quick convergence which is 11 times, high equity for both low and high reputation nodes, and can get a high successful rate of file- downloading. When the malicious nodes' rate is 80%, the proposed TBRM is about 95% successful rate, compared to the algorithm without reputation who is only 27%.

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The P2P system is an anonymous and dynamic system, thus, some malicious behaviour can't be punished. In order to restrict the malicious behaviour in the P2P system, researchers have focused on establishing effective reputation systems. However, the present reputation system can't avoid the trick of the false reputation feedback. We propose a distributed trust-based reputation model in p2p system (TBRM) to avoid it. The TBRM algorithm differentiated the node's capability of providing honest quality by the nodes reputation value, and the honest evaluation by the trust value. In our model, the reputation value represented the resource quality of the provider, thus, other nodes would like this node have low reputation value. At this time, the false reputation feedback happened. In this paper, we used the trust value to restrict the false reputation feedback For the nodes with low trust value was difficult to get the required resource, we punished the false reputation feedback by low their trust value. We show by both theoretical analysis and simulations that the proposed TBRM algorithm can get quick convergence which is 11 times, high equity for both low and high reputation nodes, and can get a high successful rate of file- downloading. When the malicious nodes' rate is 80%, the proposed TBRM is about 95% successful rate, compared to the algorithm without reputation who is only 27%.

Key concepts: Reputation, Reputation system, Computer science, Node (physics), Computer security, Upload, Value (mathematics), Resource (disambiguation)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Distributed Trust-based Reputation Model in P2P System — Research Paper | ScholarLens