A public key cyryptosystem and signature scheme based on discrete logarithms

By T. Elgamal. 1985

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

A Survey on Homomorphic Encryption Schemes (2017, methodology): “There are several useful PHE examples [Rivest et al. 1978b; Goldwasser and Mi-cali 1982; ElGamal 1985; Benaloh 1994; Naccache and Stern 1998; Okamoto and Uchiyama 1998; Paillier 1999; Damgård and Jurik 2001; Kawachi et al. 2007] in the literature.”
Stronger Security of Authenticated Key Exchange (2006, unknown): “Specifically, for certain signature schemes such as Elgamal[11], DSA[18], GQ[12] or Schnorr[20], by revealing random coins used in the computation of any signature by any party the adversary can compute the long-term secret key of that party.”
Secure Hybrid Encryption from Weakened Key Encapsulation (2007, methodology): “The following table summarizes the key-encapsulation part of the (only IND-CPA secure) ElGamal scheme [16], the Cramer-Shoup encryption scheme [14], the Kurosawa-Desmedt scheme [24], and ours.”
Five Practical Attacks for "Optimistic Mixing for Exit-Polls" (2003, methodology): “The protocol employs an El Gamal [ 6 ] cryptosystem in a subgroup GQ of prime order Q of the multiplicative group modulo a prime P, i.e.”
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem (2004, methodology): “In this section we introduce a variant of the ElGamal encryption scheme [ 13 ] that, although not IND-CCA secure, is IND-CCA preserving in the RO model under a standard assumption.”
Towards Fair and Privacy-Preserving Federated Deep Models (2019, background): “omputation on ciphertexts but is less efﬁcient [23]. On the other hand, somewhat homomorphic encryption and partially homomorphic encryption are speciﬁed by a limited number of operations [24], [25], [26], [27]. However, all these techniques generally result in longer ciphertext than the plaintext, ”
Secure function evaluation based on secret sharing and homomorphic encryption (2009, background): “a constant integer k. The El Gamal cryptosystem [ 11 ] is an example of a semantically secure multiplicative homomorphic cryptosystem.”
On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications (2019, methodology): “Exponential ElGamal encryption [21] also requires public-key operations for encryption, but has relatively smaller ciphertexts than Paillier encryption.”