Public-key cryptosystems based on composite degree residuosity classes
Citations
779 citations
770 citations
750 citations
Cites background from "Public-key cryptosystems based on c..."
...Note that Paillier’s cryptosystem [23] satisfies each of our requirements: it is additively homomorphic, supports ciphertexts re-randomization and threshold decryption (secure in the malicious case) [10,11], and allows certain efficient zero-knowledge proofs (standard constructions from [5,3], and proof of plaintext knowledge [6])....
[...]
711 citations
682 citations
Cites background from "Public-key cryptosystems based on c..."
...Under the aforementioned system model and security requirements, our design goal is to develop an efficient and privacy-preserving aggregation scheme for secure smart grid communications....
[...]
...Ç...
[...]
...The BDH problem is stated as follows: Given the elements ðP; aP ; bP ; cP Þ 2 G for unknown a; b; c 2 ZZ q , to compute eðP; P Þabc 2 G T ....
[...]
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....
[...]