Back to Results
First PageMeta Content
Finite fields / Computational complexity theory / Diffie–Hellman problem / ElGamal encryption / Universal hashing / Paillier cryptosystem / Diffie–Hellman key exchange / Cramer–Shoup cryptosystem / Index of cryptography articles / Cryptography / Cryptographic protocols / Public-key cryptography


A new security proof for Damg˚ ard’s ElGamal Kristian Gjøsteen March 17, 2005 Abstract
Add to Reading List

Document Date: 2005-03-17 15:37:01

Open Document

File Size: 127,30 KB

Share Result on Facebook

Company

SIAM Journal / L0 / Oracle / /

IndustryTerm

generation algorithm / zero-knowledge protocols / smooth hash proof systems / public key systems / projective hash proof systems / decryption algorithm / proof systems / /

Person

Michel Abdalla / Satoshi Hada / David Pointcheval / Ronald Cramer / Victor Shoup / Mihir Bellare / Adriana Palacio / Toshiaki Tanaka / Kristian Gjøsteen / Tatsuaki Okamoto / Ivan Damg / Phillip Rogaway / /

Position

editor / /

Product

Franklin / /

ProgrammingLanguage

L / /

PublishedMedium

SIAM Journal on Computing / IEEE Transactions on Information Theory / /

Technology

encryption / sampling algorithm / cryptography / sampling algorithms / key generation algorithm / public key / adaptive chosen ciphertext secure public-key encryption / SDH / private key / GSM / 3-round zero-knowledge protocols / plaintext-aware public-key encryption / decryption algorithm / /

SocialTag