Skip to main content
Journal cover image

Making peer-assisted content distribution robust to collusion using bandwidth puzzles

Publication ,  Conference
Reiter, MK; Sekar, V; Spensky, C; Zhang, Z
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
December 15, 2009

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. © 2009 Springer-Verlag.

Duke Scholars

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783642107719

Publication Date

December 15, 2009

Volume

5905 LNCS

Start / End Page

132 / 147

Related Subject Headings

  • Artificial Intelligence & Image Processing
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reiter, M. K., Sekar, V., Spensky, C., & Zhang, Z. (2009). Making peer-assisted content distribution robust to collusion using bandwidth puzzles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5905 LNCS, pp. 132–147). https://doi.org/10.1007/978-3-642-10772-6_11
Reiter, M. K., V. Sekar, C. Spensky, and Z. Zhang. “Making peer-assisted content distribution robust to collusion using bandwidth puzzles.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5905 LNCS:132–47, 2009. https://doi.org/10.1007/978-3-642-10772-6_11.
Reiter MK, Sekar V, Spensky C, Zhang Z. Making peer-assisted content distribution robust to collusion using bandwidth puzzles. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009. p. 132–47.
Reiter, M. K., et al. “Making peer-assisted content distribution robust to collusion using bandwidth puzzles.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5905 LNCS, 2009, pp. 132–47. Scopus, doi:10.1007/978-3-642-10772-6_11.
Reiter MK, Sekar V, Spensky C, Zhang Z. Making peer-assisted content distribution robust to collusion using bandwidth puzzles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009. p. 132–147.
Journal cover image

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783642107719

Publication Date

December 15, 2009

Volume

5905 LNCS

Start / End Page

132 / 147

Related Subject Headings

  • Artificial Intelligence & Image Processing