[Resource Topic] 2018/585: Polynomial Functional Encryption Scheme with Linear Ciphertext Size

Welcome to the resource topic for 2018/585

Title:
Polynomial Functional Encryption Scheme with Linear Ciphertext Size

Authors: Jung Hee Cheon, Seungwan Hong, Changmin Lee, 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.

ePrint: https://eprint.iacr.org/2018/585

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .