Sciweavers

Share
PKC
2010
Springer

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

9 years 6 months ago
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer. As such, our scheme has smaller message expansion and key size than Gentry’s original scheme. In addition, our proposal allows efficient fully homomorphic encryption over any field of characteristic two.
Nigel P. Smart, Frederik Vercauteren
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2010
Where PKC
Authors Nigel P. Smart, Frederik Vercauteren
Comments (0)
books