Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem

Authors:
Huawei Huang;Bo Yang;Shenglin Zhu;Guozhen Xiao
Affiliations:
College of Information, South China Agricultural University, Guangzhou, China 510642 and State Key Lab. of Integrated Service Networks, Xidian University, Xi'an, China 710071;College of Information, South China Agricultural University, Guangzhou, China 510642;College of Information, South China Agricultural University, Guangzhou, China 510642;State Key Lab. of Integrated Service Networks, Xidian University, Xi'an, China 710071
Venue:
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Year:
2008

Citing 6
Cited 1

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Handbook of Applied Cryptography

Handbook of Applied Cryptography
How to Enhance the Security of Public-Key Encryption at Minimum Cost

PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
An Efficient Off-line Electronic Cash System Based On The Representation Problem.

An Efficient Off-line Electronic Cash System Based On The Representation Problem.
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

DDH-Like assumptions based on extension rings

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new generalized ElGamal public key encryption scheme based on a new Diffie-Hellman problem, so-called EDDH problem, which DDH problem can be reduced to. This scheme is one-way if and only if ECDH assumption holds and it is semantically secure in the standard model if and only if EDDH assumption holds. Since EDDH assumption still holds for generic bilinear groups, this encryption scheme adds to the growing toolkit of provable security primitives that can be used by the protocol designer looking to build complex secure systems with a sound basis.