A probabilistic encryption based min/max computation in wireless sensor networks

Bharath Kumar Samanthula, Wei Jiang, Sanjay Madria

Research output: Contribution to journalConference article

11 Citations (Scopus)

Abstract

Wireless sensor networks (WSNs) have wide range of applications in military, health-monitoring, smart-home applications, and in other commercial environments. The computation of data aggregation functions like MIN/MAX is one of the commonly used tasks in many such WSN applications. However, due to privacy issues in some of these applications, the individual sensor readings should be kept secret from others. That is, the base station should be the only entity who should receive the output of MIN/MAX function and the individual sensor readings should not be revealed either to other sensor nodes or to the root node for confidentiality reasons. Existing Secure Data Aggregation (SDA) techniques for computing MIN/MAX are based on either order preserving or privacy homomorphic encryption schemes which are either inefficient or insecure. Along this direction, this paper proposes two novel solutions for securely computing MIN/MAX functions in WSNs using probabilistic encryption scheme. The first solution works for WSNs with no duplicate sensor readings whereas the second solution acts as a generic method and works even for duplicate readings but is less efficient compared to the first method. However, the second solution is much more secure compared to the existing protocols. The security of the proposed protocols is justified based on the well known quadratic residuosity assumption. We empirically analyze the efficiency of our schemes and demonstrate the advantages of the proposed protocols over existing approaches.

Original languageEnglish
Article number6569124
Pages (from-to)77-86
Number of pages10
JournalProceedings - IEEE International Conference on Mobile Data Management
Volume1
DOIs
StatePublished - 11 Sep 2013
Event14th International Conference on Mobile Data Management, MDM 2013 - Milan, Italy
Duration: 3 Jun 20136 Jun 2013

Fingerprint

Cryptography
Wireless sensor networks
Network protocols
Sensors
Agglomeration
Sensor nodes
Base stations
Health
Monitoring

Keywords

  • Wireless sensor networks
  • secure data aggregation

Cite this

@article{66d0cf1ef3704d9f8592b939f2c8d196,
title = "A probabilistic encryption based min/max computation in wireless sensor networks",
abstract = "Wireless sensor networks (WSNs) have wide range of applications in military, health-monitoring, smart-home applications, and in other commercial environments. The computation of data aggregation functions like MIN/MAX is one of the commonly used tasks in many such WSN applications. However, due to privacy issues in some of these applications, the individual sensor readings should be kept secret from others. That is, the base station should be the only entity who should receive the output of MIN/MAX function and the individual sensor readings should not be revealed either to other sensor nodes or to the root node for confidentiality reasons. Existing Secure Data Aggregation (SDA) techniques for computing MIN/MAX are based on either order preserving or privacy homomorphic encryption schemes which are either inefficient or insecure. Along this direction, this paper proposes two novel solutions for securely computing MIN/MAX functions in WSNs using probabilistic encryption scheme. The first solution works for WSNs with no duplicate sensor readings whereas the second solution acts as a generic method and works even for duplicate readings but is less efficient compared to the first method. However, the second solution is much more secure compared to the existing protocols. The security of the proposed protocols is justified based on the well known quadratic residuosity assumption. We empirically analyze the efficiency of our schemes and demonstrate the advantages of the proposed protocols over existing approaches.",
keywords = "Wireless sensor networks, secure data aggregation",
author = "Samanthula, {Bharath Kumar} and Wei Jiang and Sanjay Madria",
year = "2013",
month = "9",
day = "11",
doi = "10.1109/MDM.2013.18",
language = "English",
volume = "1",
pages = "77--86",
journal = "Proceedings - IEEE International Conference on Mobile Data Management",
issn = "1551-6245",

}

A probabilistic encryption based min/max computation in wireless sensor networks. / Samanthula, Bharath Kumar; Jiang, Wei; Madria, Sanjay.

In: Proceedings - IEEE International Conference on Mobile Data Management, Vol. 1, 6569124, 11.09.2013, p. 77-86.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A probabilistic encryption based min/max computation in wireless sensor networks

AU - Samanthula, Bharath Kumar

AU - Jiang, Wei

AU - Madria, Sanjay

PY - 2013/9/11

Y1 - 2013/9/11

N2 - Wireless sensor networks (WSNs) have wide range of applications in military, health-monitoring, smart-home applications, and in other commercial environments. The computation of data aggregation functions like MIN/MAX is one of the commonly used tasks in many such WSN applications. However, due to privacy issues in some of these applications, the individual sensor readings should be kept secret from others. That is, the base station should be the only entity who should receive the output of MIN/MAX function and the individual sensor readings should not be revealed either to other sensor nodes or to the root node for confidentiality reasons. Existing Secure Data Aggregation (SDA) techniques for computing MIN/MAX are based on either order preserving or privacy homomorphic encryption schemes which are either inefficient or insecure. Along this direction, this paper proposes two novel solutions for securely computing MIN/MAX functions in WSNs using probabilistic encryption scheme. The first solution works for WSNs with no duplicate sensor readings whereas the second solution acts as a generic method and works even for duplicate readings but is less efficient compared to the first method. However, the second solution is much more secure compared to the existing protocols. The security of the proposed protocols is justified based on the well known quadratic residuosity assumption. We empirically analyze the efficiency of our schemes and demonstrate the advantages of the proposed protocols over existing approaches.

AB - Wireless sensor networks (WSNs) have wide range of applications in military, health-monitoring, smart-home applications, and in other commercial environments. The computation of data aggregation functions like MIN/MAX is one of the commonly used tasks in many such WSN applications. However, due to privacy issues in some of these applications, the individual sensor readings should be kept secret from others. That is, the base station should be the only entity who should receive the output of MIN/MAX function and the individual sensor readings should not be revealed either to other sensor nodes or to the root node for confidentiality reasons. Existing Secure Data Aggregation (SDA) techniques for computing MIN/MAX are based on either order preserving or privacy homomorphic encryption schemes which are either inefficient or insecure. Along this direction, this paper proposes two novel solutions for securely computing MIN/MAX functions in WSNs using probabilistic encryption scheme. The first solution works for WSNs with no duplicate sensor readings whereas the second solution acts as a generic method and works even for duplicate readings but is less efficient compared to the first method. However, the second solution is much more secure compared to the existing protocols. The security of the proposed protocols is justified based on the well known quadratic residuosity assumption. We empirically analyze the efficiency of our schemes and demonstrate the advantages of the proposed protocols over existing approaches.

KW - Wireless sensor networks

KW - secure data aggregation

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

U2 - 10.1109/MDM.2013.18

DO - 10.1109/MDM.2013.18

M3 - Conference article

AN - SCOPUS:84883529275

VL - 1

SP - 77

EP - 86

JO - Proceedings - IEEE International Conference on Mobile Data Management

JF - Proceedings - IEEE International Conference on Mobile Data Management

SN - 1551-6245

M1 - 6569124

ER -