AARP:An Applicable Authenticated Routing Protocol
Wang Yu-min · 2008
ARAN has some disadvantages of poor routing performance and high computing complexity,and also lacks session key negotiation.To resolve these problems,this paper presents an Applicable Authenticated Routing Protocol,abbreviated as AARP.Avoiding public key encryption,AARP simplifies the procedure of routing searching and reduces the computing complexity.Exploiting signature scheme,AARP successfully defeats many different types of identified attacks.Adopting Diffie-Hellman algorithm,it implements the session key negotiation.Then,with Canetti-Krawczyk model,this paper analyzes its security at detail.The results show that AARP is SK-secure in UM if DDH hypothesis is made and signature algorithm is secure against chosen message attack.The AARP protocol also possesses the security attributes of PFS and KKS etc.Compared to ARAN,AARP is simpler and more applicable,especially suitable for Ad hoc networks with nodes of limited CPU processing capability.