On-the-fly verification of rateless erasure codes for efficient content distribution (2004)
Cached
Download Links
- [www.pdos.csail.mit.edu]
- [project-iris.net]
- [iris.csail.mit.edu]
- [www.cs.princeton.edu:80]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu.nyud.net]
- [www.pdos.lcs.mit.edu]
- [pdos.csail.mit.edu]
- [www.scs.cs.nyu.edu]
- [www.cs.huji.ac.il]
- [www.scs.stanford.edu]
- [www.pdos.lcs.mit.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the IEEE Symposium on Security and Privacy |
| Citations: | 57 - 4 self |
BibTeX
@INPROCEEDINGS{Krohn04on-the-flyverification,
author = {Maxwell N. Krohn},
title = {On-the-fly verification of rateless erasure codes for efficient content distribution},
booktitle = {In Proceedings of the IEEE Symposium on Security and Privacy},
year = {2004},
pages = {226--240}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. I.
