A New Security Proof for Damgård's ElGamal [chapter]

Kristian Gjøsteen
2006 Lecture Notes in Computer Science  
We provide a new security proof for a variant of ElGamal proposed by Damgård, showing that it is secure against non-adaptive chosen ciphertext. Unlike previous security proofs for this cryptosystem, which rely on somewhat problematic assumptions, our computational problem is similar to accepted problems such the Gap and Decision Diffie-Hellman problems.
doi:10.1007/11605805_10 fatcat:qywtee7vvjbajb7nosvvyt54ny