J4

• Original Articles • Previous Articles     Next Articles

Analysis of provably secure on-demand distance vector routing in MANET

MAO Li-qiang1;MA Jian-feng1,2
  

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi’an 710071, China;
    2. Ministry of Education Key Lab. of Computer Network and Information Security, Xidian Univ., Xi’an 710071, China)
  • Received:2008-06-16 Revised:1900-01-01 Online:2008-12-20 Published:2008-12-20
  • Contact: MAO Li-qiang E-mail:lqmao@xidian.edu.cn

Abstract: Based on the simulation paradigm, Acs et al proposed a formal model tailored to the security analysis of on-demand distance vector routing protocols in MANET, and a routing protocol, called ARAN, was proven secure in the model. We indicate the improper manipulations such as mergence of the adjacent adversarial nodes, the improper definition of the correct system state in the model, and the flaw in the proof for ARAN. A new attack to ARAN is presented, which shows that ARAN is not provably secure even in their model.

Key words: routing protocol, provable security, formal analysis, simulation paradigm

CLC Number: 

  • TP393.04