2004 IEEE Symposium on Security and Privacy On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution Berkeley, California May 09-May 12 ISBN: 0-7695-2136-3
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.
Citation:
Maxwell N. Krohn, Michael J. Freedman, David Mazi?res, "On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution," sp, pp.226, 2004 IEEE Symposium on Security and Privacy, 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||