P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains

被引:26
作者
Dewan, Prashant [1 ]
Dasgupta, Partha [2 ]
机构
[1] Intel Corp, Hillsboro, OR 97124 USA
[2] Arizona State Univ, Dept Comp Sci, Tempe, AZ 85287 USA
关键词
Peer-to-peer networks; distributed systems; security; reputations; identity management;
D O I
10.1109/TKDE.2009.45
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Peer-to-peer (P2P) networks are vulnerable to peers who cheat, propagate malicious code, leech on the network, or simply do not cooperate. The traditional security techniques developed for the centralized distributed systems like client-server networks are insufficient for P2P networks by the virtue of their centralized nature. The absence of a central authority in a P2P network poses unique challenges for reputation management in the network. These challenges include identity management of the peers, secure reputation data management, Sybil attacks, and above all, availability of reputation data. In this paper, we present a cryptographic protocol for ensuring secure and timely availability of the reputation data of a peer to other peers at extremely low costs. The past behavior of the peer is encapsulated in its digital reputation, and is subsequently used to predict its future actions. As a result, a peer's reputation motivates it to cooperate and desist from malicious activities. The cryptographic protocol is coupled with self-certification and cryptographic mechanisms for identity management and countering Sybil attack. We illustrate the security and the efficiency of the system analytically and by means of simulations in a completely decentralized Gnutella-like P2P network.
引用
收藏
页码:1000 / 1013
页数:14
相关论文
共 42 条
[1]  
Aberer K., 2001, Proceedings of the 2001 ACM CIKM. Tenth International Conference on Information and Knowledge Management, P310, DOI 10.1145/502585.502638
[2]  
[Anonymous], 2003, P 13 INT WORKSHOP NE
[3]  
[Anonymous], 2001, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, DOI DOI 10.1007/3-540-45518-3_18
[4]  
[Anonymous], 2000, DESIGN ANAL EXPT
[5]  
[Anonymous], 2002, ACM C COMP COMM SEC
[6]  
[Anonymous], 2003, ROLE BASED ACCESS CO
[7]  
[Anonymous], 2000, P HAW INT C SYST SCI
[8]  
CACHIN C, 2002, ASYNCHRONOUS VERIFIA
[9]  
Camenisch J., ACM CCS 2002
[10]   Secure routing for structured peer-to-peer overlay networks [J].
Castro, M ;
Druschel, P ;
Ganesh, A ;
Rowstron, A ;
Wallach, DS .
USENIX ASSOCIATION PROCEEDINGS OF THE FIFTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, 2002, :299-314