A bilinear pairing based secure data aggregation scheme for WSNs
Kumar, V. (2019). A bilinear pairing based secure data aggregation scheme for WSNs. In Proceeding of 15th International Wireless Communications & Mobile Computing Conference (IWCMC) (pp. 102–107). Washington, DC, USA: IEEE. https://doi.org/10.1109/iwcmc.2019.8766759
Permanent Research Commons link: https://hdl.handle.net/10289/13015
End to end secure data aggregation scheme for wireless sensor networks that are based on public key cryptography generally use elliptic curves. However elliptic curve based protocols require messages to be mapped to elliptic curves before performing any operations and finally reverse mapped to retrieve the message back. No mapping function, however, which is both homomorphic and has an efficient reverse mapping function is currently known. The mapping functions used in many previous protocols require brute forcing to reverse map the message from a point on the elliptic curve. This solution may be feasible on a base station with unlimited energy and processing power but it means that decrypting becomes very inefficient on ordinary sensors. We propose a secure data aggregation algorithm based on bilinear pairing that avoids this problem and makes decrypting data feasible on ordinary sensors.
This is an author’s accepted version of an article published in the Proceeding of 15th International Wireless Communications & Mobile Computing Conference (IWCMC). © 2019 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.