Commutative-like Encryption: A New Characterization of ElGamal

2010/11/16 by Wei Dai, Dai, Wei
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.1011.3718

arxiv created 2010/11/16 · arxiv updated 2010/11/17

Abstract

Commutative encryption is a useful but rather strict notion in cryptography. In this paper, we deny a loose variation of commutative encryption-commutative-like encryption and give an example: the generalization of ElGamal scheme. The application of the new variation is also discussed.

Related

• An analogue of the ElGamal scheme based on the Markovski algorithm
• Le cryptosysteme non-commutatif
• A simple generalization of the ElGamal cryptosystem to non-abelian groups II
• Constructing a fully homomorphic encryption scheme with the Yoneda Lemma
• A general encryption scheme using two-sided multiplications with its cryptanalysis