• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

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

Cached

  • Download as a PDF

Download Links

  • [www.pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.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.cs.princeton.edu]
  • [www.coralcdn.org]
  • [coralcdn.org]
  • [www.cs.cornell.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [pdos.lcs.mit.edu]
  • [pdos.csail.mit.edu]
  • [www.scs.cs.nyu.edu]
  • [www.cs.huji.ac.il]
  • [www.scs.stanford.edu]
  • [www.scs.stanford.edu]
  • [www.pdos.lcs.mit.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Maxwell N. Krohn
Venue:In Proceedings of the IEEE Symposium on Security and Privacy
Citations:137 - 4 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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}
}

Share

Facebook Twitter Reddit Bibsonomy

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.

Keyphrases

on-the-fly verification    rateless erasure code    efficient content distribution    efficient multicast transfer    elegant system    erasure-encoded block    peer-to-peer content distribution    homomorphic hashing    practical scheme    traditional cryptographic signature    malicious participant    simple block-by-block downloading    corrupt content   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University