Public-key cryptosystems based on composite degree residuosity classes
Citations
1,164 citations
Cites methods from "Public-key cryptosystems based on c..."
...As the performance of the first step of NWI+13 is not reported in the table, we implement it on our own using Paillier’s encryption [38] with batching, which is the same as used in the protocol of NWI+13....
[...]
...The LHE can be initiated using the cryptosystem of Paillier [38] or Damgard-GeislerKroigaard(DGK) [17]....
[...]
...As the performance of the first step of NWI13 is not reported in the table, we implement it on our own using Paillier’s encryption [38] with batching, which is the same as used in the protocol of NWI13....
[...]
1,142 citations
1,127 citations
Additional excerpts
..., [21,12,30,6])....
[...]
1,076 citations
1,054 citations
Cites background from "Public-key cryptosystems based on c..."
...This property is obtained by Paillier’s cryptosystem [20] and subsequent constructions [21, 7]....
[...]
...The Paillier [20] homomorphic encryption scheme recovers rP (y) + y....
[...]
...The Paillier [20] homomorphic encryption scheme recovers rP (y) + y. Protocol PM-Semi-Honest Input: C’s input is a set X = {x1, . . . , xkC}, S ’s input is a set Y = {y1, . . . , ykS}....
[...]
References
14,980 citations
"Public-key cryptosystems based on c..." refers background in this paper
...Since the discovery of public-key cryptography by Die and Hellman [ 5 ], very few convincingly secure asymetric schemes have been discovered despite considerable research eorts....
[...]
14,659 citations
7,514 citations
"Public-key cryptosystems based on c..." refers methods in this paper
...Another famous technique, related to Die-Hellman-type schemes (El Gamal [ 7 ], DSA, McCurley [14], etc.) combines the homomorphic properties of the modular exponentiation and the intractability of extracting discrete logarithms over nite groups....
[...]
5,313 citations
"Public-key cryptosystems based on c..." refers methods in this paper
...Finally, denoting by h : N 7→ {0, 1}k ⊂ Zn2 a hash function see as a random oracle [2], we obtain a digital signature scheme as follows....
[...]