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

Myung Joo Ham, Gul Agha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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%.

Original languageEnglish (US)
Title of host publicationProceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Pages125-132
Number of pages8
DOIs
StatePublished - Dec 1 2005
Event5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005 - onstanz, Germany
Duration: Aug 31 2005Sep 2 2005

Publication series

NameProceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Volume2005

Other

Other5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005
CountryGermany
Cityonstanz
Period8/31/059/2/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'ARA: A robust audit to prevent free-riding in P2P networks'. Together they form a unique fingerprint.

  • Cite this

    Ham, M. J., & Agha, G. (2005). ARA: A robust audit to prevent free-riding in P2P networks. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 (pp. 125-132). [1551028] (Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005; Vol. 2005). https://doi.org/10.1109/P2P.2005.2