This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
November 2006 (vol. 5 no. 11)
pp. 1533-1546
Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model.

[1] G. Ács, L. Buttyán, and I. Vajda, “Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks,” Proc. European Workshop Security and Privacy in Ad Hoc and Sensor Networks (ESAS), July 2005.
[2] M. Bellare, R. Canetti, and H. Krawczyk, “A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols,” Proc. ACM Symp. Theory of Computing, 1998.
[3] D. Boneh, C. Gentry, H. Shacham, and B. Lynn, “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps,” Advances in Cryptology—Proc. Eurocrypt '03, 2003.
[4] M. Burrows, M. Abadi, and R. Needham, “A Logic of Authentication,” ACM Trans. Computer Systems, vol. 8, no. 1, pp. 18-36, Feb. 1990.
[5] M. Burrows, M. Abadi, and R. Needham, “Rejoinder to Nessett,” ACM Operating Systems Rev., vol. 24, no. 2, pp. 39-40, Apr. 1990.
[6] L. Buttyán and I. Vajda, “Towards Provable Security for Ad Hoc Routing Protocols,” Proc. ACM Workshop Security in Ad Hoc and Sensor Networks (SASN), Oct. 2004.
[7] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol (OLSR),” Internet Request for Comments 3626, Oct. 2003.
[8] J.R. Douceur, “The Sybil Attack,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[9] J. Guttman, “Security Goals: Packet Trajectories and Strand Spaces,” Foundations of Security Analysis and Design, R. Focardi and R. Gorrieri, eds. Springer, 2000.
[10] Y.-C. Hu, A. Perrig, and D. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM Conf. Mobile Computing and Networking (MobiCom), 2002.
[11] Y.-C. Hu, A. Perrig, and D. Johnson, “Efficient Security Mechanisms for Routing Protocols,” Proc. Network and Distributed System Security Symp. (NDSS), Feb. 2003.
[12] Y.-C. Hu, A. Perrig, and D. Johnson, “Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks,” Proc. INFOCOM Conf., Apr. 2003.
[13] Y.-C. Hu and A. Perrig, “A Survey of Secure Wireless Ad Hoc Routing,” IEEE Security and Privacy Magazine, vol. 2, no. 3, pp. 28-39, May/June 2004.
[14] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H.Korth, eds., chapter 5, pp. 153-181. Kluwer Academic, 1996.
[15] H. Krawczyk, M. Bellare, and R. Canetti, “HMAC: Keyed Hashing for Message Authentication,” IETF RFC 2104, Feb. 1997.
[16] W. Mao, Modern Cryptography: Theory and Practice. Prentice Hall PTR, 2004.
[17] J. Marshall, “An Analysis of the Secure Routing Protocol for Mobile Ad Hoc Network Route Discovery: Using Intuitive Reasoning and Formal Verification to Identify Flaws,” MSc thesis, Dept. of Computer Science, Florida State Univ., Apr. 2003.
[18] P. Papadimitratos and Z. Haas, “Secure Routing for Mobile AdHoc Networks,” Proc. SCS Comm. Networks and Distributed Systems Modelling Simulation Conf. (CNDS), 2002.
[19] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications (WMCSA), Feb. 1999.
[20] A. Perrig, R. Canetti, J.D. Tygar, and D. Song, “Efficient Authentication and Signing of Multicast Streams over Lossy Channels,” Proc. IEEE Symp. Security and Privacy, May 2000.
[21] B. Pfitzmann and M. Waidner, “A Model for Asynchronous Reactive Systems and Its Application to Secure Message Transmission,“ Proc. IEEE Symp. Security and Privacy, May 2001.
[22] V. Shoup, “On Formal Models for Secure Key Exchange,” version4, revision of IBM Research Report RZ 3120, Nov. 1999.
[23] S. Yang and J. Baras, “Modeling Vulnerabilities of Ad Hoc Routing Protocols,” Proc. ACM Workshop Security of Ad Hoc and Sensor Networks, Oct. 2003.

Index Terms:
Mobile ad hoc networks, secure routing, provable security.
Citation:
Gergely ?cs, Levente Butty?, Istv? Vajda, "Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 11, pp. 1533-1546, Nov. 2006, doi:10.1109/TMC.2006.170
Usage of this product signifies your acceptance of the Terms of Use.