Optimized Implementation of Elliptic Curve Based Additive Homomorphic Encryption for Wireless Sensor Networks
| dc.creator | Ugus, Osman | |
| dc.creator | Westhoff, Dirk | |
| dc.creator | Laue, Ralf | |
| dc.creator | Shoufan, Abdulhadi | |
| dc.creator | Huss, Sorin A. | |
| dc.date | 2009-03-23 | |
| dc.date.accessioned | 2026-07-07T12:55:43Z | |
| dc.date.available | 2026-07-07T12:55:43Z | |
| dc.description | When deploying wireless sensor networks (WSNs) in public environments it may become necessary to secure their data storage and transmission against possible attacks such as node-compromise and eavesdropping. The nodes feature only small computational and energy resources, thus requiring efficient algorithms. As a solution for this problem the TinyPEDS approach was proposed in [7], which utilizes the Elliptic Curve ElGamal (EC-ElGamal) cryptosystem for additive homomorphic encryption allowing concealed data aggregation. This work presents an optimized implementation of EC-ElGamal on a MicaZ mote, which is a typical sensor node platform with 8-bit processor for WSNs. Compared to the best previous result, our implementation is at least 44% faster for fixed-point multiplication. Because most parts of the algorithm are similar to standard Elliptic Curve algorithms, the results may be reused in other realizations on constrained devices as well. | |
| dc.identifier | https://arxiv.org/abs/0903.3900 | |
| dc.identifier | http://arxiv.org/abs/0903.3900 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/224346 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Performance | |
| dc.title | Optimized Implementation of Elliptic Curve Based Additive Homomorphic Encryption for Wireless Sensor Networks | |
| dc.type | text |