IJNSEC
2008
14 years 17 days ago
2008
Consider the following scenario with N + 2 parties, A, B, X1, X2,
CRYPTO
2010
Springer
14 years 1 months ago
2010
Springer
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
CRYPTO
2008
Springer
14 years 2 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
PKC
2010
Springer
14 years 4 months ago
2010
Springer
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 s...
CCS
1998
ACM
14 years 4 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...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...