Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Threshold cryptography based on Asmuth-Bloom secret sharing
Information Sciences: an International Journal
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
Homomorphic MACs: MAC-Based Integrity for Network Coding
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
MDPA: multidimensional privacy-preserving aggregation scheme for wireless sensor networks
Wireless Communications & Mobile Computing
Effective watermarking scheme in the encrypted domain for buyer-seller watermarking protocol
Information Sciences: an International Journal
Additively homomorphic encryption with d-operand multiplications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications 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-Log-Based additively homomorphic encryption and secure WSN data aggregation
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
New directions in cryptography
IEEE Transactions on Information Theory
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Fingerprinting protocol for images based on additive homomorphic property
IEEE Transactions on Image Processing
Towards a DL-based additively homomorphic encryption scheme
ISC'07 Proceedings of the 10th international conference on Information Security
Aggregation and probabilistic verification for data authentication in VANETs
Information Sciences: an International Journal
Efficient Linear Homomorphic Encryption from LWE Over Rings
Wireless Personal Communications: An International Journal
| Hi-index | 0.08 |
At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed discrete logarithm based encryption schemes that are partially homomorphic, either additively or multiplicatively and announced an open problem: finding a discrete logarithm based cryptosystem that would help realize fully additive or multiplicative homomorphism. In this study, we achieve this goal by enclosing two opposite settings on the discrete logarithm problems (DLP) simultaneously: the first setting is that DLP over Z"p"""0 (where p"0-1 is smooth) is used to encode messages, while the second setting is that DLP over Z"p (where p-1 is non-smooth, i.e., containing large prime factors) is used to encrypt plaintexts. Then, based on the proposed scheme, novel protocols for secure data aggregation in wireless sensor networks are presented. Finally, taking Paillier's factoring-based additively homomorphic encryption schemes as the reference framework, we present detailed performance comparisons and further enhancement.