KIPDA

K-indistinguishable privacy-preserving data aggregation in wireless sensor networks

Michael M. Groat, Wenbo Hey, Stephanie Forrest

Research output: Chapter in Book/Report/Conference proceedingConference contribution

99 Citations (Scopus)

Abstract

When wireless sensor networks accumulate sensitive or confidential data, privacy becomes an important concern. Sensors are often resource-limited and power-constrained, and data aggregation is commonly used to address these issues. However, providing privacy without disrupting in-network data aggregation is challenging. Although privacy-preserving data aggregation for additive and multiplicative aggregation functions has been studied, nonlinear aggregation functions such as maximum and minimum have not been well addressed. We present KIPDA, a privacy-preserving aggregation method, which we specialize for maximum and minimum aggregation functions. KIPDA obfuscates sensitive measurements by hiding them among a set of camouflage values, enabling k-indistinguishability for data aggregation. In principle, KIPDA can be used to hide a wide range of aggregation functions, although this paper considers only maximum and minimum. Because the sensitive data are not encrypted, it is easily and efficiently aggregated with minimal in-network processing delay. We quantify the efficiency of KIPDA in terms of power consumption and time delay, studying tradeoffs between the protocol's effectiveness and its resilience against collusion.

Original languageEnglish (US)
Title of host publication2011 Proceedings IEEE INFOCOM
Pages2024-2032
Number of pages9
DOIs
StatePublished - Aug 2 2011
Externally publishedYes
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: Apr 10 2011Apr 15 2011

Other

OtherIEEE INFOCOM 2011
CountryChina
CityShanghai
Period4/10/114/15/11

Fingerprint

Data privacy
Wireless sensor networks
Agglomeration
Camouflage
Time delay
Electric power utilization
Network protocols
Sensors

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

KIPDA : K-indistinguishable privacy-preserving data aggregation in wireless sensor networks. / Groat, Michael M.; Hey, Wenbo; Forrest, Stephanie.

2011 Proceedings IEEE INFOCOM. 2011. p. 2024-2032 5935010.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Groat, MM, Hey, W & Forrest, S 2011, KIPDA: K-indistinguishable privacy-preserving data aggregation in wireless sensor networks. in 2011 Proceedings IEEE INFOCOM., 5935010, pp. 2024-2032, IEEE INFOCOM 2011, Shanghai, China, 4/10/11. https://doi.org/10.1109/INFCOM.2011.5935010
Groat, Michael M. ; Hey, Wenbo ; Forrest, Stephanie. / KIPDA : K-indistinguishable privacy-preserving data aggregation in wireless sensor networks. 2011 Proceedings IEEE INFOCOM. 2011. pp. 2024-2032
@inproceedings{c9038b7d7c1745fbb033e3a892124f7c,
title = "KIPDA: K-indistinguishable privacy-preserving data aggregation in wireless sensor networks",
abstract = "When wireless sensor networks accumulate sensitive or confidential data, privacy becomes an important concern. Sensors are often resource-limited and power-constrained, and data aggregation is commonly used to address these issues. However, providing privacy without disrupting in-network data aggregation is challenging. Although privacy-preserving data aggregation for additive and multiplicative aggregation functions has been studied, nonlinear aggregation functions such as maximum and minimum have not been well addressed. We present KIPDA, a privacy-preserving aggregation method, which we specialize for maximum and minimum aggregation functions. KIPDA obfuscates sensitive measurements by hiding them among a set of camouflage values, enabling k-indistinguishability for data aggregation. In principle, KIPDA can be used to hide a wide range of aggregation functions, although this paper considers only maximum and minimum. Because the sensitive data are not encrypted, it is easily and efficiently aggregated with minimal in-network processing delay. We quantify the efficiency of KIPDA in terms of power consumption and time delay, studying tradeoffs between the protocol's effectiveness and its resilience against collusion.",
author = "Groat, {Michael M.} and Wenbo Hey and Stephanie Forrest",
year = "2011",
month = "8",
day = "2",
doi = "10.1109/INFCOM.2011.5935010",
language = "English (US)",
isbn = "9781424499212",
pages = "2024--2032",
booktitle = "2011 Proceedings IEEE INFOCOM",

}

TY - GEN

T1 - KIPDA

T2 - K-indistinguishable privacy-preserving data aggregation in wireless sensor networks

AU - Groat, Michael M.

AU - Hey, Wenbo

AU - Forrest, Stephanie

PY - 2011/8/2

Y1 - 2011/8/2

N2 - When wireless sensor networks accumulate sensitive or confidential data, privacy becomes an important concern. Sensors are often resource-limited and power-constrained, and data aggregation is commonly used to address these issues. However, providing privacy without disrupting in-network data aggregation is challenging. Although privacy-preserving data aggregation for additive and multiplicative aggregation functions has been studied, nonlinear aggregation functions such as maximum and minimum have not been well addressed. We present KIPDA, a privacy-preserving aggregation method, which we specialize for maximum and minimum aggregation functions. KIPDA obfuscates sensitive measurements by hiding them among a set of camouflage values, enabling k-indistinguishability for data aggregation. In principle, KIPDA can be used to hide a wide range of aggregation functions, although this paper considers only maximum and minimum. Because the sensitive data are not encrypted, it is easily and efficiently aggregated with minimal in-network processing delay. We quantify the efficiency of KIPDA in terms of power consumption and time delay, studying tradeoffs between the protocol's effectiveness and its resilience against collusion.

AB - When wireless sensor networks accumulate sensitive or confidential data, privacy becomes an important concern. Sensors are often resource-limited and power-constrained, and data aggregation is commonly used to address these issues. However, providing privacy without disrupting in-network data aggregation is challenging. Although privacy-preserving data aggregation for additive and multiplicative aggregation functions has been studied, nonlinear aggregation functions such as maximum and minimum have not been well addressed. We present KIPDA, a privacy-preserving aggregation method, which we specialize for maximum and minimum aggregation functions. KIPDA obfuscates sensitive measurements by hiding them among a set of camouflage values, enabling k-indistinguishability for data aggregation. In principle, KIPDA can be used to hide a wide range of aggregation functions, although this paper considers only maximum and minimum. Because the sensitive data are not encrypted, it is easily and efficiently aggregated with minimal in-network processing delay. We quantify the efficiency of KIPDA in terms of power consumption and time delay, studying tradeoffs between the protocol's effectiveness and its resilience against collusion.

UR - http://www.scopus.com/inward/record.url?scp=79960854358&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960854358&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2011.5935010

DO - 10.1109/INFCOM.2011.5935010

M3 - Conference contribution

SN - 9781424499212

SP - 2024

EP - 2032

BT - 2011 Proceedings IEEE INFOCOM

ER -