Polynomial Functional Encryption Scheme with Linear Ciphertext Size

Jung Hee Cheon; Seungwan Hong; Changmin Lee; Yongha Son

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 $ℓ$ in our scheme is $O (ℓ)$ regardless of $d$ , while it is at least 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 for any degree

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: Functional Encryption Hybrid Scheme
Contact author(s): swanhong @ snu ac kr
History: 2018-06-12: received
Short URL: https://ia.cr/2018/585
License: 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},
      url = {https://eprint.iacr.org/2018/585}
}