Towards Provable Security of Dynamic Source Routing Protocol and Its Applications

  • Naoto YanaiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9975)


Routing control such as Internet routing is one of the most popular topics that dram many researchers’ attention in recent years. However, to the best of our knowledge, there are few works to deal with their provable security, where the security can be mathematically proven under some reasonable assumption. Although the provable security has been discussed in the area of cryptography, we consider that such analysis should also be done to conventional network systems in order to guarantee the security of their specifications. In this work, we aim to construct such a provable framework, and particularly discuss formalization of dynamic source routing (DSR) protocol which is a kernel protocol for sensor networks. Our formalization can be easily extended into secure routing protocols with cryptographic schemes such as digital signatures.


Routing security Formal method Provable security Dynamic source routing Ad hoc networks 



The author is supported by JSPS KAKENHI Grant Number 16K16065. We would like to appreciate their supports.


  1. 1.
    Ács, G.: Secure routing in multi-hop wireless networks, Ph.D. thesis. Budapest University of Technology and Economics (2009)Google Scholar
  2. 2.
    Arnaud, M., Cortier, V., Delaune, S.: Modeling and verifying ad hoc routing protocols. In: Proceedings of CSF 2010, pp. 59–74. IEEE (2010)Google Scholar
  3. 3.
    Arnaud, M., Cortier, V., Delaune, S.: Modeling and verifying ad hoc routing protocols. Inf. Comput. 238, 30–67 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Boldyreva, A., Lychev, R.: Provable security of S-BGP, other path vector protocols: model, analysis and extensions. In: Proceedings of ACM CCS 2012, pp. 541–552. ACM (2012)Google Scholar
  5. 5.
    Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001). doi: 10.1007/3-540-45682-1_30 CrossRefGoogle Scholar
  6. 6.
    Buttyán, L., Vajda, I.: Towards provable security for ad hoc routing protocols. In: Proceedings of SASN, pp. 94–105. ACM Press (2004)Google Scholar
  7. 7.
    Ghosh, U., Datta, R.: Identity based secure AODV and tcp for mobile ad hoc networks. In: Proceedings of ACWR 2011, pp. 339–346. ACM (2011)Google Scholar
  8. 8.
    Ghosh, U., Datta, R.: SDRP: Secure and dynamic routing protocol for mobile ad-hoc networks. IET Netw. 3(3), 235–243 (2013)CrossRefGoogle Scholar
  9. 9.
    Godskesen, J.C.: Formal verification of the ARAN protocol using the applied Pi-calculus. In: Proceeings of IFIP ITS, pp. 99–113 (2015)Google Scholar
  10. 10.
    Goldberg, S., Naor, M., Papadopoulos, D., Reyzin, L., Vasant, S., Ziv, A.: Nsec5: provably preventing DNSSEC zone enumeration. In: Proceedings of NDSS 2015. Internet Society (2015)Google Scholar
  11. 11.
    Guillemin, P.: ICTSB - RFID networks internet of things. In: ETSI 2007 (2007).
  12. 12.
    Hu, Y.-C., Perrig, A., Johnson, D.: Ariadne: a secure on demand routing protocol for ad hoc network. In: Proceedings of MobiCom 2002. ACM (2002)Google Scholar
  13. 13.
    Hu, Y.-C., Perrig, A., Johnson, D.: SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks. In: Proceedings of WMCSA 2002, pp. 3–13. ACM (2002)Google Scholar
  14. 14.
    Hu, Y.-C., Perrig, A., Johnson, D.: Ariadne: a secure on demand routing protocol for ad hoc network. Wirel. Netw. 11, 21–38 (2005)CrossRefGoogle Scholar
  15. 15.
    John, I., Marshall, D.: An analysis of the secure routing protocol for mobile ad hoc network route discovery: using intuitive reasoning and formal verification to identity flaws (2003)Google Scholar
  16. 16.
    Jonhson, D., Maltz, D.: Dynamic source routing in ad hoc wireless networks. Mobile Comput. 353, 153–181 (1996)CrossRefGoogle Scholar
  17. 17.
    Kim, J., Tsudik, G.: SRDP: secure route discovery for dynamic source routing in manets. Ad Hoc Netw. 7(6), 1097–1109 (2009)CrossRefGoogle Scholar
  18. 18.
    Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74–90. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24676-3_5 CrossRefGoogle Scholar
  19. 19.
    Muranaka, K., Yanai, N., Okamura, S., Fujiwara, T.: Secure routing protocols for sensor networks: construction with signature schemes for multiple signers. In: Proceedings of Trustcom 2015, pp. 1329–1336. IEEE (2015)Google Scholar
  20. 20.
    Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367, 203–227 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Papadimitratos, P., Haas, Z.J.: Secure routing for mobile ad hoc networks. In: Proceedings of CNDS, pp. 27–31 (2002)Google Scholar
  22. 22.
    Sanzgiri, K., LaFlamme, D., Dahill, B., Levine, B.N., Shields, C., Belding-Royer, E.M.: Authenticated routing for ad hoc networks. IEEE J. Sel. Areas Commun. 23(3), 598–610 (2005)CrossRefGoogle Scholar
  23. 23.
    Vajda, I.: A proof technique for security assessment of on-demand ad hoc routing protocol. Int. J. Secur. Netw. 9(1), 12–19 (2014)MathSciNetCrossRefGoogle Scholar
  24. 24.
    Zapata, M., Asokan, N.: Securing ad hoc routing protocols. In: Proceedings of WISE, pp. 1–10. ACM Press (2002)Google Scholar
  25. 25.
    Zhang, F., Jia, L., Basescu, C., Kim, T., Hu, Y., Perrig, A.: Mechanized network origin and path authenticity proofs. In: Proceedings of ACM CCS 2014, pp. 346–357. ACM (2014)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Osaka UniversityOsakaJapan
  2. 2.AISTTsukubaJapan

Personalised recommendations