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

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

doi:10.1109/SECPRI.2004.1301326

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 proceeding › Conference contribution

308 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 language	English (US)
Title of host publication	Proceedings - IEEE Symposium on Security and Privacy
Pages	226-239
Number of pages	14
DOIs	https://doi.org/10.1109/SECPRI.2004.1301326
State	Published - 2004
Externally published	Yes
Event	Proceedings - 2004 IEEE Symposium on Security and Privacy - Berkeley, CA, United States Duration: May 9 2004 → May 12 2004

Publication series

Name	Proceedings - IEEE Symposium on Security and Privacy
Volume	2004

Other

Other	Proceedings - 2004 IEEE Symposium on Security and Privacy
Country/Territory	United States
City	Berkeley, CA
Period	5/9/04 → 5/12/04

All Science Journal Classification (ASJC) codes

Engineering(all)

Access to Document

10.1109/SECPRI.2004.1301326

Cite this

@inproceedings{65f108410e1644a5a7089a97ce080f53,

title = "On-the-fly verification of rateless erasure codes for efficient content distribution",

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.",

author = "Krohn, {Maxwell N.} and Freedman, {Michael J.} and David Mazi{\`e}res",

year = "2004",

doi = "10.1109/SECPRI.2004.1301326",

language = "English (US)",

isbn = "0769521363",

series = "Proceedings - IEEE Symposium on Security and Privacy",

pages = "226--239",

booktitle = "Proceedings - IEEE Symposium on Security and Privacy",

}

Krohn, MN, Freedman, MJ & Mazières, D 2004, On-the-fly verification of rateless erasure codes for efficient content distribution. in Proceedings - IEEE Symposium on Security and Privacy. Proceedings - IEEE Symposium on Security and Privacy, vol. 2004, pp. 226-239, Proceedings - 2004 IEEE Symposium on Security and Privacy, Berkeley, CA, United States, 5/9/04. https://doi.org/10.1109/SECPRI.2004.1301326

On-the-fly verification of rateless erasure codes for efficient content distribution. / Krohn, Maxwell N.; Freedman, Michael J.; Mazières, David.
Proceedings - IEEE Symposium on Security and Privacy. 2004. p. 226-239 (Proceedings - IEEE Symposium on Security and Privacy; Vol. 2004).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Krohn, Maxwell N.

AU - Freedman, Michael J.

AU - Mazières, David

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3543050732&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3543050732&partnerID=8YFLogxK

U2 - 10.1109/SECPRI.2004.1301326

DO - 10.1109/SECPRI.2004.1301326

M3 - Conference contribution

AN - SCOPUS:3543050732

SN - 0769521363

SN - 9780769521367

T3 - Proceedings - IEEE Symposium on Security and Privacy

SP - 226

EP - 239

BT - Proceedings - IEEE Symposium on Security and Privacy

T2 - Proceedings - 2004 IEEE Symposium on Security and Privacy

Y2 - 9 May 2004 through 12 May 2004

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this