7 search results - page 1 / 2 » Fully Homomorphic Public-key Encryption Based on Discrete Lo... |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
EUROCRYPT
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
ISW
2007
Springer
13 years 10 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 ...