Quantifying Source Location Privacy Routing Performance via Divergence and Information Loss
Open Access
- 26 October 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 17 (15566013) , 3890-3905
Abstract
Source location Privacy (SLP) is an important property for security critical applications deployed over a wireless sensor network. This property specifies that the location of the source of messages needs to be kept secret from an eavesdropping adversary that is able to move around the network. Most previous work on SLP has focused on developing protocols to enhance the SLP imparted to the network under various attacker models and other conditions. Other works have focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we introduce the notion of a routing matrix which captures when messages are first received. We then introduce a novel approach where an optimal SLP routing matrix is derived. In this approach, the attacker’s movement is modelled as a Markov chain where measures of conditional entropy and divergence are used to compare routing matrices and quantify if they provide high levels of SLP. We propose the notion of a properly competing paths that causes an attacker to divert when moving towards the source. This concept provides the basis for developing a perturbation model , similar to those used in privacy-preserving data mining. We formally prove that properly competing paths are both necessary and sufficient in ensuring the existence of an SLP-aware routing matrix and show their usage in developing an SLP-aware routing matrix. Further, we show how different SLP-aware routing matrices 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
Funding Information
- Engineering and Physical Sciences Research Council (EPSRC) through Doctoral Training Grant (EP/M506679/1)
- Security Lancaster
This publication has 34 references indexed in Scilit:
- Achieving Source Location Privacy and Network Lifetime Maximization Through Tree-Based Diversionary Routing in Wireless Sensor NetworksIEEE Access, 2014
- Protecting source–location privacy based on multirings in wireless sensor networksConcurrency and Computation: Practice and Experience, 2013
- Towards statistically strong source anonymity for sensor networksACM Transactions on Sensor Networks, 2013
- Location privacy and anonymity preserving routing for wireless sensor networksComputer Networks, 2008
- A Survey of Quantification of Privacy Preserving Data Mining Algorithms2008
- Analysis of Location Privacy/Energy Efficiency Tradeoffs in Wireless Sensor NetworksLecture Notes in Computer Science, 2007
- Calibrating Noise to Sensitivity in Private Data Analysis2006
- A Framework for Evaluating Privacy Preserving Data Mining Algorithms*Data Mining and Knowledge Discovery, 2005
- Divergence measures based on the Shannon entropyIEEE Transactions on Information Theory, 1991
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951