Abstract
Wireless sensor networks are now in widespread use to monitor regions, detect events and acquire information. Since the deployed nodes are separated, they need to cooperatively communicate sensed data to the base station. Hence, transmissions are a very energy-consuming operation. To reduce the amount of sending data, an aggregation approach can be applied along the path from sensors to the sink. However, usually the carried information contains confidential data. Therefore, an end-to-end secure aggregation approach is required to ensure a healthy data reception. End-to-end encryption schemes that support operations over cypher-text have been proved important for private party sensor network implementations. These schemes offer two main advantages: end-to-end concealment of data and ability to operate on cipher text, then no more decryption is required for aggregation. Unfortunately, nowadays these methods are very complex and not suitable for sensor nodes having limited resources. In this paper, we propose a secure end-to-end encrypted-data aggregation scheme. It is based on elliptic curve cryptography that exploits a smaller key size. Additionally, it allows the use of higher number of operations on cypher-texts and prevents the distinction between two identical texts from their cryptograms. These properties permit to our approach to achieve higher security levels than existing cryptosystems in sensor networks. Our experiments show that our proposed secure aggregation method significantly reduces computation and communication overhead and can be practically implemented in on-the-shelf sensor platforms. By using homomorphic encryption on elliptic curves, we thus have realized an efficient and secure data aggregation in sensor networks. Lastly, to enlarge the aggregation functions that can be used in a secure wireless sensor network, a watermarking-based authentication scheme is finally proposed.
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
Chandramouli, R., Bapatla, S., Subbalakshmi, K.P.: Battery power-aware encryption. ACM Transactions on Information and System Security, 162–180 (2006)
Castelluccia, C., Mykletun, E., Tsudik, G.: Efficient aggregation of encrypted data in wireless sensor networks. In: Proc. of the 2nd Annual MobiQuitous, pp. 119–117 (2005)
Girao, J., Schneider, M., Westhoff, D.: Cda: Concealed data aggregation in wireless sensor networks. In: Proceedings of the ACM Workshop on Wireless Security (2004)
Acharya, M., Girao, J., Westhoff, D.: Secure comparison of encrypted data in wireless sensor networks. In: Third International Symposium WiOpt 2005, pp. 47–53 (2005)
Haodong, W., Bo, S., Qun, L.: Elliptic curve cryptography-based access control in sensor networks. International Journal of Security and Networks 1(3-4), 127–137 (2006)
Liu, A., Ning, P.: Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks. In: Proceedings of IPSN 2008, pp. 245–256 (2008)
Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)
Przydatek, B., Song, D., Perrig, A.: Sia: Secure information aggregation in sensor networks. In: Proceedings of ACM SenSys Conference, pp. 255–265 (2003)
Cam, H., Ozdemir, S., Nair, P., Muthuavinashinappan, D., Sanli, H.O.: Espda: Energy-efficient secure pattern based data aggregation for wireless sensor networks. Computer Communication Journal (29), 446–455 (2006)
Huang, S.-I., Shieh, S., Tygar, J.D.: Secure encrypted-data aggregation for wireless sensor networks. Wireless Networks Journal, 1022–1038 (2009)
Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 471–483. Springer, Heidelberg (2003)
Cheon, J., Kim, W.-H., Nam, H.: Known-plaintext cryptanalysis of the domingo ferrer algebraic privacy homomorphism scheme. Inf. Processing Letters 97(3), 118–123 (2006)
Wagner, D.: Cryptanalysis of an algebraic privacy homomorphism. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 234–239. Springer, Heidelberg (2003)
Lin, H.-Y., Chiang, T.-C.: Cooperative secure data aggregation in sensor networks using elliptic curve based cryptosystems. In: Luo, Y. (ed.) Cooperative Design, Visualization, and Engineering. LNCS, vol. 5738, pp. 384–387. Springer, Heidelberg (2009)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer, Heidelberg (2004)
Cheung, R.C.C., Telle, N.J., Luk, W., Cheung, P.Y.K.: Secure encrypted-data aggregation for wireless sensor networks. IEEE Trans. on Very Large Scale Integration Systems 13(9), 1048–1059 (2005)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Castelluccia, C., Chan, A., Mykletun, E., Tsudik, G.: Efficient and provably secure aggregation of encrypted data in wireless sensor networks. ACM Trans. Sen. Netw. 5(3), 1–36 (2009)
Barker, E., Roginsky, A.: Draft nist special publication 800-131 recommendation for the transitioning of cryptographic algorithms and key sizes (2010)
Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. Jour. of the International Association for Cryptologic Research 14(4), 255–293 (2001)
Zhang, W., Liu, Y., Das, S.K., De. Secure, P.: data aggregation in wireless sensor networks: A watermark based authentication supportive approach. Pervasive and Mobile Computing 4(5), 658–680 (2008)
Cayre, F., Bas, P.: Kerckhoffs-based embedding security classes for woa data hiding. IEEE Transactions on Information Forensics and Security 3(1), 1–15 (2008)
Bahi, J.M., Guyeux, C.: A chaos-based approach for information hiding security. ArXiv e-prints (May 2010)
Bahi, J.M., Guyeux, C.: Hash functions using chaotic iterations. Journal of Algorithms & Computational Technology 4(2), 167–181 (2010) (accepted manuscript) (to appear)
Guyeux, C., Friot, N., Bahi, J.M.: Chaotic iterations versus Spread-spectrum: chaos and stego security. ArXiv e-prints (May 2010)
Bahi, J.M., Guyeux, C.: A new chaos-based watermarking algorithm. In: SECRYPT 2010, International conference on security and cryptography, Athens, Greece (to appear, 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Bahi, J.M., Guyeux, C., Makhoul, A. (2010). Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach. In: Zheng, J., Simplot-Ryl, D., Leung, V.C.M. (eds) Ad Hoc Networks. ADHOCNETS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 49. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17994-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-17994-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17993-8
Online ISBN: 978-3-642-17994-5
eBook Packages: Computer ScienceComputer Science (R0)