6 search results - page 1 / 2 » Unification Modulo Homomorphic Encryption |
CCS
2010
ACM
13 years 2 months ago
2010
ACM
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
FROCOS
2009
Springer
13 years 9 months ago
2009
Springer
PKC
2012
Springer
11 years 7 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
FC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
CCS
1998
ACM
13 years 9 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...