ACM Home Page
Please provide us with feedback. Feedback
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
Full text PdfPdf (270 KB)
Source
ACM Transactions on Sensor Networks (TOSN) archive
Volume 5 ,  Issue 3  (May 2009) table of contents
Article No. 20  
Year of Publication: 2009
ISSN:1550-4859
Authors
Claude Castelluccia  INRIA, Saint Ismier Cedex, France
Aldar C-F. Chan  National University of Singapore, Singapore
Einar Mykletun  QUEST Software, Aliso Viejo, CA
Gene Tsudik  University of California, Irvine
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 119,   Downloads (12 Months): 402,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1525856.1525858
What is a DOI?

ABSTRACT

Wireless sensor networks (WSNs) are composed of tiny devices with limited computation and battery capacities. For such resource-constrained devices, data transmission is a very energy-consuming operation. To maximize WSN lifetime, it is essential to minimize the number of bits sent and received by each device. One natural approach is to aggregate sensor data along the path from sensors to the sink. Aggregation is especially challenging if end-to-end privacy between sensors and the sink (or aggregate integrity) is required. In this article, we propose a simple and provably secure encryption scheme that allows efficient additive aggregation of encrypted data. Only one modular addition is necessary for ciphertext aggregation. The security of the scheme is based on the indistinguishability property of a pseudorandom function (PRF), a standard cryptographic primitive. We show that aggregation based on this scheme can be used to efficiently compute statistical values, such as mean, variance, and standard deviation of sensed data, while achieving significant bandwidth savings. To protect the integrity of the aggregated data, we construct an end-to-end aggregate authentication scheme that is secure against outsider-only attacks, also based on the indistinguishability property of PRFs.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Boneh, D., Gentry, C., Lynn, B., and Shacham, H. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In Proceedings of Advances in Cryptology (EUROCRYPT'03). Lecture Notes in Computer Science, vol. 2656, 416--432.
3
 
4
 
5
Castelluccia, C. and Soriente, C. 2008. ABBA: Secure aggregation in WSNS - a bins and balls approach. In Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).
 
6
 
7
Chan, A. C.-F. and Castelluccia, C. 2008. On the (im)possibility of aggregate message authentication codes. In Proceedings of the IEEE International Symposium on Information Theory (ISIT).
8
9
 
10
Girao, J., Westhoff, D., and Schneider, M. 2004. CDA: Concealed data aggregation in wireless sensor networks. In Proceedings of the ACM Conference on Web Information Systems (WiSe).
 
11
12
 
13
Goldwasser, S. and Micali, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270--299.
 
14
 
15
 
16
Iwata, T. and Kurosawa, K. 2003. OMAC: One-key CBC MAC. In Proceedings of Fast Software Encryption (FSE'03). Lecture Notes in Computer Science, vol. 2887, 129--153.
17
 
18
Karlof, C. and Wagner, D. 2003. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of the IEEE Workshop on Sensor Network Protocols and Applications.
 
19
20
 
21
22
 
23
NIST. 2001. Advanced encryption standard. National Institute of Standards and Technology. FIPS PUB 197.
24
25
26
 
27
Rivest, R. L. 1995. The RC5 encryption algorithm. Dr. Dobb's J. 1008.
28
 
29
Vernam, G. S. 1926. Cipher printing telegraph systems for secret wire and radio telegraphic communications. J. Amer. Inst. Elect. Eng. 45, 105--115.
30
 
31
 
32
33
 
34
Zhu, S., Setia, S., Jajodia, S., and Ning, P. 2004. An interleaved hop-by-hop authentication scheme for filtering false data in sensor networks. In Proceedings of the IEEE Symposium on Security and Privacy.

Collaborative Colleagues:
Claude Castelluccia: colleagues
Aldar C-F. Chan: colleagues
Einar Mykletun: colleagues
Gene Tsudik: colleagues