Leap-frog packet linking and diverse key distributions for improved integrity in network broadcasts

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2005, Pages 196-207

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASHED MESSAGE AUTHENTICATION CODES (HMAC); NETWORK BROADCASTING; OVERLAY NETWORKS;

ALGORITHMS; BROADCASTING; PACKET NETWORKS; TELECOMMUNICATION NETWORKS;

SECURITY OF DATA;

EID: 27544485427     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2005.11     Document Type: Conference Paper

References (35)

1. R. Blom. An optimal class of symmetric key generation systems. In Advances in Cryptography: EUROCRYPT, volume 209 of Lecture Notes in Computer Science, pages 335-338, 1985.
2. K. A. Bradley, S. Cheung, N. Puketza, B. Mukherjee, and R. A. Olsson. Detecting disruptive routers: A distributed network monitoring approach. In IEEE Symposium on Security and Privacy, pages 115-124, 1998.
3. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In Proc. of the IEEE Security and Privacy Symposim, pages 197-213, 2003.
4. S. Cheung. An efficient message authentication scheme for link state routing. In 13th Annual Computer Security Applications Conference, pages 90-98, 1997.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
6. W. Dai. Speed benchmarks for various ciphers and hash functions. http://www.eskimo.com/~weidai/benchmarks.html.
7. W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A pairwise key pre-distribution scheme for wireless sensor networks. In 10th ACM Conf. on Computer and Communication Security (CCS), pages 42-51, 2003.
8. L. Eschenauer and V. Gligor. A key management scheme for distributed sensor networks. In 9th ACM Conf. on Computer and Communication Security (CCS), pages 41-47, 2002.
9. J. A. Garay, J. Staddon, and A. Wool. Long-lived broadcast encryption. In Advances in Cryptology - CRYPTO 2000, LNCS, pages 333-352. Springer-Verlag, 2000.
10. M. T. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, New York, NY, 2002.
11. M. Guerrero-Zapata and N. Asokan. Securing ad hoc routing protocols. In ACM Workshop on Wireless Security, pages 1-10, 2002.
12. R. C. Hauser, T. Przygienda, and G. Tsudik. Lowering security overhead in link state routing. Computer Networks, 31(8):885-894, 1999.
13. Y.-C. Hu, A. Perrig, and D. B. Johnson. Efficient security mechanisms for routing protocols. In Network and Distributed System Security Symposium (NDSS), pages 57-73, 2003.
14. J. Hwang and Y. Kim. Revisiting random key predistribution schemes for wireless sensor networks. In 2nd ACM Workshop on Security in Ad Hoc and Sensor Networks, pages 43-52, 2004.
15. C. Kaufman, R. Perlman, and M. Speciner. Network Security: Private Communication in a Public World. Prentice-Hall, Englewood Cliffs, NJ, 1995.
16. S. Kent, C. Lynn, J. Mikkelson, and K. Seo. Secure boarder gateway protocol (S-BGP) - real world performance and deployment issues. In Symposium on Network and Distributed Systems Security (NDSS '00), pages 103-116, 2000.
17. J. Konh, P. Zerfos, H. Luo, S. Lu, and L. Zhang. Providing robust and ubiquitous security support for mobil ad-hoc networks. In 9th IEEE Int. Conf. on Network Protocols (ICNP), pages 251-260, 2001.
18. D. Liu and P. Ning. Establishing pairwise keys in distributed sensor networks. In 10th ACM Conf. on Computer and Communication Security (CCS), pages 52-61, 2003.
19. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
20. S. Murphy, M. Badger, and B. Wellington. RFC 2154: OSPF with digital signatures, June 1997. Status: EXPERIMENTAL.
21. S. Murphy, O. Gudmundsson, R. Mundy, and B. Wellington. Retrofitting security into internet infrastructure protocols. In DARPA Information Survivability Conference and Exposition (DISCEX), pages 3-17. IEEE Computer Society Press, 2000.
22. S. L. Murphy and M. R. Badger. Digital signature protection of OSPF routing protocol. In 1996 Internet Society Symp. on Network and Distributed System Security (NDSS), pages 93-102, 1996.
23. P. Papadimitratos and Z. J. Haas. Secure link state routing for mobile ad hoc networks. In Symp. on Applications and the Internet Workshops, page 379, 2003.
24. R. Perlman. Network Layer Protocol with Byzantine Agreement. PhD thesis, The MIT Press, Oct. 1988. LCS TR-429.
25. R. Perlman. Interconnections, Second Edition: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley, Reading, MA, USA, 2000.
26. R. L. Rivest. Mit 6.857 computer and network security class notes, http://theory.lcs.mit.edu/~rivest/notes/notes.pdf.
27. K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. M. Belding-Royer. A secure routing protocol for ad hoc networks. In 10th IEEE Int. Conf. on Network Protocols (ICNP), pages 78-89, 2002.
28. B. Schneier. Applied Cryptography: protocols, algorithms, and source code in C. John Wiley and Sons, Inc., New York, 1994.
29. B. R. Smith, S. Murthy, and J. Garcia-Luna-Aceves. Securing distance-vector routing protocols. In Symposium on Network and Distributed Systems Security (NDSS '97), 1997.
30. D. R. Stinson, T. van Trung, and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference, 86:595-617, 2000.
31. B. Vetter, F.-Y. Wang, and S. F. Wu. An experimental study of insider attacks for the OSPF routing protocol. In 5th IEEE International Conference on Network Protocols, 1997.
32. S. F. Wu, F.-Y. Wang, Y. F. Jou, and F. Gong. Intrusion detection for link-state routing protocols. In IEEE Symposium on Security and Privacy, 1997.
33. K. Zhang. Efficient protocols for signing routing messages. In Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, California, 1998. Internet Society.
34. S. Zhu, S. Xu, S. Setia, and S. Jajodia. Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach. In 11th IEEE International Conference on Network Protocols (ICNP), pages 326-335, 2003.
35. S. Zhu, S. Xu, S. Setia, and S. Jajodia. LHAP: A lightweight hop-by-hop authentication protocol of ad-hoc networks. In 23rd International Conference on Distributed Computing Systems, page 749, 2003.