266 search results - page 11 / 54 » General Homomorphic Overloading |
148
click to vote
CANS
2011
Springer
13 years 9 months ago
2011
Springer
At EUROCRYPT ā10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
PKC
2012
Springer
13 years 7 days ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography ā PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
EUROCRYPT
2012
Springer
13 years 7 days ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
PKC
2009
Springer
15 years 10 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
CRYPTO
2012
Springer
13 years 8 days ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to nā1 of the n players. The protocol may be used to compute securely arithm...