Discrete-Log-Based additively homomorphic encryption and secure WSN data aggregation

Authors:
Licheng Wang;Lihua Wang;Yun Pan;Zonghua Zhang;Yixian Yang
Affiliations:
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China;Security Fundamental Group, Information Security Research Center, National Institute of Information and Communications Technology, Tokyo, Japan;School of Computer, Communication University of China, Beijing, P.R. China;Security Fundamental Group, Information Security Research Center, National Institute of Information and Communications Technology, Tokyo, Japan;Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, P.R. China
Venue:
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Year:
2009

Citing 14
Cited 1

Public-key cryptosystems provably secure against chosen ciphertext attacks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Probabilistic encryption & how to play mental poker keeping secret all partial information

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
E.cient Aggregation of encrypted data in Wireless Sensor Networks

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
A computational introduction to number theory and algebra

A computational introduction to number theory and algebra
Homomorphic encryption and secure comparison

International Journal of Applied Cryptography
Verifiable Rotation of Homomorphic Encryptions

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Encoding-Free elgamal encryption without random oracles

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

Discrete logarithm based additively homomorphic encryption and secure data aggregation

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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 $\mathcal{M}$ to $g_0^\mathcal{M}$. We then apply our scheme for constructing a novel protocol for secure data aggregation in Wireless Sensor Networks.