ROMJIST Volume 21, No. 3, 2018, pp. 210-218
P. J. Abisha, D. Jayaseelan Samuel A Homomorphic Property of the Cryptosystems Based on Word Problem
ABSTRACT: There are many cryptosystems in the literature based on formal language theory. Some of them are public key cryptosystems and others are symmetric key cryptosystems. Homomorphic encryption is a form of encryption that allows computations to be carried out on ciphertext, thus generating an encrypted result which, when decrypted, matches the result of operations performed on the plaintext. In this paper, we discuss a homomorphic property of public key cryptosystems based on word problem. An encryption scheme is probabilistic if when the same message is encrypted several times, different ciphertexts are obtained. A homomorphic property of public key encryption schemes based on word problems along with probabilistic property are used in this paper for constructing an electronic voting scheme.KEYWORDS: E-voting; Finitely Presented Partially Commutative Groups; Homomorphic Encryption; Public Key Cryptosystems; Word ProblemRead full text (pdf)