Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowledge, an open problem; e.g., a group of colluding attackers can earn rewards by claiming to have served content to one another, when they have not. We propose a puzzle mechanism to make contribution-aware peer-assisted content distribution robust to such collusion. Our construction ties solving the puzzle to possession of specific content and, by issuing puzzle challenges simultaneously to all parties claiming to have that content, our mechanism prevents one content-holder from solving many others’ puzzles. We prove (in the random oracle model) the security of our scheme, describe our integration of bandwidth puzzles into a media streaming system, and demonstrate the resulting attack resilience via simulations.

• Type: Conference
• Year: 2009
• Where: ICISS
• Authors: Michael K. Reiter, Vyas Sekar, Chad Spensky, Zhenghao Zhang
• Keywords: ICISS 2009, Information System, Many Peer-assisted Content-distribution, Peer-assisted Content Distribution, Puzzles