Reputation management algorithms for DHT-based peer-to-peer environment

Fedotova, Natalya; Veltri, Luca

doi:10.1016/j.comcom.2009.03.002

Cited by 13 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tian et al [15] proposed a super-peer based trust model, in which peers gather in a group according to their interest similarity and unfair feedbacks are filtered by algorithm based on peers similarity. In addition, a reputation management algorithm for distributed hash table (DHT)-based P2P environment is presented to select "good" peers cooperating and withstand malicious activity of single malevolent peers and their collusions as well [16] . Moreover, a role-based trust model is presented to establish trust among anonymous peers exactly [17] .…”

Section: Related Workmentioning

confidence: 99%

METrust: A mutual evaluation-based trust model for P2P networks

Cheng

Gao

2012

Int. J. Autom. Comput.

View full text Add to dashboard Cite

It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.

show abstract

Section: Related Workmentioning

confidence: 99%

METrust: A mutual evaluation-based trust model for P2P networks

Cheng

Gao

2012

Int. J. Autom. Comput.

View full text Add to dashboard Cite

show abstract

“…In our opinion this assumption appears too strong; transitive trust should be conditional, rather than assumed a priori. On the other hand, the EigenTrust algorithm has many interesting features, namely self-policing, anonymity preservation, reputation improvement as a consequence of lasting fair behaviour, overhead minimization, and robustness against malicious collectives -for these reasons, it is still often used as a starting point for other protocols (Fedotova and Veltri, 2009).…”

Section: Votingmentioning

confidence: 99%

Distributed reputation management for service-oriented peer-to-peer enterprise communities

Zanichelli

Amoretti

2016

IJCSE

View full text Add to dashboard Cite

Peer-to-peer service sharing might allow for unmediated, almost instantaneous inter-firm collaboration, yet robust reputation management techniques are strongly required to withstand fraudulent actions of malicious peers. In this paper we illustrate a distributed reputation management system for service-oriented peer-to-peer networks, called SAFE, which exploits voting and effectively copes with trust misrepresentation attempts. Simulation results show that SAFE allows peers to select high-quality services, even when a large extent of malicious providers and advisors are active in the community. from Universit degli Studi di Parma (Italy). Currently, he is Research Associate at the same university. His research focuses on modeling and simulation of large-scale distributed systems, in particular those based on the peer-to-peer paradigm, complex adaptive systems and autonomic computing, design and development of service-oriented architectures, as well as wireless sensor networks. He has published over 80 technical papers in refereed international journals and conference proceedings.Francesco Zanichelli received the Dr. Eng degree (Master) in Electronic Engineering at the University of Bologna and the Ph.D. degree in Information Technologies at the University of Parma. He is currently an Aggregate Professor with the Department of Information Engineering of the University of Parma, where he is teaching the Operating Systems course. After several years devoted to the study of intelligent robotics and robot programming, current research interests of Francesco Zanichelli include service-oriented peer-to-peer systems and middleware, as well as distributed multimedia architectures and protocols, including security and Quality of Service.In this work, we illustrate a Distributed RMS (DRMS) for service-oriented P2P networks, called Service Advisors For E-business (SAFE), that effectively

show abstract

“…Reputation management in Peer-to-Peer networks based on Distributed Hash Tables (DHT) is the main idea presented by (Fedotova and Veltri 2009). The authors proposed an algorithm that permits the peers in the network to obtain individual ranking values for each node based on knowledge exchange.…”

Section: Related Workmentioning

confidence: 99%

Trust models for efficient communication in Mobile Cloud Computing and their applications to e-Commerce

Pop

Dobre

Mocanu

et al. 2015

Enterprise Information Systems

View full text Add to dashboard Cite

Managing the large dimensions of data processed in distributed systems that are formed by datacenters and mobile devices has become a challenging issue with an important impact on the end-user. Therefore, the management process of such systems can be achieved efficiently by using uniform overlay networks, interconnected through secure and efficient routing protocols. The aim of this paper is to advance our previous work with a novel trust model based on a reputation metric that actively uses the social links between users and the model of interaction between them. We present and evaluate an adaptive model for the trust management in structured overlay networks, based on a Mobile Cloud architecture and considering a honeycomb overlay. Such a model can be useful for supporting advanced mobile market-share e-Commerce platforms, where users collaborate and exchange reliable information about, for example, products of interest and supporting ad-hoc business campaigns

show abstract

Reputation management algorithms for DHT-based peer-to-peer environment

Cited by 13 publications

References 22 publications

METrust: A mutual evaluation-based trust model for P2P networks

METrust: A mutual evaluation-based trust model for P2P networks

Distributed reputation management for service-oriented peer-to-peer enterprise communities

Trust models for efficient communication in Mobile Cloud Computing and their applications to e-Commerce

Contact Info

Product

Resources

About