Distillation Codes and Applications to DoS Resistant Multicast Authentication

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2004

Volumn , Issue , 2004, Pages

  Karlof, Chris ^a   Sastry, Naveen ^a   Li, Yaping ^a   Perrig, Adrian ^b   Tygar, J D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CMU ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; DECODING; DENIAL-OF-SERVICE ATTACK; FORWARD ERROR CORRECTION; MULTICASTING; NETWORK SECURITY; PACKET NETWORKS;

ARBITRARY PATTERNS; ATTACK TRAFFIC; DECODING PROCESS; DENIAL OF SERVICE; DENIALOF- SERVICE ATTACKS; ERASURE CODES; LOW OVERHEAD; LOW-BANDWIDTH; PACKETS LOSS; POLLUTION ATTACK;

DISTILLATION;

EID: 24944508408     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. OpenSSL. http://www.openssl.org/.
2. D. Adkins, K. Lakshminarayanan, A. Perrig, and I. Stoica. Taming IP packet flooding attacks. In Proceedings of Workshop on Hot Topics in Networks (HotNets-II), Nov. 2003.
3. T. Anderson, T. Roscoe, and D. Wetherall. Preventing Internet denial-of-service with capabilities. In Proceedings of Workshop on Hot Topics in Networks (HotNets-II), Nov. 2003.
4. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology – EUROCRYPT’97, volume 1233 of Lecture Notes in Computer Science, pages 480–494, 1997.
5. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology – CRYPTO’96, volume 1109 of Lecture Notes in Computer Science, pages 1–15, 1996.
6. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology – ASIACRYPT’00, volume 1997 of Lecture Notes in Computer Science, pages 531–545, 2000.
7. M. Bellare and P. Rogaway. Collision-resistant hashing: Towards making UOWHFs practical. In Advances in Cryptology – CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 470–484, 1997.
8. J. Benaloh and M. de Mare. One way accumulators: A decentralized alternative to digital signatures. In Advances in Cryptology – EUROCRYPT’93, volume 765 of Lecture Notes in Computer Science, pages 274–285, 1993.
9. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology – CRYPTO’02, volume 2442 of Lecture Notes in Computer Science, pages 61–76, 2002.
10. V. Gligor. Guaranteeing access in spite of service-flooding attacks. In Proceedings of the Security Protocols Workshop, Apr. 2003.
11. P. Golle and N. Modadugu. Authenticating streamed data in the presence of random packet loss. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001), pages 13–22. Internet Society, Feb. 2001.
12. M. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In Proceedings of Information Security Conference (ISC 2002), volume 2433 of Lecture Notes in Computer Science, pages 372–388, 2002.
13. B. Kaliski and M. Robshaw. Message authentication with MD5. RSA Cryptobytes, 1(1):5–8, Spring 1995.
14. H. Krawczyk. Distributed fingerprints and secure informational dispersal. In Proceedings of 13th ACM Symposium on Principles of Distributed Computing, pages 207–218. ACM, 1993.
15. M. Luby. LT codes. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS’02), pages 271–282, 2002.
16. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC’97), pages 150–159, May 1997.
17. R. Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 122–134, Apr. 1980.
18. S. Miner and J. Staddon. Graph-based authentication of digital streams. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 232–246, May 2001.
19. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC’89), pages 33–43, May 1989.
20. K. Nyberg. Fast accumulated hashing. In Fast Software Encryption – Third International Workshop, volume 1039 of Lecture Notes in Computer Science, pages 83–87, 1996.
21. A. Pannetrat and R. Molva. Efficient multicast packet authentication. In Proceedings of the Symposium on Network and Distributed System Security Symposium (NDSS 2003). Internet Society, Feb. 2003.
22. J. M. Park, E. Chong, and H. J. Siegel. Efficient multicast packet authentication using erasure codes. ACM Transactions on Information and System Security (TIS-SEC), 6(2):258–285, May 2003.
23. J. M. Park, E. K. Chong, and H. J. Siegel. Efficient multicast packet authentication using signature amortization. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 227–240, May 2002.
24. A. Perrig. The BiBa one-time signature and broadcast authentication protocol. In Proceedings of the Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 28–37, Philadelphia PA, USA, Nov. 2001.
25. A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001), pages 35–46. Internet Society, Feb. 2001.
26. A. Perrig, R. Canetti, J. D. Tygar, and D. Song. Efficient authentication and signature of multicast streams over lossy channels. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 56–73, May 2000.
27. A. Perrig and J. D. Tygar. Secure Broadcast Communication in Wired and Wireless Networks. Kluwer Academic Publishers, 2002.
28. M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335–348, 1989.
29. I. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300–304, 1960.
30. L. Reyzin and N. Reyzin. Better than BiBa: Short onetime signatures with fast signing and verifying. In Seventh Australasian Conference on Information Security and Privacy (ACISP 2002), July 2002.
31. L. Rizzo. Effective erasure codes for reliable computer communication protocols. ACM Computer Communication Review, 27(2):24–36, Apr. 1997.
32. T. Sander. Efficient accumulators without trapdoor extended abstracts. In Information and Communication Security, Second International Conference – ICICS’99, volume 1726 of Lecture Notes in Computer Science, pages 252–262, 1999.
33. D. Song, D. Zuckerman, and J. D. Tygar. Expander graphs for digital stream authentication and robust overlay networks. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 258–270, May 2002.
34. H. Weatherspoon, C. Wells, P. R. Eaton, B. Y. Zhao, and J. D. Kubiatowicz. Silverback: A global-scale archival system. Technical Report UCB//CSD-01-1139, University of California at Berkeley, 2000.
35. C. Wong and S. Lam. Digital signatures for flows and multicasts. In Proceedings on the 6th International Conference on Network Protocols (ICNP ‘98), pages 198–209. IEEE, October 1998.