RCDA: Recoverable Concealed Data Aggregation for Data Integrity in Wireless Sensor Networks

被引:76
作者
Chen, Chien-Ming [1 ]
Lin, Yue-Hsun [1 ]
Lin, Ya-Ching [1 ]
Sun, Hung-Min [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 30013, Taiwan
关键词
Concealed data aggregation; wireless sensor networks; privacy homomorphism encryption; COMPUTATION;
D O I
10.1109/TPDS.2011.219
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recently, several data aggregation schemes based on privacy homomorphism encryption have been proposed and investigated on wireless sensor networks. These data aggregation schemes provide better security compared with traditional aggregation since cluster heads (aggregator) can directly aggregate the ciphertexts without decryption; consequently, transmission overhead is reduced. However, the base station only retrieves the aggregated result, not individual data, which causes two problems. First, the usage of aggregation functions is constrained. For example, the base station cannot retrieve the maximum value of all sensing data if the aggregated result is the summation of sensing data. Second, the base station cannot confirm data integrity and authenticity via attaching message digests or signatures to each sensing sample. In this paper, we attempt to overcome the above two drawbacks. In our design, the base station can recover all sensing data even these data has been aggregated. This property is called "recoverable." Experiment results demonstrate that the transmission overhead is still reduced even if our approach is recoverable on sensing data. Furthermore, the design has been generalized and adopted on both homogeneous and heterogeneous wireless sensor networks.
引用
收藏
页码:727 / 734
页数:8
相关论文
共 25 条
[1]   Localized protocols for ad hoc clustering and backbone formation: A performance comparison [J].
Basagni, S ;
Mastrogiovanni, M ;
Panconesi, A ;
Petrioli, C .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (04) :292-306
[2]  
Boneh D, 2003, LECT NOTES COMPUT SC, V2656, P416
[3]   Energy-efficient secure pattern based data aggregation for wireless sensor networks [J].
Çam, H ;
Özdemir, S ;
Nair, P ;
Muthuavinashiappan, D ;
Sanli, HO .
COMPUTER COMMUNICATIONS, 2006, 29 (04) :446-455
[4]  
Castelluccia C, 2005, PROCEEDINGS OF MOBIQUITOUS 2005, P109
[5]  
Chan Haowen., 2006, Proc. of the 13th ACM Conference on Computer and Communications Security, P278
[6]   Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis [J].
School of Electrical and Computer Engineering, Purdue University, Box 165, West Lafayette, IN 47907, United States ;
不详 .
IEEE Trans Parallel Distrib Syst, 2006, 9 (987-1000) :987-1000
[7]   On the Energy Cost of Communication and Cryptography in Wireless Sensor Networks [J].
de Meulenaer, Giacomo ;
Gosset, Francois ;
Standaert, Francois-Xavier ;
Pereira, Olivier .
2008 4TH IEEE INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), 2008, :580-585
[8]   A fault-local self-stabilizing clustering service for wireless ad hoc networks [J].
Demirbas, Murat ;
Arora, Anish ;
Mittal, Vineet ;
Kulathumani, Vinodkrishnan .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (09) :912-922
[9]   An application-specific protocol architecture for wireless microsensor networks [J].
Heinzelman, WB ;
Chandrakasan, AP ;
Balakrishnan, H .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2002, 1 (04) :660-670
[10]  
Karlof C, 2003, PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL WORKSHOP ON SENSOR NETWORK PROTOCOLS AND APPLICATIONS, P113, DOI 10.1109/snpa.2003.1203362