213 search results - page 3 / 43 » Can Homomorphic Encryption be Practical |
CRYPTO
2010
Springer
13 years 7 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...
STOC
2009
ACM
14 years 1 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...
CANS
2011
Springer
12 years 6 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...