Share This Article:

Investigating Approaches of Data Integrity Preservation for Secure Data Aggregation in Wireless Sensor Networks

Abstract Full-Text HTML Download Download as PDF (Size:878KB) PP. 1-11
DOI: 10.4236/jis.2014.51001    2,943 Downloads   5,404 Views   Citations

ABSTRACT

Wireless Sensor Networks (WSNs) typically use in-network processing to reduce the communication overhead. Due to the fusion of data items sourced at different nodes into a single one during in-network processing, the sanctity of the aggregated data needs to be ensured. Especially, the data integrity of the aggregated result is critical as any malicious update to it can jeopardize not one, but many sensor readings. In this paper, we analyse three different approaches to providing integrity support for SDA in WSNs. The first one is traditional MAC, in which each leaf node and intermediate node share a key with parent (symmetric key). The second is aggregate MAC (AMAC), in which a base station shares a unique key with all the other sensor nodes. The third is homomorphic MAC (Homo MAC) that is purely symmetric key-based approach. These approaches exhibit diverse trade-off in resource consumption and security assumptions. Adding together to that, we also propose a probabilistic and improved variant of homomorphic MAC that improves the security strength for secure data aggregation in WSNs. We carry out simulations in TinyOS environment to experimentally evaluate the impact of each of these on the resource consumption in WSNs.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

V. Jariwala, V. Singh, P. Kumar and D. Jinwala, "Investigating Approaches of Data Integrity Preservation for Secure Data Aggregation in Wireless Sensor Networks," Journal of Information Security, Vol. 5 No. 1, 2014, pp. 1-11. doi: 10.4236/jis.2014.51001.

References

[1] F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, “Wireless Sensor Networks: A Survey,” Computer Networks, Vol. 38, No. 4, 2002, pp. 393-422. http://dx.doi.org/10.1016/S1389-1286(01) 00302-4
[2] E. Fasolo, M. Rossi, J. Widmer and M. Zorzi, “In-Network Aggregation Techniques for Wireless Sensor Networks: A Survey,” Wireless Communications, IEEE, Vol. 14, No. 2, 2007, pp. 70-87.
[3] R. Rajagopalan and P. K. Varshney, “Data Aggregation Techniques in Sensor Networks: A Survey,” Communications Surveys & Tutorials, IEEE, Vol. 8, No. 4, 2006, pp. 48-63. http://dx.doi.org/10. 1109/COMST.2006.283821
[4] C. Karlof and D. Wagner, “Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures,” Proceeding of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2002, pp. 113-127.
[5] D. Johnson, A. Menezes and S. Vanstone, “The Elliptic Curve Digital Signature Algorithm (ECDSA),” International Journal of Information Security, Vol. 1, No. 1, 2001, pp. 36-63.
[6] J. Katz and A. Lindell, “Aggregate Message Authentication Codes,” In: T. G. Malkin, Ed., CT-RSA 2008. LNCS, Springer, Heidelberg, 2008, pp. 155-169.
[7] S. Agrawal and D. Boneh, “Homomorphic MACs: MAC-Based Integrity for Network Coding,” Proceeding of ACNS 2009, LNCS, Vol. 5536, 2009, pp. 292-305.
[8] L. Hu and D. Evans, “Secure Aggregation for Wireless Networks,” Proceedings of Applications and the Internet Workshops, 2003, pp. 384-391.
[9] P. Jadia and A. Mathuria, “Efficient Secure Aggregation in Sensor Networks,” In: V. K. Prasanna, Eds., Proceeding of Boug′e, L., HiPC 2004, LNCS, Springer, Heidelberg, 2004, pp. 40-49.
[10] Y. Yang, X. Wang, S. Zhu and G. Cao, “SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks,” Proceedings of the 7th ACM International Symposium on Mobile ad hoc Networking and Computing, 2006, pp. 356-367.
[11] I. Rodhe and C. Rohner, “n-LDA: n-Layers Data Aggregation in Sensor Networks,” Proceedings of 28th International Conference on Distributed Computing Systems Workshops, ICDCS’08, IEEE, 2008, pp. 400-405.
[12] B. Przydatek, D. Song and A. Perrig, “SIA: Secure Information Aggregation in Sensor Networks,” Proceedings of the First International Conference on Embedded Networked Sensor Systems, Los Angeles, 2003, pp. 255-265. http://dx.doi.org/10.1145/958491.958521
[13] M. Bagaa, Y. Challal, A. Ouadjaout, N. Lasla and N. Badache, “Efficient Data Aggregation with Innetwork Integrity Control for WSN,” Journal of Parallel and Distributed Computing, Vol. 72, No. 10, 2012, pp. 1157-1170. http://dx.doi.org/10.1016/j.jpdc.2012.06.006
[14] V. Jariwala and D. Jinwala, “Evaluating Homomorphic Encryption Algorithms for Privacy in Wireless Sensor Networks,” International Journal of Advancements in Computing Technology, Vol. 3, No. 6, 2011, pp. 215-223. http://dx.doi.org/10.4156/ijact.vol3.issue6.25
[15] M. Bellare, J. Kilian and P. Rogaway, “The Security of the Cipher Block Chaining Message Authentication Code,” Journal of Computer and System Sciences, Vol. 61, No. 3, 2000, pp. 362-399. http://dx.doi.org/10.1006/jcss.1999.1694
[16] M. Bellare, R. Canetti and H. Krawczyk, “Keying Hash Functions for Message Authentication,” In: N. Koblitz, Ed., Proceeding of the CRYPTO 1996, LNCS, Springer, Heidelberg, 1996, pp. 1-15.
[17] D. Jinwala, D. Patel and K. Dasgupta, “Optimizing the Block Cipher and Modes of Operations Overhead at the Link Layer Security Framework in the Wireless Sensor Networks,” Proceedings of the Information Systems Security, Lecture Notes in Computer Science (LNCS), Springer, Berlin Heidelberg, 2008, pp. 258-272.
[18] C. Fontaine and F. Galand, “A Survey of Homomorphic Encryption for Nonspecialists,” EURASIP Journal on Information Security, Vol. 2007, No. 1, 2007, pp. 1-15.
[19] C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 169-178.
[20] Z. J. Li and G. Gong, “Data Aggregation Integrity Based on Homomorphic Primitives in Sensor Networks,” Proceeding of the Ad-Hoc, Mobile and Wireless Networks, Lecture Notes in Computer Science, Springer, Berlin Heidelberg, 2010, pp. 149-162.
[21] J. Daemen and V. Rijmen, “The Design of Rijndael: AES —The Advanced Encryption Standard,” Springer, Heidelberg, 2002.
[22] B. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Communications of the ACM, Vol. 13 No. 7, 1970, pp. 422-426.
[23] J. Lawrence Carter and M. N. Wegmanan, “Universal Classes of Hash Functions,” Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143-154.
[24] J. Hill, et al., “System Architecture Directions for Networked Sensors,” Proceedings of 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), ACM Press, 2000, pp. 93-104.
[25] D. Gay, P. Levis, R. von Behren, M. Welsh, E. Brewer, and D. Culler, “The nesC Language: A Holistic Approach to Network Embedded Systems,” Proceedings of Programming Language Design and Implementation (PLDI), 2003.
[26] B. L. Titzer, D. Lee and J. Palsberg, “Avrora: Scalable Sensor Network Simulation with Precise Timing,” Proceedings of the 4th Intl. Conf. on Information Processing in Sensor Networks (IPSN), 2005, pp. 477-482.
[27] “Federal Information Processing Standards. Secure Hash Standard. FIPS PUB 180-2,” 2002.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.