Abstract
Concealed data aggregation protects against passive attackers and ensures privacy of sensor readings at intermediate nodes. However, the use of inherently malleable privacy homomorphism makes it susceptible to active attackers. In addition, it is a well-known fact that encrypted data processing is vulnerable to pollution attacks where a single malicious node can flood the network by fake readings. Hence, there exists a need to authenticate the processed readings. Traditional authentication mechanisms are not viable due to the conflicting requirements like in-network processing and encrypted data processing. The need for en route aggregation of sensor readings, the need for encrypted data processing and the need for message authentication both at the base station and at aggregator nodes, make message authentication a formidable challenge. Homomorphic Message Authentication Codes (H-MACs) help to verify the integrity of processed sensor readings. However, the need to verify the integrity of sensor readings both at intermediate node(s) and at the base station cannot be realized simultaneously through the currently available techniques. In this paper, we combine the benefits of privacy homomorphism and H-MACs to provide malleability resilient concealed data aggregation in the presence of both insider and outsider adversaries. As per our knowledge, our solution is the first to achieve integrity protecting concealed data aggregation in the presence of both insider and outsider adversaries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adler, J., Dai, W., Green, R., Neff, C.: Computational details of the votehere homomorphic election system. In: VoteHere. Inc. (2000)
Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-Based Integrity for Network Coding. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 292–305. Springer, Heidelberg (2009)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw.: Int. J. Comput. Telecommun. Netw. 38, 393–422 (2002)
Apavatjrut, A., Znaidi, W., Fraboulet, A., Goursaud, C., Lauradoux, C., Minier, M.: Energy friendly integrity for network coding in wireless sensor networks. In: Proceedings of the 2010 Fourth International Conference on Network and System Security. pp. 223–230. NSS ’10, IEEE Computer Society, Washington, DC, USA (2010)
Castelluccia, C., Chan, A.C.F., Mykletun, E., Tsudik, G.: Efficient and provably secure aggregation of encrypted data in wireless sensor networks. ACM Trans. Sens. Netw. (TOSN) 5(3), 20:1–20:36 (2009)
Chan, A.C.F., Castelluccia, C.: On the (im)possibility of aggregate message authentication codes. In: ISIT. pp. 235–239. IEEE (2008)
Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 471–483. Springer, Heidelberg (2002)
Fasolo, E., Rossi, M., Widmer, J., Zorzi, M.: In-network aggregation techniques for wireless sensor networks: a survey. Wireless. Commun. IEEE 14, 70–87 (2007)
Girao, J., Westhoff, D., Schneider, M.: CDA: concealed data aggregation for reverse multicast traffic in wireless sensor networks. In: 40th International Conference on Communications, IEEE ICC 2005 pp. 3044–3049 (May 2005)
Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119–132. Springer, Heidelberg (2004)
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., Pister, K.: System architecture directions for networked sensors. ACM. SIGPLAN. Not. 35(11), 93–104 (2000)
Hoffstein, J., Pipher, J., Silverman, J.: An Introduction to Mathematical Cryptography, 1st edn., New York, Incorporated (2008)
Karlof, C., Sastry, N., Wagner, D.: Tinysec: A link layer security architecture for wireless sensor networks. In: Proceedings of the 2Nd International Conference on Embedded Networked Sensor Systems pp. 162–175. SenSys ’04, ACM, New York, (2004)
Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203–209 (1987)
Malan, D.J., Welsh, M., Smith, M.D.: A public-key infrastructure for key distribution in tinyos based on elliptic curve cryptography. In: First IEEE International Conference on Sensor and Ad Hoc Communications and Network (IEEE SECON 2004), pp. 71–80 (Oct 2004)
Mykletun, E., Girao, J., Westhoff, D.: Public key based cryptoschemes for data concealment in wireless sensor networks. In: IEEE International Conference on Communications. ICC-2006, Istanbul, Turkey (June 2006)
Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308–318. Springer, Heidelberg (1998)
Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169–177 (1978)
Ugus, O.: Asymmetric Homomorphic Encryption Transformation for Securing Distributed Data Storage in Wireless Sensor Networks (in cooperation with NEC Heidelberg). Master’s thesis, Technische Universität Darmstadt (2007)
Westhoff, D., Girao, J., Acharya, M.: Concealed data aggregation for reverse multicast traffic in sensor networks: encryption, key distribution, and routing adaptation. IEEE. Trans. Mob. Comput. 5(10), 1417–1431 (2006)
Westhoff, D., Ugus, O.: Malleability resilient (premium) concealed data aggregation. In: Proceedings of the 4th IEEE International Workshop on Data Security and Privacy in Wireless Networks (D-SPAN’13). IEEE Press, Madrid Spain (2013)
Acknowledgments
This research was a part of a project “A Secure Data Aggregation System and An Intrusion Detection System for Wireless Sensor Networks”. It was supported by the Department of Electronics and Information Technology, Ministry of Communications and Information Technology, Government of India.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Parmar, K., Jinwala, D.C. (2014). Malleability Resilient Concealed Data Aggregation. In: Kermarrec, Y. (eds) Advances in Communication Networking. EUNICE 2014. Lecture Notes in Computer Science(), vol 8846. Springer, Cham. https://doi.org/10.1007/978-3-319-13488-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-13488-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13487-1
Online ISBN: 978-3-319-13488-8
eBook Packages: Computer ScienceComputer Science (R0)