FineTrust: A fine-grained trust model for peer-to-peer networks

Yizhi Ren, Mingchu Li, Kouichi Sakurai

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Trust research is a key issue in peer-to-peer (P2P) networks. Reputation-based trust models as one of the good solutions to resolve the trust problems in P2P network are received more and more attention in recent years. One of the fundamental challenges is to capture the evolving nature of a trust relationship between peers and reflect the varied bias or preference of peers in a distributed and open environment. In this paper, we present a fine-grained trust computation model for P2P networks. Our model defines the service as a fined-grained quality-of-service (QoS) (N-dimensional vector), and in order to accurate the recommendation trust computing, several concepts are introduced to reflect the recommenders' current status, history behavior, and the gap between these two behaviors. Also, we firstly introduce the Gauss-bar function to measure the preference similarity between peers. All these will result in a flexible model which represents trust in a manner more close to human intuitions and satisfies the diverse QoS requirements of peers in P2P networks. The extensive simulations have confirmed the efficiency of our model.

Original languageEnglish
Pages (from-to)61-69
Number of pages9
JournalSecurity and Communication Networks
Volume4
Issue number1
DOIs
Publication statusPublished - Jan 1 2011
Externally publishedYes

Fingerprint

Peer to peer networks
Quality of service

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

FineTrust : A fine-grained trust model for peer-to-peer networks. / Ren, Yizhi; Li, Mingchu; Sakurai, Kouichi.

In: Security and Communication Networks, Vol. 4, No. 1, 01.01.2011, p. 61-69.

Research output: Contribution to journalArticle

@article{6142a61e94ad4705a9eedb0394eb533c,
title = "FineTrust: A fine-grained trust model for peer-to-peer networks",
abstract = "Trust research is a key issue in peer-to-peer (P2P) networks. Reputation-based trust models as one of the good solutions to resolve the trust problems in P2P network are received more and more attention in recent years. One of the fundamental challenges is to capture the evolving nature of a trust relationship between peers and reflect the varied bias or preference of peers in a distributed and open environment. In this paper, we present a fine-grained trust computation model for P2P networks. Our model defines the service as a fined-grained quality-of-service (QoS) (N-dimensional vector), and in order to accurate the recommendation trust computing, several concepts are introduced to reflect the recommenders' current status, history behavior, and the gap between these two behaviors. Also, we firstly introduce the Gauss-bar function to measure the preference similarity between peers. All these will result in a flexible model which represents trust in a manner more close to human intuitions and satisfies the diverse QoS requirements of peers in P2P networks. The extensive simulations have confirmed the efficiency of our model.",
author = "Yizhi Ren and Mingchu Li and Kouichi Sakurai",
year = "2011",
month = "1",
day = "1",
doi = "10.1002/sec.165",
language = "English",
volume = "4",
pages = "61--69",
journal = "Security and Communication Networks",
issn = "1939-0122",
publisher = "John Wiley and Sons Inc.",
number = "1",

}

TY - JOUR

T1 - FineTrust

T2 - A fine-grained trust model for peer-to-peer networks

AU - Ren, Yizhi

AU - Li, Mingchu

AU - Sakurai, Kouichi

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Trust research is a key issue in peer-to-peer (P2P) networks. Reputation-based trust models as one of the good solutions to resolve the trust problems in P2P network are received more and more attention in recent years. One of the fundamental challenges is to capture the evolving nature of a trust relationship between peers and reflect the varied bias or preference of peers in a distributed and open environment. In this paper, we present a fine-grained trust computation model for P2P networks. Our model defines the service as a fined-grained quality-of-service (QoS) (N-dimensional vector), and in order to accurate the recommendation trust computing, several concepts are introduced to reflect the recommenders' current status, history behavior, and the gap between these two behaviors. Also, we firstly introduce the Gauss-bar function to measure the preference similarity between peers. All these will result in a flexible model which represents trust in a manner more close to human intuitions and satisfies the diverse QoS requirements of peers in P2P networks. The extensive simulations have confirmed the efficiency of our model.

AB - Trust research is a key issue in peer-to-peer (P2P) networks. Reputation-based trust models as one of the good solutions to resolve the trust problems in P2P network are received more and more attention in recent years. One of the fundamental challenges is to capture the evolving nature of a trust relationship between peers and reflect the varied bias or preference of peers in a distributed and open environment. In this paper, we present a fine-grained trust computation model for P2P networks. Our model defines the service as a fined-grained quality-of-service (QoS) (N-dimensional vector), and in order to accurate the recommendation trust computing, several concepts are introduced to reflect the recommenders' current status, history behavior, and the gap between these two behaviors. Also, we firstly introduce the Gauss-bar function to measure the preference similarity between peers. All these will result in a flexible model which represents trust in a manner more close to human intuitions and satisfies the diverse QoS requirements of peers in P2P networks. The extensive simulations have confirmed the efficiency of our model.

UR - http://www.scopus.com/inward/record.url?scp=79951784320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79951784320&partnerID=8YFLogxK

U2 - 10.1002/sec.165

DO - 10.1002/sec.165

M3 - Article

AN - SCOPUS:79951784320

VL - 4

SP - 61

EP - 69

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0122

IS - 1

ER -