Data randomization for lightweight secure data aggregation in sensor network

Abedelaziz Mohaisen, ik rae Jeong, Dowon Hong, Nam S. Jho, Daehun Nyang

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

Abstract

Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages338-351
Number of pages14
Volume5061 LNCS
DOIs
Publication statusPublished - 2008 Aug 4
Event5th International Conference on Ubiquitous Intelligence and Computing, UIC 2008 - Oslo, Norway
Duration: 2008 Jun 232008 Jun 25

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5061 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Ubiquitous Intelligence and Computing, UIC 2008
CountryNorway
CityOslo
Period08/6/2308/6/25

Fingerprint

Data Aggregation
Random Allocation
Randomisation
Sensor networks
Sensor Networks
Agglomeration
Key Management
Vertex of a graph
Efficient Implementation
Efficient Solution
Aggregation
Estimate

Keywords

  • Computation efficiency
  • Data aggregation
  • Data randomization
  • Experimental justification
  • Security
  • Sensor network

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Mohaisen, A., Jeong, I. R., Hong, D., Jho, N. S., & Nyang, D. (2008). Data randomization for lightweight secure data aggregation in sensor network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5061 LNCS, pp. 338-351). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5061 LNCS). https://doi.org/10.1007/978-3-540-69293-5_27

Data randomization for lightweight secure data aggregation in sensor network. / Mohaisen, Abedelaziz; Jeong, ik rae; Hong, Dowon; Jho, Nam S.; Nyang, Daehun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5061 LNCS 2008. p. 338-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5061 LNCS).

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

Mohaisen, A, Jeong, IR, Hong, D, Jho, NS & Nyang, D 2008, Data randomization for lightweight secure data aggregation in sensor network. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5061 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5061 LNCS, pp. 338-351, 5th International Conference on Ubiquitous Intelligence and Computing, UIC 2008, Oslo, Norway, 08/6/23. https://doi.org/10.1007/978-3-540-69293-5_27
Mohaisen A, Jeong IR, Hong D, Jho NS, Nyang D. Data randomization for lightweight secure data aggregation in sensor network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5061 LNCS. 2008. p. 338-351. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-69293-5_27
Mohaisen, Abedelaziz ; Jeong, ik rae ; Hong, Dowon ; Jho, Nam S. ; Nyang, Daehun. / Data randomization for lightweight secure data aggregation in sensor network. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5061 LNCS 2008. pp. 338-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c5aa9b526288407787fca33479372730,
title = "Data randomization for lightweight secure data aggregation in sensor network",
abstract = "Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.",
keywords = "Computation efficiency, Data aggregation, Data randomization, Experimental justification, Security, Sensor network",
author = "Abedelaziz Mohaisen and Jeong, {ik rae} and Dowon Hong and Jho, {Nam S.} and Daehun Nyang",
year = "2008",
month = "8",
day = "4",
doi = "10.1007/978-3-540-69293-5_27",
language = "English",
isbn = "3540692924",
volume = "5061 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "338--351",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Data randomization for lightweight secure data aggregation in sensor network

AU - Mohaisen, Abedelaziz

AU - Jeong, ik rae

AU - Hong, Dowon

AU - Jho, Nam S.

AU - Nyang, Daehun

PY - 2008/8/4

Y1 - 2008/8/4

N2 - Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.

AB - Data aggregation is one of the main purposes for which sensor networks are developed. However, to secure the data aggregation schemes, several security-related issues have raised including the need for efficient implementations of cryptographic algorithms, secure key management schemes' design and many others. Several works has been introduced in this direction and succeeded to some extent in providing relatively efficient solutions. Yet, one of the questions to be answered is that, can we still aggregate the sensed data with less security-related computation while maintaining a marginal level of security and accuracy? In this paper, we consider data randomization as a possible approach for data aggregation. Since the individual single sensed record is not of a big concern when using data for aggregation, we show how data randomization can explicitly hide the exact single data records to securely exchange them between nodes. To improve the security and accuracy of this approach, we introduce a hybrid scheme that uses the cryptographic approach for a fraction of nodes. We study the efficiency of our schemes in terms of the estimate accuracy and the overhead.

KW - Computation efficiency

KW - Data aggregation

KW - Data randomization

KW - Experimental justification

KW - Security

KW - Sensor network

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

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

U2 - 10.1007/978-3-540-69293-5_27

DO - 10.1007/978-3-540-69293-5_27

M3 - Conference contribution

AN - SCOPUS:48249157311

SN - 3540692924

SN - 9783540692928

VL - 5061 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 338

EP - 351

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -