Home > Research > Publications & Outputs > Understanding Source Location Privacy Protocols...

Links

Text available via DOI:

View graph of relations

Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series. / Bradbury, Matthew; Jhumka, Arshad.
IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE, 2017. p. 1611-1619.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Bradbury, M & Jhumka, A 2017, Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series. in IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE, pp. 1611-1619. https://doi.org/10.1109/INFOCOM.2017.8057122

APA

Bradbury, M., & Jhumka, A. (2017). Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series. In IEEE INFOCOM 2017 - IEEE Conference on Computer Communications (pp. 1611-1619). IEEE. https://doi.org/10.1109/INFOCOM.2017.8057122

Vancouver

Bradbury M, Jhumka A. Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series. In IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE. 2017. p. 1611-1619 Epub 2017 May 4. doi: 10.1109/INFOCOM.2017.8057122

Author

Bradbury, Matthew ; Jhumka, Arshad. / Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series. IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE, 2017. pp. 1611-1619

Bibtex

@inproceedings{b43265c5bbfc44e69f4c1d4f3d57f2b6,
title = "Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series",
abstract = "Source location privacy (SLP) is becoming an important property for a large class of security-critical wireless sensor network applications such as monitoring and tracking. Much of the previous work on SLP has focused on the development of various protocols to enhance the level of SLP imparted to the network, under various attacker models and other conditions. Other work has focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we adopt a different approach where we model the attacker movement as a time series and use information theoretic concepts to infer the properties of a routing protocol that imparts high levels of SLP. We propose the notion of a properly competing path that causes an attacker to “stall” when moving towards the source. This concept provides the basis for developing a perturbation model, similar to those in privacy-preserving data mining. We then show how to use properly competing paths to develop properties of an SLP-aware routing protocol. Further, we show how different SLP-aware routing protocols can be obtained through different instantiations of the framework. Those instantiations are obtained based on a notion of information loss achieved through the use of the perturbation model proposed.",
keywords = "Phantoms, Privacy, Routing, Routing protocols, Time series analysis, Wireless sensor networks, Entropy, Mutual Information, Source Location Privacy, Time Series, Wireless Sensor Networks",
author = "Matthew Bradbury and Arshad Jhumka",
year = "2017",
month = oct,
day = "5",
doi = "10.1109/INFOCOM.2017.8057122",
language = "English",
isbn = "9781509053377",
pages = "1611--1619",
booktitle = "IEEE INFOCOM 2017 - IEEE Conference on Computer Communications",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Understanding Source Location Privacy Protocols in Sensor Networks via Perturbation of Time Series

AU - Bradbury, Matthew

AU - Jhumka, Arshad

PY - 2017/10/5

Y1 - 2017/10/5

N2 - Source location privacy (SLP) is becoming an important property for a large class of security-critical wireless sensor network applications such as monitoring and tracking. Much of the previous work on SLP has focused on the development of various protocols to enhance the level of SLP imparted to the network, under various attacker models and other conditions. Other work has focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we adopt a different approach where we model the attacker movement as a time series and use information theoretic concepts to infer the properties of a routing protocol that imparts high levels of SLP. We propose the notion of a properly competing path that causes an attacker to “stall” when moving towards the source. This concept provides the basis for developing a perturbation model, similar to those in privacy-preserving data mining. We then show how to use properly competing paths to develop properties of an SLP-aware routing protocol. Further, we show how different SLP-aware routing protocols can be obtained through different instantiations of the framework. Those instantiations are obtained based on a notion of information loss achieved through the use of the perturbation model proposed.

AB - Source location privacy (SLP) is becoming an important property for a large class of security-critical wireless sensor network applications such as monitoring and tracking. Much of the previous work on SLP has focused on the development of various protocols to enhance the level of SLP imparted to the network, under various attacker models and other conditions. Other work has focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we adopt a different approach where we model the attacker movement as a time series and use information theoretic concepts to infer the properties of a routing protocol that imparts high levels of SLP. We propose the notion of a properly competing path that causes an attacker to “stall” when moving towards the source. This concept provides the basis for developing a perturbation model, similar to those in privacy-preserving data mining. We then show how to use properly competing paths to develop properties of an SLP-aware routing protocol. Further, we show how different SLP-aware routing protocols can be obtained through different instantiations of the framework. Those instantiations are obtained based on a notion of information loss achieved through the use of the perturbation model proposed.

KW - Phantoms

KW - Privacy

KW - Routing

KW - Routing protocols

KW - Time series analysis

KW - Wireless sensor networks

KW - Entropy

KW - Mutual Information

KW - Source Location Privacy

KW - Time Series

KW - Wireless Sensor Networks

U2 - 10.1109/INFOCOM.2017.8057122

DO - 10.1109/INFOCOM.2017.8057122

M3 - Conference contribution/Paper

SN - 9781509053377

SP - 1611

EP - 1619

BT - IEEE INFOCOM 2017 - IEEE Conference on Computer Communications

PB - IEEE

ER -