Compress Multiple Ciphertexts Using Elgamal Encryption Schemes

Abstract

Abstract. In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze security of our scheme under the standard DDH assumption, and evaluate the performance of our construction.

A Novel Model for S.M.S Security and SPAM Detection

“…The ElGamal technique is used because it is an asymmetric cryptographic algorithm and provides better result than other algorithm as discussed by Myungsun Kim [3].…”

“…Myungsun Kim [3] used El-Gamal encryption scheme to decompose extension fields. It is also used to decompose the public key using El-Gamal Encryption method.…”

A Protocol for Privately Reporting Ad Impressions at Scale

“…Because the public keys are known a priori to both the client and the ad-network, they need not be sent and we halve our ciphertext expansion factor. This approach is well known to be secure under the assumption that the Decisional Diffie-Hellman problem is hard in G [12,28].…”