A public key cryptosystem and a signature scheme based on discrete logarithms

By Taher El Gamal. 1984

How researchers see this paper

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

In Algorithms & Complexity

Citations in the corpus

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead (2020, background): “Note that there exist relevant solutions based on homomorphic encryption (HE) [17, 18, 32], where the server computes the sum of encrypted inputs under a key shared among the clients.”
A Review of Homomorphic Encryption Libraries for Secure Computation (2018, background): “Partially Homomorphic Encryption (PHE) schemes such as [9,10,11,12,13,14,15,16,17,18,19] allow only one type of operation any number of times - either addition or multiplication on encrypted data as compared to Somewhat Homomorphic schemes that support both.”
A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy (2015, background): “However, a few partially homomorphic schemes are efﬁcient enough to achieve both security and performance goals, e.g., multiplicatively homomorphic ElGamal [25] and RSA [48] schemes.”
Proactively Accountable Anonymous Messaging in Verdict (2012, methodology): “The first scheme builds on the ElGamal public-key cryptosystem [20].”
CATalyst: Defeating last-level cache side channel attacks in cloud computing (2016, unknown): “18 implementations of the ElGamal decryption [12].”
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008, methodology): “appears in [19], with commitments based on El-Gamal encryption [8].”
Software Implementation of the NIST Elliptic Curves Over Prime Fields (2001, methodology): “One method to potentially speed the computation of kP + lQ is simultaneous multiple point multiplication (Algorithm 20), also known as Shamir’s trick [8].”
The State of Elliptic Curve Cryptography (2000, methodology): “” It is not hard to modify the Diffie–Hellman protocol for the purpose of message transmission, using an idea of ElGamal [16].”
Resolving the conflict between generality and plausibility in verified computation (2013, methodology): “3For this purpose, Ginger requires homomorphic encryption but not fully homomorphic encryption [28]; Ginger uses ElGamal [25].”
Information sharing across private databases (2003, methodology): “Our definition of commutative encryption below is similar to the constructions used in [9, 18, 20, 42] and others.”