An identity based routing path verification scheme for wireless sensor networks. / Khan, Haibat.

In: International Journal of Sensor Networks, Vol. 26, No. 1, 2018, p. 54-68.

Research output: Contribution to journalArticle

Published

Standard

An identity based routing path verification scheme for wireless sensor networks. / Khan, Haibat.

In: International Journal of Sensor Networks, Vol. 26, No. 1, 2018, p. 54-68.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Khan, Haibat. / An identity based routing path verification scheme for wireless sensor networks. In: International Journal of Sensor Networks. 2018 ; Vol. 26, No. 1. pp. 54-68.

BibTeX

@article{0b60e486aa7d4dcf81363c2b135dcff1,
title = "An identity based routing path verification scheme for wireless sensor networks",
abstract = "While the ability to express routing policies in wireless sensor networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralised, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called routing path verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.",
keywords = "security protocols; routing security; , wireless sensor networks, routing policy control",
author = "Haibat Khan",
note = "Haibat Khan received his BE in Avionics Engineering from National University of Sciences and Technology (NUST) of Pakistan in 2005 and his ME in Computer Science and Technology (Major: Information Security) from University of Electronic Science and Technology of China (UESTC) in 2013. He is currently a PhD candidate at the Information Security Group of Royal Holloway, University of London. His research usually focuses on practical applications of cryptography.",
year = "2018",
doi = "10.1504/IJSNET.2018.088365",
language = "English",
volume = "26",
pages = "54--68",
journal = "International Journal of Sensor Networks",
issn = "1748-1279",
publisher = "Inderscience Enterprises Ltd.",
number = "1",

}

RIS

TY - JOUR

T1 - An identity based routing path verification scheme for wireless sensor networks

AU - Khan, Haibat

N1 - Haibat Khan received his BE in Avionics Engineering from National University of Sciences and Technology (NUST) of Pakistan in 2005 and his ME in Computer Science and Technology (Major: Information Security) from University of Electronic Science and Technology of China (UESTC) in 2013. He is currently a PhD candidate at the Information Security Group of Royal Holloway, University of London. His research usually focuses on practical applications of cryptography.

PY - 2018

Y1 - 2018

N2 - While the ability to express routing policies in wireless sensor networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralised, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called routing path verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.

AB - While the ability to express routing policies in wireless sensor networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralised, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called routing path verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.

KW - security protocols; routing security;

KW - wireless sensor networks

KW - routing policy control

UR - http://www.inderscience.com/info/ingeneral/forthcoming.php?jcode=ijsnet

U2 - 10.1504/IJSNET.2018.088365

DO - 10.1504/IJSNET.2018.088365

M3 - Article

VL - 26

SP - 54

EP - 68

JO - International Journal of Sensor Networks

JF - International Journal of Sensor Networks

SN - 1748-1279

IS - 1

ER -