On-the-fly verification of rateless erasure codes for efficient content distribution

Maxwell N. Krohn, Michael J. Freedman, David Mazières

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

261 Scopus citations

Abstract

The quality of peer-to-peer content distribution can suffer when malicious participants intentionally corrupt content. Some systems using simple block-by-block downloading can verify blocks with traditional cryptographic signatures and hashes, but these techniques do not apply well to more elegant systems that use rateless erasure codes for efficient multicast transfers. This paper presents a practical scheme, based on homomorphic hashing, that enables a downloader to perform on-the-fly verification of erasure-encoded blocks.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Symposium on Security and Privacy
Pages226-239
Number of pages14
DOIs
StatePublished - 2004
EventProceedings - 2004 IEEE Symposium on Security and Privacy - Berkeley, CA, United States
Duration: May 9 2004May 12 2004

Publication series

NameProceedings - IEEE Symposium on Security and Privacy
Volume2004

Other

OtherProceedings - 2004 IEEE Symposium on Security and Privacy
CountryUnited States
CityBerkeley, CA
Period5/9/045/12/04

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this