A new security proof for Damgård's ElGamal

You are looking at a specific version 20050317:203701 of this paper. See the latest version.

Paper 2004/362

A new security proof for Damgård's ElGamal

Kristian Gjøsteen

Abstract

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: subgroup membership problem hash proof system
Contact author(s): kristian gjosteen @ math ntnu no
History: 2005-03-17: revised; 2004-12-20: received; See all versions
Short URL: https://ia.cr/2004/362
License: CC BY