1 research outputs found
Polynomial Functional Encryption Scheme with Linear Ciphertext Size
In this paper, we suggest a new selective secure
functional encryption scheme
for degree polynomial.
The number of ciphertexts for a message with length in our scheme
is regardless of ,
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 $d.