Abstract
In many wireless sensor network applications, the data collection sink (base station) needs to find the aggregated statistics of the network. Readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the result-checking phase whose congestion is \({\cal O}(\log n)\) where n is the total number of sensor nodes.
In this paper, we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a weak adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion is constant. This means that our protocol suits large-scale wireless sensor networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chan, H., Perrig, A., Song, D.: Secure hierarchical in-network aggregation in sensor networks. In: CCS 2006, pp. 278–287. ACM, New York (2006)
Frikken, K.B., Dougherty, J.A.: An efficient integrity-preserving scheme for hierarchical sensor aggregation. In: WiSec 2008, pp. 68–76. ACM, New York (2008)
Madden, S., Franklin, M., Hellerstein, J., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. In: Proc. ACM SIGOPS Operating Systems, pp. 131–146. ACM, New York (2002)
Yao, Y., Gehrke, J.: The cougar approach to in-network query processing in sensor networks. In: Proc. ACM SIGMOD Record, vol. 31, pp. 9–18. ACM, New York (2002)
Hu, L., Evans, D.: Secure aggregation for wireless networks. In: SAINT 2003, pp. 27–31. IEEE, Los Alamitos (2003)
Jadia, P., Mathuria, A.: Efficient secure aggregation in sensor networks. In: Bougé, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol. 3296, pp. 40–49. Springer, Heidelberg (2004)
Przydatek, B., Song, D., Perrig, A.: SIA: Secure information aggregation in sensor networks. In: SenSys 2003, pp. 255–265. ACM, New York (2003)
Du, W., Deng, J., Han, Y.S., Varshney, P.: A Witness-Based Approach for Data Fusion Assurance in Wireless Sensor Networks. In: GLOBECOM 2003, pp. 1435–1439. IEEE, Los Alamitos (2003)
Mahimkar, A., Rappaport, T.S.: SecureDAV: a secure data aggregation and verification protocol for sensor networks. In: GLOBECOM 2004, pp. 2175–2179. IEEE, Los Alamitos (2004)
Yang, Y., Wang, X., Zhu, S., Cao, G.: SDAP: A secure hop-by-hop data aggregation protocol for sensor networks. In: MobiHoc 2006, pp. 356–367. ACM, New York (2006)
Gupta, I., Van Renesse, R., Birman, K.P.: Scalable fault-tolerant aggregation in large process groups. In: DSN 2001, pp. 433–442. IEEE, Los Alamitos (2001)
Nath, S., Gibbons, P.B., Seshan, S., Anderson, Z.R.: Synopsis diffusion for robust aggregation in sensor networks. In: SenSys 2004, pp. 250–262. ACM, New York (2004)
Chen, J.Y., Pandurangan, G., Xu, D.: Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis. In: IPSN 2005, pp. 348–355. IEEE, Los Alamitos (2005)
Manjhi, A., Nath, S., Gibbons, P.B.: Tributaries and deltas: efficient and robust aggregation in sensor network streams. In: Proc. 2005 ACM SIGMOD International Conference on Management of Data, pp. 287–298. ACM, New York (2005)
Wagner, D.: Resilient aggregation in sensor networks. In: SASN 2004, pp. 78–87. ACM, New York (2004)
Haghani, P., Papadimitratos, P., Poturalski, M., Aberer, K., Hubaux, J.P.: Efficient and robust secure aggregation for sensor networks. In: NPSec 2007, pp. 1–6. IEEE, Los Alamitos (2007)
Chan, H., Perrig, A.: Efficient security primitives derived from a secure aggregation algorithm. In: CCS 2008, pp. 521–534. ACM, New York (2008)
Zhang, W., Wang, C., Feng, T.: GP2S: Generic Privacy-Preservation Solutions for Approximate Aggregation of Sensor Data. In: PerCom 2008, pp. 179–184. IEEE, Los Alamitos (2008)
Castelluccia, C., Mykletun, E., Tsudik, G.: Efficient aggregation of encrypted data in wireless sensor networks. In: MOBIQUITOUS 2005, pp. 109–117. IEEE, Los Alamitos (2005)
Manulis, M., Schwenk, J.: Security model and framework for information aggregation in sensor networks. ACM Transactions on Sensor Networks (TOSN) 5(2) (2009)
Westhoff, D., Girao, J., Acharya, M.: Concealed data aggregation for reverse multicast traffic in sensor networks: encryption, key distribution, and routing adaptation. IEEE Transactions on Mobile Computing 5(10), 1417–1431 (2006)
He, W., Liu, X., Nguyen, H., Nahrstedt, K., Abdelzaher, T.: PDA: Privacy-preserving data aggregation in wireless sensor networks. In: INFOCOM 2007, pp. 2045–2053. IEEE, Los Alamitos (2007)
Ren, S.Q., Kim, D.S., Park, J.S.: A secure data aggregation scheme for wireless sensor networks. In: Thulasiraman, P., He, X., Xu, T.L., Denko, M.K., Thulasiram, R.K., Yang, L.T. (eds.) ISPA Workshops 2007. LNCS, vol. 4743, pp. 32–40. Springer, Heidelberg (2007)
Merkle, R.C.: Protocols for public key cryptosystems. In: IEEE S&P, pp. 122–134. IEEE, Los Alamitos (1980)
Perrig, A., Canetti, R., Tygar, J.D., Song, D.: Efficient Authentication and Signing of Multicast Streams over Lossy Channels. In: IEEE S&P, pp. 56–73. IEEE, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyaji, A., Omote, K. (2011). Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks. In: Chung, Y., Yung, M. (eds) Information Security Applications. WISA 2010. Lecture Notes in Computer Science, vol 6513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17955-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-17955-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17954-9
Online ISBN: 978-3-642-17955-6
eBook Packages: Computer ScienceComputer Science (R0)