Abstract
At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed encryption schemes that are partially homomorphic, either additively or multiplicatively and announced an open research problem: finding a discrete-log-based cryptosystem that would help realize fully additive or multiplicative homomorphism. In this study, we achieve this goal by lifting the message space of the ElGamal scheme from M to goM. We then apply our scheme for constructing a novel protocol for secure data aggregation in Wireless Sensor Networks. © 2009 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Wang, L., Wang, L., Pan, Y., Zhang, Z., & Yang, Y. (2009). Discrete-log-based additively homomorphic encryption and secure WSN data aggregation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5927 LNCS, pp. 493–502). https://doi.org/10.1007/978-3-642-11145-7_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
