A Weakly Homomorphic Encryption with LDN
نویسندگان
چکیده
As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their huge key size. In this paper, we present a simple weakly homomorphic encryption scheme using only elementary modular arithmetic over the integers rather than working with ideal lattices. Compared with DGHV’s construction, the proposed scheme has shorter public key and ciphertext size. The main appeal of our approach is the conceptual simplicity. We reduce the security of weakly homomorphic scheme to “learning divisor with noise (LDN)”.
منابع مشابه
Homomorphic Encryption 4 : Construction of fully homomorphic encryption .
Assumption We’ll make the following “learning divisor with noise” assumption: LDN Assumption: let P a random n bit prime, R a random n4 bit prime, and let N = PR. A distinguisher that is given N and X1, . . . , Xpoly(n) cannot distinguish between case (I) Xi’s are chosen independently at random from [N ], and (II) Xi = PQi + 2Ei (mod N) where Qi is chosen independently at random from [R] and Ei...
متن کاملWhen Homomorphism Becomes a Liability
We show that an encryption scheme cannot have a simple decryption function and be homomorphic at the same time, even with added noise. Specifically, if a scheme can homomorphically evaluate the majority function, then its decryption cannot be weakly-learnable (in particular, linear), even if the probability of decryption error is high. (In contrast, without homomorphism, such schemes do exist a...
متن کاملFully Homomorphic Encryption - Part II
We continue our discussion on the fully homomorphic encryption scheme of van Dijk, Gentry, Halevi, and Vaikuntanathan [vDGHV10]. Last week we constructed a weakly homomorphic encryption scheme such that for any pair of properly generated ciphertexts c← Enc(b), c� ← Enc(b�), the sum or product of c, c� yields a value that decrypts to the sum (resp, product) of the original underlying plaintexts....
متن کاملOn Homomorphic Encryption and Enhanced Trapdoor Permutations
In this thesis we study two remotely related cryptographic primitives: homomorphic encryption and enhanced trapdoor permutations. Our main result regarding homomorphic encryption shows that any private-key encryption scheme that is weakly homomorphic with respect to addition modulo 2, can be transformed into a public-key encryption scheme. The homomorphic feature referred to is a minimalistic o...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 9 شماره
صفحات -
تاریخ انتشار 2014