8 search results - page 1 / 2 » Additively Homomorphic Encryption with d-Operand Multiplicat... |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
CANS
2011
Springer
12 years 4 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,...
IACR
2011
12 years 4 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...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...