213 search results - page 4 / 43 » Can Homomorphic Encryption be Practical |
IACR
2011
12 years 7 months ago
2011
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 latticeba...
ITNG
2006
IEEE
14 years 1 months ago
2006
IEEE
Informally, Privacy Homomorphism (PH) refers to encryption schemes with a homomorphic property allowing to obtain Ek(a + b) or Ek(a × b) from ciphertexts Ek(a) and Ek(b) without ...
CCS
1998
ACM
13 years 11 months ago
1998
ACM
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one d...
IACR
2011
12 years 7 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
ISW
2007
Springer
14 years 1 months ago
2007
Springer
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security ...