ARA: A robust audit to prevent free-riding in P2P networks

被引:21
作者
Ham, MJ [1 ]
Agha, G [1 ]
机构
[1] Univ Illinois, Open Syst Lab, Dept Comp Sci, Urbana, IL 61801 USA
来源
FIFTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS | 2005年
关键词
D O I
10.1109/P2P.2005.2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A number of solutions have been proposed to address the free-riding problem in peer-to-peer file sharing systems. The solutions are either imperfect-they allow some users to cheat the system with malicious behavior or expensive-they require human intervention, require servers, or incur high mental transaction costs. We propose a method to address these weaknesses. Specifically, we introduce a utility function to capture contributions made by a user and an auditing scheme to ensure the integrity of a utility function's values. Our method enables us to reduce cheating by a malicious peer: we show that our approach can efficiently detect malicious peers with a probability over 98%.
引用
收藏
页码:125 / 132
页数:8
相关论文
共 17 条
[1]  
Adar E., 2000, First Monday, V5, DOI 10.5210/fm.v5i10.792
[2]  
[Anonymous], 2 ANN PKI RES WORKSH
[3]   THE EVOLUTION OF COOPERATION [J].
AXELROD, R ;
HAMILTON, WD .
SCIENCE, 1981, 211 (4489) :1390-1396
[4]  
Bretzke H, 2003, LECT NOTES ARTIF INT, V2702, P218
[5]  
COLEMAN N, 2003, RIAA MUSIC PIRACY DE
[6]  
FSICHMANN M, 2003, FREE RIDERS FACT FIC
[7]  
GOLLE P, 2001, ACM C EL COMM, P264
[8]  
GRAHAM RL, 2001, P2P2001
[9]   TRAGEDY OF COMMONS [J].
HARDIN, G .
SCIENCE, 1968, 162 (3859) :1243-+
[10]  
LAI K, 2003, P WORKSH EC PEER PEE