D. Catalano, R. Gennaro, and N. H. Graham. Paillier's trapdoor function hides up to O(n) bits. Journal of Cryptology, 15(4):251--269, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bounds on the Efficiency of Generic Cryptographic.. - Gennaro, Gertner, Katz, .. Self-citation (Gennaro) (Correct)
No context found.
D. Catalano, R. Gennaro, and N. Howgrave-Graham. Paillier's Trapdoor Function Hides up to O(n) Bits. J. Crypto. 15(4): 251--269, 2002.
Bounds on the Efficiency of Generic Cryptographic.. - Gennaro, Gertner, Katz, .. Self-citation (Gennaro) (Correct)
No context found.
D. Catalano, R. Gennaro, and N. Howgrave-Graham. Paillier's Trapdoor Function Hides up to O(n) Bits. J. Crypto. 15(4): 251--269, 2002.
A New Cryptosystem Based On Hidden Order Groups - And (2006) (Correct)
No context found.
D. Catalano, R. Gennaro, and N. H. Graham. Paillier's trapdoor function hides up to O(n) bits. Journal of Cryptology, 15(4):251--269, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC