Discrete-log-based additively homomorphic encryption and secure WSN data aggregation

Licheng Wang*, Lihua Wang*, Yun Pan, Zonghua Zhang, Yixian Yang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation and Communications Security - 11th International Conference, ICICS 2009, Proceedings
Pages493-502
Number of pages10
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event11th International Conference on Information and Communications Security, ICICS 2009 - Beijing, China
Duration: 14 Dec 200917 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5927 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Information and Communications Security, ICICS 2009
Country/TerritoryChina
CityBeijing
Period14/12/0917/12/09

Keywords

  • Additively homomorphic encryption
  • Data aggregation
  • Discrete-logarithm problem
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'Discrete-log-based additively homomorphic encryption and secure WSN data aggregation'. Together they form a unique fingerprint.

Cite this