A Note on the Malleability of the El Gamal Cryptosystem

Authors:
Douglas Wikström
Affiliations:
-
Venue:
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Year:
2002

Citing 2
Cited 1

On the Security of ElGamal Based Encryption

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory

Homomorphic Encryption with CCA Security

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The homomorphic property of the El Gamal cryptosystem is useful in the construction of efficient protocols. It is believed that only a small class of transformations of cryptotexts are feasible to compute. In the program of showing that these are the only computable transformations we rule out a large set of natural transformations.