Puzzles in P2P systems
Published 1 January 2004
Andrei Serjantov, Stephen P. Lewis
Citations12
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Using client puzzles to provide incentives for users in a peer-to-peer system to behave in a uniform way can be used to encourage users of a system to share content or perform ‘community’ tasks.
Abstract
In this paper we consider using client puzzles to provide incentives for users in a peer-to-peer system to behave in a uniform way. The techniques developed can be used to encourage users of a system to share content (combating the free riding problem) or perform `community' tasks.
Keywords
PsychologyComputer Science
First MondayFree riding on Gnutella
1,529 Citations2000Eytan Adar, Bernardo A. Huberman
It is argued that free riding leads to degradation of the system performance and adds vulnerability to the system, and copyright issues might become moot compared to the possible collapse of such systems.
Lecture notes in computer sciencePricing via Processing or Combatting Junk Mail
1,271 Citations2007Cynthia Dwork, Moni Naor
A computational technique for combatting junk mail in particular and controlling access to a shared resource in general is presented, which requires a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use.
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
1,058 Citations2001Andy Oram
Lecture notes in computer scienceIncentives for Sharing in Peer-to-Peer Networks
258 Citations2001Philippe Golle, Kevin Leyton‐Brown +2 more
ACM Transactions on Internet TechnologyModerately hard, memory-bound functions
216 Citations2005Martı́n Abadi, Mike Burrows +2 more
A family of moderately hard, memory-bound functions is described and analyzed, and how to use them for protecting against abuses is explained, and a reliance on memory- bound computations is relied on.
Lecture notes in computer scienceEnforcing Fair Sharing of Peer-to-Peer Resources
156 Citations2003Tsuen‐Wan Ngan, Dan S. Wallach +1 more
It is shown how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and simulation results are presented that show the communication overhead of auditing is small and scales well to large networks.
Incentives in peer-to-peer and grid networking
13 Citations2002T. Ackemann, Richard H. Gold +2 more
By introducing soft incentives to offer resources to other nodes, this work sees an overall performance gain in traditional file-sharing networks and also sees soft incentives promoting the convergence of peer-to-peer and Grid networks.