An Effective Calculation of Reputation in P2P Networks

International Journal of Computer Applications, 2015

In recent times, the growth in the number of subscribers of peer to peer networks has been phenomenal. Anonymity being a character of such networks also gave rise to the number of free-riders and malicious behaviors. Though free riders consume network bandwidth and decrease the network performance by displaying selfish behavior, they are not a serious threat for the rest of the cooperative peers. Malicious peers on the other hand, spread viruses, worms, Trojans in the network, provide misleading feedback and try to disrupt the existing trust among the peers. Therefore, it is absolutely essential that a peer has reliable reputation information about other peers in order make informed decisions (e.g., who to download files from, who to serve content, which is a malicious node etc.). In this paper, we have proposed a reputation system that uses objective criteria to track each peer's contribution in the system and allows peers to store their reputations locally. In our opinion, such measures will eventually root out malicious peers from the system.

Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video, 2003

We investigate the design of a reputation system for decentralized unstructured P2P networks like Gnutella. Having reliable reputation information about peers can form the basis of an incentive system and can guide peers in their decision making (e.g., who to download a file from). The reputation system uses objective criteria to track each peer's contribution in the system and allows peers to store their reputations locally. Reputation are computed using either of the two schemes, debit-credit reputation computation (DCRC) and credit-only reputation computation (CORC). Using a reputation computation agent (RCA), we design a public key based mechanism that periodically updates the peer reputations in a secure, light-weight, and partially distributed manner. We evaluate using simulations the performance tradeoffs inherent in the design of our system.

Telecommunication Systems, 2010

In a heterogeneous ubiquitous peer-to-peer network, different peers may provide different qualities of service, and hence it is very important and helpful to identify those peers that can provide better services than others. In this paper, we use a reputation value to represent the quality of service offered by a peer. We design a novel reputation model which enables any peer to calculate the reputation value of any other peer, so as to differentiate peers that provide good quality of service from peers that provide poor or even faulty service. In order to speed up the convergence of reputation calculation, a peer collects recommendations from its neighbor peers. On the other hand, in order to overcome the problem of malicious recommendations, we propose an auxiliary trust mechanism which calculates a trust value for each peer. Our experimental results show that the reputation model achieves a fast convergence speed, and it is robust against a large portion of malicious peers that provide fraud recommendations.

IJCSNS, 2008

Trust plays a key role in each transaction in online peer-to-peer (P2P) communities. Transaction based trust computation is an insufficient mechanism when the number of transactions is less. Reputation plays a major role when a peer transacts with other peers for the first time. Reputation computation which is very close to the reality is very important to all the online transactions. Several methods were proposed in the literature for reputation computation. The mechanism discussed in this paper offers a weighted feedback based reputation computation. In case, a malicious peer deceives by exaggerating or underrating the feedback, the method includes a dynamic corrective procedure, which forces a peer to give correct feedback. Thus, this mechanism attempts to solve the reputation computation problem with minimum overheads of storage and retrieval.

Handbook of Peer-to-Peer Networking, 2009

Trust is required in file sharing peer-to-peer (P2P) systems to achieve better cooperation among peers and reduce malicious uploads. In reputation-based P2P systems, reputation is used to build trust among peers based on their past transactions and feedbacks from other peers. In these systems, reputable peers will usually be selected to upload requested files, decreasing significantly malicious uploads in the system. This chapter surveys different reputation-based P2P systems. We will breakdown a typical reputation system into functional components. We will discuss each component and present proposed solutions from the literature. Different reputation-based systems will be described and analyzed. Each system presents a particular perspective in addressing peers' reputation.

2003

Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience with P2P networks such as Gnutella shows, the anonymous, open nature of these networks offers an almost ideal environment for the spread of self-replicating inauthentic files. We describe an algorithm to decrease the number of downloads of inauthentic files in a peer-to-peer file-sharing network that assigns each peer a unique global reputation value, based on the peer's history of uploads. We present a distributed and secure method to compute global reputation values, based on Power iteration. By having peers use these global reputation values to choose the peers from whom they download, the network effectively identifies malicious peers and isolates them from the network. In simulations, this reputation system has been shown to significantly decrease the number of inauthentic files on the network, even under a variety of conditions where malicious peers cooperate in an attempt to deliberately subvert the system.

Computer Science Review, 2012

The objective of this paper is to present a comprehensive survey of security issues in Reputation based Trust Management system (RTMS) also known in short as Reputation Management Systems for P2P networks. The wide adoption of P2P computing has enhanced content publishing, pervasive information collection, streaming of real-time sensed data and information sharing on an enormous global scale. At the same time, the open and anonymous nature of P2P makes it vulnerable to malicious attacks and the spread of malware. In this paper, we discuss in detail the different security attacks on P2P systems and have categorized them as network-related and peer-related attacks. RTMS helps to establish and evaluate Trust, which is the degree of belief that is established to prove that the right user is accessing the right resource. We have explained the different Trust Management schemes used in P2P networks and have compared them on the basis of trust establishment, security features, trust evaluation and weakness. We have surveyed the RTMSs currently in use and have compared them on the basis of reputation collection, aggregation, computation, storage and degree of centralization of reputation computation and management. We also present a comparison of protection provided by RTMs against the various security attacks discussed. Open research issues and challenges that have yet to be addressed in the design of current RTMs have been presented in detail. This survey can be used as a reference guide to understand Trust Management and RTMS for P2P networks and to further research in RTMSs to make them efficient, reliable and scalable to enable and promote the utilization of P2P systems for large communities and applications. c

Trust is an important aspect of Peer-to-Peer (P2P) systems, because in such systems, peers are usually anonymous. A popular method for evaluating trust in P2P systems is to use reputation, where the reputation of a peer is determined based on its prior transactions with other peers. Since no peer has easy access to global knowledge in a decentralized system, the main challenge of this reputation-based method is how to collect and distribute reputation scores of peers efficiently. While several solutions have been proposed to address this challenge, most of them rely on a gossiping algorithm, which is costly and communication-intensive. In this paper, we propose TREMA, a tree-based reputation management solution in which we present a trust model between nodes in the tree, and explain how trust is established and maintained between pairs of nodes. We show that, compared to existing solutions, TREMA allows for scalability and efficient algorithms with low overhead. We present two possible implementations of TREMA, and explain how they could be made stable and robust to network dynamism, thus addressing the greatest weakness of a tree structure. We also analyze each implementation for its security against various adversarial scenarios, and suggest further improvements that are possible for general tree-based systems.

In Peer-to-Peer (P2P) computing area trust issues have gained focus as a result of the decentralized nature of P2P systems where autonomous peers interact with each other without relying on any central authority. There is, thus, the need of a trust system to ensure a level of robustness against malicious nodes. Various reputation-based trust models have been proposed for P2P systems which use similar concepts but focus on different aspects and address different set of design issues. As a result, there is a clear need to investigate the design aspects of reputation-based trust systems that could be deployed in P2P applications. In this paper we present the basic elements and design issues of such systems and compare representative approaches, aiming at supporting the design of reputation systems suitable for particular P2P applications.