Advertisement

Exploiting Multiple Paths in Multi-hop Co-operative Ad-Hoc Networks for Providing Security without Trusted Third Party

  • T. Dinesh Ram Kumar
  • Ashutosh BhatiaEmail author
  • R. C. Hansdah
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 926)

Abstract

Ensuring secure communication in large scale wireless networks is a challenging issue, especially when the nodes participating in the network itself cannot be trusted fully. This situation is very much pertinent in the case of multi-hop wireless cooperative networks, where the nodes co-operate with each other to support multi-hop communication in the network. In such networks, assuming the presence of a trusted third party to provide key exchange and authentication services in the network is not viable. Additionally, the classical Diffie-Hellman based key establishment mechanism as such cannot be used because of Man-In-The-Middle and impersonation attacks, as the nodes participating in a multi-hop path from source to destination cannot be trusted. In this paper, we investigate the use of the multi-paths and secret sharing in multi-hop cooperative adhoc networks to provide practical secure communication between the nodes in the network. We propose a couple of routing algorithms that give multiple-paths to send different segments of information required to be communicated securely, under various behavioral models of the participating nodes. The simulation results show that the majority of times, we are able to find the multiple paths in the network through which the different segments of a piece of information can be sent to achieve desirable security.

Keywords

Cooperative adhoc networks Secret sharing Diffie Hellmann key establishment Secure routing 

References

  1. 1.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979).  https://doi.org/10.1145/359168.359176MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: 2003 Symposium on Security and Privacy, pp. 197–213, May 2003Google Scholar
  3. 3.
    Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.K.: A key management scheme for wireless sensor networks using deployment knowledge. In: IEEE INFOCOM 2004, vol. 1, p. 597, March 2004Google Scholar
  4. 4.
    Du, W., Deng, J., Han, Y.S., Varshney, P.K., Katz, J., Khalili, A.: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. 8(2), 228–258 (2005).  https://doi.org/10.1145/1065545.1065548CrossRefGoogle Scholar
  5. 5.
    Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47. ACM (2002)Google Scholar
  6. 6.
    Ling, H., Znati, T.: End-to-end pairwise key establishment using multi-path in wireless sensor network. In: IEEE Global Telecommunications Conference on GLOBECOM 2005, vol. 3, p. 5, November 2005Google Scholar
  7. 7.
    Yin, L., Qiao-Yan, W., Zheng-Ping, J., Meng, S.: Secure pairwise key establishment for key predistribution in wireless sensor networks. In: 2012 International Conference on Computer Science and Service System (CSSS), pp. 822–825. IEEE (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • T. Dinesh Ram Kumar
    • 1
  • Ashutosh Bhatia
    • 1
    Email author
  • R. C. Hansdah
    • 2
  1. 1.Department of Computer Science and Information SystemsBirla Institute of Technology and SciencePilaniIndia
  2. 2.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations