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

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2004, Issue , 2004, Pages 226-239

  Krohn, Maxwell N ^a   Freedman, Michael J ^b   Mazières, David ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC SIGNATURES; MULTICAST SYSTEMS; MULTICAST TRANSMISSION; SOURCE NODES;

BANDWIDTH; COMPUTER SIMULATION; CRYPTOGRAPHY; ENCODING (SYMBOLS); FILE ORGANIZATION; FUNCTIONS; MULTICASTING; PROBABILITY; SIGNAL RECEIVERS; SYNCHRONIZATION;

BLOCK CODES;

EID: 3543050732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECPRI.2004.1301326     Document Type: Conference Paper

References (42)

1. S. Saroui, K. P. Gummadi, R. J. Dunn, S. D. Gribble, and H. M. Levy, "An analysis of Internet content delivery systems," in Proc. 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Oct. 2002.
2. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), El Paso, TX, May 1997.
3. M. Luby, "LT codes," in Proc. 43rd Annual Symposium on Foundations of Computer Science (FOCS), Vancouver, Canada, Nov. 2002.
4. P. Maymounkov, "Online codes," NYU, Tech. Rep. 2002-833, Nov. 2002.
5. A. Shokrollahi, "Raptor codes," Digital Fountain, Inc., Tech. Rep. DF2003-06-001, June 2003.
6. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A Digital Fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM '98, Vancouver, Canada, Sept. 1998.
7. J. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads," in Proc. IEEE INFOCOM '99, New York, NY, Mar. 1999.
8. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost, "Informed content delivery across adaptive overlay networks," in Proc. ACM SIGCOMM '02, Aug. 2002.
9. P. Maymounkov and D. Mazières, "Rateless codes and big downloads," in Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, Feb. 2003.
10. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "Splitstream: High-bandwidth multicast in a cooperative environment," in Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Bolton's Landing, NY, Oct. 2003.
11. D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High bandwidth data dissemination using an overlay mesh," in Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Bolton's Landing, NY, Oct. 2003.
12. L. Rizzo, "Effective erasure codes for reliable computer communication protocols," ACM Computer Communication Review, vol. 27, no. 2, Apr. 1997.
13. FIPS 180-1, Secure Hash Standard, U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Springfield, VA, Apr. 1995.
14. C. Karlof, N. Sastry, Y. Li, A. Perrig, and J. Tygar, "Distillation codes and applications to DoS resistant multicast authentication," in Proc. 11th Network and Distributed Systems Security Symposium (NDSS), San Diego, CA, Feb. 2004.
15. R. C. Merkle, "A digital signature based on a conventional encryption function," in Advances in Cryptology - CRYPTO '87, Santa Barbara, CA, Aug. 1987.
16. National Institute of Standards and Technology, "Digital Signature Standard (DSS)," Federal Information Processing Standards Publication 186-2, U.S. Dept. of Commerce/NIST, 2000.
17. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Advances in Cryptology - CRYPTO '91, Santa Barbara, CA, Aug. 1991.
18. D. Chaum, E. van Heijst, and B. Pfitzmann, "Cryptographically strong undeniable signatures, unconditionally secure for the signer," in Advances in Cryptology - CRYPTO '91, Santa Barbara, CA, Aug. 1991.
19. M. Bellare, J. Garay, and T. Rabin, "Fast batch verification for modular exponentiation and digital signatures," in Advances in Cryptology - EUROCRYPT 98, Helsinki, Finland, May 1998.
20. 'M. O. Rabin, "Digitalized signatures and public key functions as intractable as factorization," MIT Laboratory for Computer Science, Tech. Rep. TR-212, Jan. 1979.
21. M. Bellare, O. Goldreich, and S. Goldwasser, "Incremental cryptography: The case of hashing and signing," in Advances in Cryptology CKYPTO '94, Santa Barbara, CA, Aug. 1994.
22. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast security: A taxonomy and some efficient constructions," in Proc. IEEE INFOCOM '99, New York, NY, 1999.
23. R. Gennaro and P. Rohatgi, "How to sign digital streams," in Advances in Cryptology - CRYPTO '97, Santa Barbara, CA, Aug. 1997.
24. C. K. Wong and S. S. Lam, "Digital signatures for flows and multicasts," in Proc. IEEE International Conference on Network Protocols, Austin, TX, Oct. 1998.
25. P. Rohatgi, "A compact and fast hybrid signature scheme for multicast packet authentication" in Proc. 6th ACM Conference on Computer and Communication Security (CCS), Singapore, Nov. 1999.
26. P. Golle and N. Modadugu, "Authenticated streamed data in the presernce of random packet loss," in Proc. Network and Distributed System Security Symposium (NDSS), San Diego, CA, Feb. 2001.
27. S. Miner and J. Staddon, "Graph-based authentication of digital streams," in Proc. IEEE Symposium on Security and Privacy, Oakland, CA, May 2000.
28. A. Pannetrat and R. Molva, "Efficient multicast packet authentication," in Proc. Network and Distributed System Security Symposium (NDSS), San Diego, CA, Feb. 2003.
29. J. M. Park, E. K. P. Chong, and H. J. Siegel, "Efficient multicast stream authentication using erasure codes," ACM Trans. Inf. Syst. Secur., vol. 6, no. 2, 2003.
30. S. Cheung, "An efficient message authentication scheme for link state routing," in Proc. 13th Annual Computer Security Applications Conference, San Diego, CA, Dec. 1997.
31. R. Anderson, F. Bergadano, B. Crispo, J.-H. Lee, C. Manifavas, and R. Needham, "A new family of authentication protocols," Operating Systems Review, vol. 32, no. 4, Oct. 1998.
32. A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient authentication and signature of multicast streams over lossy channels," in Proc. IEEE Symposium on Security and Privacy, Oakland, CA, May 2000.
33. _, "Efficient and secure source authentication for multicast," in Proc. Network and Distributed System Security Symposium (NDSS), San Diego, CA, Feb. 2001.
34. A. Perrig, "The BiBa one-time signature and broadcast authentication protocol," in Proc. 8th ACM Conference on Computer and Communication Security (CCS), Philadelphia, PA, Nov. 2001.
35. J. Benaloh and M. de Mare, "One-way accumulators: A decentralized alternative to digital sinatures," in Advances in Cryptology EUROCRYPT 93, Lofthus, Norway, May 1993.
36. N. Barić and B. Pfitzmann, "Collision-free accumulators and fail-stop signature schemes without trees," in Advances in Cryptology EUROCRYPT 97, Konstanz, Germany, May 1997.
37. M. Bellare and D. Micciancio, "A new paradigm for collision-free hashing: Incrementality at reduced cost," in Advances in Cryptology EUROCRYPT 97, Konstanz, Germany, May 1997.
38. J. Camenisch and A. Lysyanskaya, "Dynamic accumulators and application to efficient revocation of anonymous credentials," in Advances in Cryptology - CRYPTO 2002, Santa Barbara, CA, Aug. 2002.
39. G. Tsudik and S. Xu, "Accumulating composites and improved group signing," in Advances in Cryptology - ASIACRYPT-2003, Taipei, Taiwan, Nov. 2003.
40. S. Micali and R. Rivest, "Transitive signature schemes," in Progress in Cryptology - CT-RSA 2002, San Jose, CA, Feb. 2002.
41. S. Chari, T. Rabin, and R. Rivest, "An efficient signature scheme for route aggregation," Feb. 2002.
42. R. Johnson, D. Molnar, D. Song, and D. Wagner, "Homomorphic signature schemes," in Progress in Cryptology - CT-RSA 2002, San Jose, CA, Feb. 2002.