Towards Provably Secure On-Demand Distance Vector Routing in MANET
Liqiang Mao, Jianfeng Ma · 2008
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 correct system state in the model, and the flaw in the proof for ARAN. An attack to ARAN is presented, which shows that ARAN is not provably secure even in their model.