Paper 2018/585

Polynomial Functional Encryption Scheme with Linear Ciphertext Size

Jung Hee Cheon, Seungwan Hong, Changmin Lee, and Yongha Son

Abstract

In this paper, we suggest a new selective secure functional encryption scheme for degree $d$ polynomial. The number of ciphertexts for a message with length $\ell$ in our scheme is $O(\ell)$ regardless of $d$, while it is at least $\ell^{d/2}$ in the previous works. Our main idea is to generically combine two abstract encryption schemes that satisfies some special properties. We also gives an instantiation of our scheme by combining ElGamal scheme and Ring-LWE based homomorphic encryption scheme, whose ciphertext length is exactly $2\ell+1,$ for any degree $d.$

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Functional EncryptionHybrid Scheme
Contact author(s)
swanhong @ snu ac kr
History
2018-06-12: received
Short URL
https://ia.cr/2018/585
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/585,
      author = {Jung Hee Cheon and Seungwan Hong and Changmin Lee and Yongha Son},
      title = {Polynomial Functional Encryption Scheme with Linear Ciphertext Size},
      howpublished = {Cryptology ePrint Archive, Paper 2018/585},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/585}},
      url = {https://eprint.iacr.org/2018/585}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.