Paillier's cryptosystem revisited

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2001, Pages 206-214

  Catalano, Dario ^a   Gennaro, Rosario ^a   Howgrave Graham, Nick ^a   Nguyen, Phong Q ^a  

^a UNIVERSITY OF CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; INFORMATION THEORY; SECURITY OF DATA; SEMANTICS;

SEMANTIC SECURITY;

CRYPTOGRAPHY;

EID: 0035751083     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501983.502012     Document Type: Conference Paper

References (31)

1. How to generate cryptographically strong sequences of pseudo random bits
2. 0.292
3. rq for larger r
4. A discrete logarithm implementation of perfect zero-knowledge blobs
5. A robust and verifiable cryptographically secure election scheme
6. Finding small solutions to small degree polynomials
7. Finding a small root of a univariate modular equation
8. Low-exponent RSA with related messages
9. A generalization, a simplification and some applications of Paillier's probabilistic public-key system
10. On-line/iff-line digital signatures
11. Sharing decryption in the context of voting or lotteries
12. One round threshold discrete-log key generation without private channels
13. Minimum disclosure proofs of knowledge
14. Undeniable signatures
15. Probabilistic encryption
16. The knowledge complexity of interactive proof systems
17. A digital signature scheme secure against adaptive chosen-message attacks
18. Solving simultaneous modular equations of low degree
19. Approximate integer common divisors
20. Chameleon signatures
21. Efficient, perfect random number generators
22. A new public key cryptosystem based on higher residues
23. The two faces of lattices in cryptology
24. A new public-key cryptosystem as secure as factoring
25. Public key cryptosystems based on composite degree residuosity classes
26. New public key cryptosystems based on the dependent-RSA problems
27. Fair encryption of RSA keys
28. How to guess l'th roots modulo n by reducing lattice bases