Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

Nigel Smart, Fre Vercauteren

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

587 Citations (Scopus)

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.
Translated title of the contributionFully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Original languageEnglish
Title of host publicationPublic Key Cryptography - PKC 2010
PublisherSpringer Berlin Heidelberg
Pages420-443
Volume6056
Publication statusPublished - 2010

Bibliographical note

Other page information: 420-443
Conference Proceedings/Title of Journal: Public Key Cryptography - PKC 2010
Other identifier: 2001176

Fingerprint

Dive into the research topics of 'Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes'. Together they form a unique fingerprint.

Cite this