On-the-fly verification of rateless erasure codes for efficient content distribution
- 10 June 2004
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 24 references indexed in Scilit:
- Efficient multicast stream authentication using erasure codesACM Transactions on Information and System Security, 2003
- Accumulating Composites and Improved Group SigningLecture Notes in Computer Science, 2003
- Dynamic Accumulators and Application to Efficient Revocation of Anonymous CredentialsLecture Notes in Computer Science, 2002
- Homomorphic Signature SchemesLecture Notes in Computer Science, 2002
- Transitive Signature SchemesLecture Notes in Computer Science, 2002
- An analysis of internet content delivery systemsPublished by Association for Computing Machinery (ACM) ,2002
- Incremental Cryptography: The Case of Hashing and SigningPublished by Springer Science and Business Media LLC ,2001
- A new family of authentication protocolsACM SIGOPS Operating Systems Review, 1998
- Effective erasure codes for reliable computer communication protocolsACM SIGCOMM Computer Communication Review, 1997
- How to sign digital streamsPublished by Springer Science and Business Media LLC ,1997