DocumentCode
480573
Title
Towards Provably Secure On-Demand Distance Vector Routing in MANET
Author
Mao, Liqiang ; Ma, Jianfeng
Author_Institution
Sch. of Comput. Sci. & Technol., Xidian Univ., Xian, China
Volume
1
fYear
2008
fDate
13-17 Dec. 2008
Firstpage
417
Lastpage
420
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 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.
Keywords
ad hoc networks; mobile radio; routing protocols; security of data; ARAN; MANET; mobile ad hoc networks; on-demand distance vector routing protocols; security analysis; Analytical models; Computational intelligence; Computational modeling; Computer science; Computer security; Computer simulation; Cost function; Cryptographic protocols; Mobile ad hoc networks; Routing protocols; formal analysis; provable security; routing protocol; simulation paradigm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security, 2008. CIS '08. International Conference on
Conference_Location
Suzhou
Print_ISBN
978-0-7695-3508-1
Type
conf
DOI
10.1109/CIS.2008.61
Filename
4724685
Link To Document