Cryptology ePrint Archive: Report 2018/585

Polynomial Functional Encryption Scheme with Linear Ciphertext Size

Jung Hee Cheon and Seungwan Hong and 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.$

Category / Keywords: foundations / Functional Encryption, Hybrid Scheme

Date: received 6 Jun 2018

Contact author: swanhong at snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20180612:174507 (All versions of this report)

Short URL: ia.cr/2018/585


[ Cryptology ePrint archive ]