Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

  • N. P. Smart
  • F. Vercauteren
Conference paper

DOI: 10.1007/978-3-642-13013-7_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6056)
Cite this paper as:
Smart N.P., Vercauteren F. (2010) Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In: Nguyen P.Q., Pointcheval D. (eds) Public Key Cryptography – PKC 2010. PKC 2010. Lecture Notes in Computer Science, vol 6056. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • N. P. Smart
    • 1
  • F. Vercauteren
    • 2
  1. 1.Dept. Computer ScienceUniversity of BristolBristolUnited Kingdom
  2. 2.COSIC - Electrical EngineeringKatholieke Universiteit LeuvenHeverleeBelgium

Personalised recommendations