Managing Trust in a Peer-2-Peer Information System

Managing trust is a problem of particular importance in peer-to-peer environments as one encounters frequently unknown agents. Existing methods for trust management based on reputation do however not scale as they rely on some form of central database or global knowledge to be maintained at each agent. In this paper we illustrate that the problem needs to be addressed at both the data management and the semantic, i.e. trust management, level and we devise a method of how trust assessments can be performed by using at both levels scalable peer-to-peer mechanisms. We expect that such methods are an important factor if fully decentralized peer-to-peer systems should become the platform for more serious applications than simple file exchange

The Reputation, Opinion, Credibility and Quality (ROCQ) Scheme

An implicit assumption of trust in the participants is at the basis of most Peer-to-Peer (P2P) networks. However, in practice, not all participants are benign or cooperative. Identifying such peers is critical to the smooth and effective functioning of a P2P network. In this paper, we present the ROCQ mechanism, a reputation-based trust management system that computes the trustworthiness of peers on the basis of transaction-based feedback. The ROCQ model combines four parameters: Reputation (R) or a peer's global trust rating, Opinion (O) formed by a peer's first-hand interactions, Credibility (C) of a reporting peer and Quality (Q) or the confidence a reporting peer puts on the judgement it provides. We then present a distributed implementation of our scheme over FreePastry, a structured P2P network. Experimental results considering different models for malicious behavior indicate the contexts in which the ROCQ scheme performs better than existing schemes

Implementation of Volatile Secure Model in P2P System: A Detailed Analysis

In network domain system, the peer to peer systems shows an open access rather than other systems.P2P system defines each peer is able to share the information to other peer without the help of any centralized system. So there are more chances of malicious activities .for better security one peer must send some trust parameters along with the recommendations from other peer. This system is fully based on priority, trust worthiness history and peer satisfaction, recommendation. Those peers who is having more recommendations and trustworthiness value, that peer will connect with other peers only. A trust model is derived by integrating the risk management and security, by applying this new method; it provides the utility maximization of peer to peer system. The main objective of the system is to make sure that the peer to peer communication is reliable and secure by the use of the trust model surrounded each and every peer in the system. DOI: 10.17762/ijritcc2321-8169.15068

Network-aware Evaluation Environment for Reputation Systems

Parties of reputation systems rate each other and use ratings to compute reputation scores that drive their interactions. When deciding which reputation model to deploy in a network environment, it is important to find the most suitable model and to determine its right initial configuration. This calls for an engineering approach for describing, implementing and evaluating reputation systems while taking into account specific aspects of both the reputation systems and the networked environment where they will run. We present a software tool (NEVER) for network-aware evaluation of reputation systems and their rapid prototyping through experiments performed according to user-specified parameters. To demonstrate effectiveness of NEVER, we analyse reputation models based on the beta distribution and the maximum likelihood estimation

A Voice for the Voiceless: Peer-to-peer Mobile Phone Networks for a Community Radio Service

We propose a new application for mobile ad-hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue– the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.Comment: 17 pages, 6 figure

The analysis of split graphs in social networks based on the K-Cardinality assignment problem

In terms of social networks, split graphs correspond to the variety of interpersonal and intergroup relations. In this paper we analyse the interaction between the cliques (socially strong and trusty groups) and the independent sets (fragmented and non-connected groups of people) as the basic components of any split graph. Based on the Semi-Lagrangean relaxation for the kcardinality assignment problem, we show the way of minimizing the socially risky interactions between the cliques and the independent sets within the social network