R-chain: A self-maintained reputation management system in P2P networks

被引:0
作者
Liu, LT [1 ]
Zhang, S [1 ]
Ryu, KD [1 ]
Dasgupta, P [1 ]
机构
[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA
来源
PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS | 2004年
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Trust management is a critical component in P2P file sharing systems due to the free riding and security problem. In this paper, we propose a lightweight reputation management system, R-Chain, where each peer maintains its own transaction history as the reputation. In R-Chain, each transaction is supervised by a few randomly chosen witnesses and each peer keeps a record for every transaction it has participated in. To ensure the integrity, transaction records are signed by the witnesses and organized as a chronicle chain. With very limited data stored on the network, no peer can modify or discard these transaction records without being detected. Compared with other reputation systems, our design is more light-weighted in terms of reputation maintenance and retrieval. It is scalable since each transaction only involves a constant number of peers. By recording the raw transaction history, R-Chain can also be integrated with different trust models to prevent various attacks.
引用
收藏
页码:131 / 136
页数:6
相关论文
共 13 条
  • [1] ABERER K, 2002, P 10 INT C INF KNOWL
  • [2] ABERER K, 2001, P 6 INT C COOP INF S
  • [3] CORNELLI F, P WWW 2002
  • [4] DEWAN P, 2004, WPDRTS
  • [5] DOUCEUR J, 2002, P IPTPS 02
  • [6] KAMVAR SD, P WWW 2003
  • [7] LEE S, 2003, P IEEE INFOCOM
  • [8] OOI BC, 2003, P 4 INT C WEB AG INF
  • [9] Rowstron A, 2003, IFIPACM INT C DISTRI
  • [10] SAROIU S, 2002, P MULTIMEDIA COMPUTI