A Hierarchical Trust Model for Peer-to-Peer Networks

Peer-to-Peer (P2P) Systems have attracted significant interest in recent years. In P2P networks, each peer acts as both a server and client. This characteristic makes peers vulnerable to a wide variety of attacks. Having robust trust management is very critical for such open environment to exclude unreliable peer from the system. Managing trust is a problem in peer to peer environment, so our SORT model is built based on trust metrics. The trust metrics such as reputation, service trust, recommendation trust are defined to precisely measure trustworthiness of peers. A peer's trustworthiness is evaluated by considering provided services and given recommendations with service and recommendation contexts. When evaluating recommendation, recommender's trustworthiness and confidence level about the information provided are also considered. Experiments on file sharing application demonstrate that peers with the highest trust value are considered and build the trust model in their contiguity and insulate malignant peers. Building trust relationships among peers can mitigate attacks of malicious peers. Peers create their own trust network in their proximity by using local information available and global trust information.

Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender's trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behaviour models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.

Journal of Information Processing, 2012

Peer-to-Peer (P2P) systems have attracted considerable attention in recent years, as a key technology to realize scalable, dependable network services. However, because of its high anonymity, P2P systems involve several drawbacks such as the weakness against malicious attacks by anonymous peers. In this paper, we propose a method to evaluate the trustworthiness of each peer by explicitly taking into account the accuracy of mutual evaluations. The proposed method is an extension of the EigenTrust proposed by Kamvar et al. which calculates a global trust vector consistent with the observed local trust vectors under the weighted sum in a linear space. The performance of the proposed method is evaluated by simulation. The result of simulations indicates that the proposed method identifies a large subset of reliable peers with a sufficiently small number of message transmissions compared with a simple modification of the EigenTrust.

2005

Abstract P2P applications support exchanging resources while preserving total or partial anonymity of both requestors and providers. However, concerns have been raised about the possibility that anonymity may encourage malicious peers to spread tampered-with resources (eg, malicious programs and viruses). A considerable amount of research is now being carried out on the development of trust and reputation models in P2P networks.

TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES, 2018

Detecting malicious peers is a challenging task in peer-to-peer networks due to their decentralized structure and lack of central authority. Trust models can help identify malicious peers by maintaining information about peer relations and interactions. Keeping information about trust relations helps to reduce risks when providing or using services. This paper introduces two consistency concepts in trust management. Feedback consistency is used to evaluate how consistent feedback is with respect to past feedbacks. On the other side, peer consistency measures consistency of a peer's past feedbacks. These metrics help to reduce malicious interactions and increase successful downloads. Furthermore, the model offers better service quality for good peers by using consistency metrics. A file-sharing application is implemented on a simulation environment. The proposed model can effectively reduce the malicious download rate, even in 50% malicious environments, and increases successful download rates.

2005

Popularity of peer-to-peer (P2P) networks exposed a number of security vulnerabilities including the problem of finding reliable communication partners. In this paper, we present an integrated trust framework for P2P networks that quantifies the trustworthiness of a peer using reputation-based trust mechanism and anomaly detection technique. We describe anomaly detection procedure that analyzes peer activity on the network and flags potentially malicious behavior by detecting deviation from peer profile. We study the performance of our trust framework using simulation and compare it with the existing reputation-based system which does not employ an anomaly detection mechanism.

2005 IEEE International Conference on Services Computing (SCC'05) Vol-1, 2005

In peer-to-peer (P2P) environments, a peer needs to in- teract with unknown peers for the services provided. This requires the trust evaluation prior to and posterior to in- teractions. This paper presentsTrust2: a novel and dy- namic peer trust evaluation model, which aims to measure the credibility of peers' recommendations, and thus to fil- ter noise in responses and obtain

This paper presents a way of reducing the risk involved with downloading corrupt content from unknown (and hence untrusted) prin- cipals in a P2P network. This paper gives a brief overview of the need for trust in P2P networks, introduces a new notion called trust*, and shows how this may be used in place of the conventional notion of trust. Finally, we apply trust* to the Turtle P2P client and show how the in- tegrity of downloaded content can be guaranteed without assuming that trust is transitive.

IEEE Local Computer Network Conference, 2010

Peer-to-peer (P2P) networks have shown great potentials in providing a wide range of services starting from simple file sharing to distributed computing. However, P2P systems present ominous threats due to its anonymous and dynamic nature. One feasible way to minimize the threats is to evaluate the trust and reputation of the interacting peers. Trust models have often been deployed in determining the trust of peers in the network with the view to avoiding the malicious ones. Most of the existing trust models can successfully isolate malicious peers when the peers behave in a predictable way while others even fail to do so. On the other hand, these models suffer greatly when peers start to behave in a unpredictable way. Moreover, these models are ineffective in providing quick response to a peer's dynamic personality. To cope with such strategically altering behavior we present in this paper, a feedback based fast adaptive trust model which takes into account various factors in computing the trust of peers including recent trend, historical trend, sudden deviation of trust and so on. Simulations show that our model compared to other existing models can effectively identify and isolate the dynamic behavioral change of malicious peers.

Proceedings of World Academy of Science, …, 2007

Abstract— Trust management is one of the drawbacks in Peer-to-Peer (P2P) system. Lack of centralized control makes it difficult to control the behavior of the peers. Reputation system is one approach to provide trust assessment in P2P system. In this paper, we use fuzzy logic ...