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 Su
AU - Nyang, Daehun
N1 - Funding Information:
This work was supported by the IT R&D program of MIC/IITA. [2005-Y-001-04, Development of next generation security technology].
PY - 2008
Y1 - 2008
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
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
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 338
EP - 351
BT - Ubiquitous Intelligence and Computing - 5th International Conference, UIC 2008, Proceedings
T2 - 5th International Conference on Ubiquitous Intelligence and Computing, UIC 2008
Y2 - 23 June 2008 through 25 June 2008
ER -