Computer Science – Cryptography and Security
Scientific paper
2011-11-18
Computer Science
Cryptography and Security
Scientific paper
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encryption schemes, where the message is hidden in the noisy part of the ciphertext, our scheme carries the message in the affine part of the transformation and applies noise only to achieve security. Our scheme can tolerate noise of arbitrary magnitude, as long as the noise vector has sufficiently small hamming weight (and its entries are independent). 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.
Bogdanov Andrej
Lee Chin Ho
No associations
LandOfFree
Homomorphic encryption from codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Homomorphic encryption from codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homomorphic encryption from codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-548865