Paper 2018/585 Original: eprint.iacr.org/2018/585 ↗
Polynomial Functional Encryption Scheme with Linear Ciphertext Size
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.
- History
- 2018-06-12: last updated
- 2018-06-12: published
- Short URL
- https://ia.cr/2018/585
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}