Paper 2012/243

COMPRESS MULTIPLE CIPHERTEXTS USING ELGAMAL ENCRYPTION SCHEMES

MYUNGSUN KIM, JIHYE KIM, and JUNG HEE CHEON

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 decompos- ability 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.

Note: This article will be appeared at the Journal of Korean Mathematical Society (KMS).

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Ciphertext compressionDecomposabilityMessage rate
Contact author(s)
msunkim @ suwon ac kr
History
2012-10-25: revised
2012-05-03: received
See all versions
Short URL
https://ia.cr/2012/243
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/243,
      author = {MYUNGSUN KIM and JIHYE KIM and JUNG HEE CHEON},
      title = {COMPRESS MULTIPLE CIPHERTEXTS USING ELGAMAL ENCRYPTION SCHEMES},
      howpublished = {Cryptology ePrint Archive, Paper 2012/243},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/243}},
      url = {https://eprint.iacr.org/2012/243}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.