Our design achieves "proto-homomorphic" properties in an elementary manner: message addition and multiplication are emulated by pointwise addition and multiplication of the ciphertext vectors. Moreover, the extremely simple nature of our decryption makes the scheme easily amenable to bootstrapping. However, some complications are caused by the inherent presence of noticeable encryption error. Our main technical contribution is the development of two new techniques for handling this error in the homomorphic evaluation process.
We also provide a definitional framework for homomorphic encryption that may be useful elsewhere.Category / Keywords: public-key cryptography / homomorphic encryption, code-based cryptosystems Date: received 18 Nov 2011 Contact author: andrejb at cse cuhk edu hk Available format(s): PDF | BibTeX Citation Version: 20111121:164938 (All versions of this report) Short URL: ia.cr/2011/622 Discussion forum: Show discussion | Start new discussion