Highly secure and efficient routing

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2004, Pages 197-208

  Avramopoulos, Ioannis ^a   Kobayashi, Hisashi ^a   Wang, Randolph ^a   Krishnamurthy, Arvind ^b  

^a Princeton University   (United States)

^b Yale University   (United States)

Author keywords

Graph theory; Networking; Routing; Security; System design

Indexed keywords

FAULT DETECTION; MESSAGE AUTHENTICATION CODES; NETWORK LAYERS; ROUTING PROTOCOL;

ALGORITHMS; FAILURE ANALYSIS; GRAPH THEORY; NETWORK PROTOCOLS; ROUTERS; SECURITY OF DATA; SYSTEMS ANALYSIS; TOPOLOGY;

INTERNET;

EID: 8344236729     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. P. Papadimitratos and Z. Haas, "Securing the internet routing infrastructure," IEEE Communications Magazine, pp. 60-68, Oct. 2002.
2. Kenneth A. Oye, Ed., Cooperation Under Anarchy, Princeton University Press, 1986.
3. R. Perlman, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, Massachusetts Institute of Technology, Aug. 1988.
4. A. Herzberg and S. Kutten, "Early detection of message forwarding faults," SIAM J. Comput., vol. 30, no. 4, pp. 1169-1196, 2000.
5. K. Bradley et al, "Detecting disruptive routers: A distributed network monitoring approach," IEEE Network Magazine. Sept./Oct. 1998.
6. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, "An on-demand secure routing protocol resilient to byzantine failures," in Proc. 2002 ACM Workshop on Wireless Security, Atlanta, GA, Sept. 2002.
7. R. Hauser, T. Przygienda, and G. Tsudik, "Lowering security overhead in link state routing," Computer Networks, vol. 31, no. 8. pp. 885-894, Apr. 1999.
8. P. Papadimitratos and Z. Haas, "Secure routing for mobile ad hoc networks," in Proc. Communication Networks and Distributed Systems Modeling and Simulation Conference, San Antonio, TX, Jan. 2002.
9. S. Murphy and M. Badger, "Digital signature protection of the ospf routing protocol," in Proc. Symposium on Network and Distributed System Security, NDSS '96, San Diego, CA, 1996.
10. Y. Hu, A. Perrig, and D. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks," in Proc. 8th Annual International Conference on Mobile Computing and Networking, Atlanta, GA, Sept. 2002.
11. B. Smith, S. Murthy, and J. Garcia-Luna-Aceves, "Securing distance-vector routing protocols," in Proc. Symposium on Network and Distributed System Security, NDSS '97, San Diego, CA, 1997.
12. B. Smith and J. Garcia-Luna-Aceves, "Securing the border gateway routing protocol," in Proc. Global Internet '96, London, UK, Nov. 1996.
13. R. Canetti et al., "Multicast security: A taxonomy and some efficient constructions," in Proc. IEEE Infocom 1999, New York, NY, Mar. 1999.
14. A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Proc. Network and Distributed System Security Symposium. NDSS '01, San Diego, CA, 2001.
15. http://www.cs.ucdavis.edu/~rogaway/umac/.
16. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, MIT Press, 1990.
17. R. Guerin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Transactions on Networking, vol. 10, no. 5, Oct. 2002.
18. H. Gabow, S. Maheshwari, and L. Osterweil, "On two problems in the generation of program test paths," IEEE Trans. Software Engineering, vol. 2, no. 3, Sept. 1976.
19. P. Crescenzi and V. Kann, A Compendium of NP Optimization Problems, http://www.nada.kth.se/~viggo/problemlist/compendium.html.
20. V. Kann, "Polynomially bounded minimization problems that are hard to approximate," Nordic J. Comp., vol. 1, pp. 317-331, 1994.
21. P. Berman and G. Schitger, "On the complexity of approximating the independent set problem," Inform. and Comput. 96, pp. 77-94, 1992.
22. D. Estrin, M. Steenstrup, and G. Tsudik, "A protocol for route establishment and packet forwarding across multidomain internets," IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 56-70, Feb. 1993.
23. D. Estrin, Y. Rekhter, and S. Hotz, "Scalable inter-domain routing architecture," in Proc. ACM SIGCOMM, Baltimore, MD, Aug. 1992.