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

332Citations
Citations of this article
116Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Krohn, M. N., Freedman, M. J., & Mazières, D. (2004). On-the-fly verification of rateless erasure codes for efficient content distribution. In Proceedings - IEEE Symposium on Security and Privacy (Vol. 2004, pp. 226–239). https://doi.org/10.1109/SECPRI.2004.1301326

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free