[Resource Topic] 2009/571: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

Welcome to the resource topic for 2009/571

Title:
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

Authors: N. P. Smart, F. Vercauteren

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.

ePrint: https://eprint.iacr.org/2009/571

Talk: https://www.youtube.com/watch?v=Cz5seJhb7Pw

Slides: http://www.iacr.org/workshops/pkc2010/27_fully_homomorphic_encryption_with_relatively_small_key_and_ciphertext_sizes/

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .