Public-key cryptosystems based on composite degree residuosity classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1592, Issue , 1999, Pages 223-238

  Paillier, Pascal ^a,b  

^a GEMPLUS   (France)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PUBLIC KEY CRYPTOGRAPHY;

COMPUTATIONAL PROBLEM; ENCRYPTION SCHEMES; ITS APPLICATIONS; MODULAR ARITHMETIC; PROBABILISTIC ENCRYPTION; PROVABLY SECURE; PUBLIC KEY CRYPTOSYSTEMS; THE STANDARD MODEL;

CRYPTOGRAPHY;

EID: 84942550998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_16     Document Type: Conference Paper

References (30)

1. D. Angluin and D. Lichtenstein, Provable Security of Cryptosystems: A Survey, Computer Science Department, Yale University, TR-288, 1983.
2. M. Bellare and P. Rogaway, Random Oracles are Practical: A Paradigm for Design- ing Efficient Protocols, In Proceedings of the First CCS, ACM Press, pp. 62-73, 1993.
3. J. C. Benaloh, Verifiable Secret-Ballot Elections, PhD Thesis, Yale University, 1988.
4. R. Cramer, R. Gennaro and B. Schoenmakers, A Secure And Optimally Effi- cient Multi-Authority Election Scheme, LNCS 1233, Proceedings of Eurocrypt'97, Springer-Verlag, pp. 103-118, 1997.
5. W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Transaction on Information Theory, IT-22,6, pp. 644-654, 1995.
6. C. Ding, D. Pei and A. Salomaa, Chinese Remainder Theorem - Applications in Computing, Coding, Cryptography, World Scientiffic Publishing, 1996.
7. T. ElGamal, A Public-Key Cryptosystem an a Signature Scheme Based on Discrete Logarithms, IEEE Trans. on Information Theory, IT-31, pp. 469-472, 1985.
8. J. Feigenbaum, Locally Random Reductions in Interactive Complexity Theory, in Advances in Computational Complexity Theory, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 13, American Mathematical Society, Providence, pp. 73-98, 1993.
9. S. Goldwasser and S. Micali, Probabilistic Encryption, JCSS Vol. 28 No 2, pp. 270-299, 1984.
10. K. Koyama, U. Maurer, T. Okamoto and S. Vanstone, New Public-Key Schemes based on Elliptic Curves over the ring Zn, LNCS 576, Proceedings of Crypto'91, Springer-Verlag, pp. 252-266, 1992.
11. T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Veri_cation and Message-Encryption, LNCS 330, Proceedings of Euro- crypt'88, Springer-Verlag, pp. 419-453, 1988.
12. U. Maurer and S. Wolf, On the Complexity of Breaking the Diffie-Hellman Protocol.
13. R. Merkle and M. Hellman, Hiding Information and Signatures in Trapdoor Knap- sacks, IEEE Trans. on Information Theory, Vol. 24, pp. 525-530, 1978.
14. K. McCurley, A Key Distribution System Equivalent to Factoring, Journal of Cryp- tology, Vol. 1, pp. 95-105, 1988.
15. R. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42-44, Jet Propulsion Laboratories, Pasadena, 1978.
16. D. Naccache and J. Stern, A New Public-Key Cryptosystem Based on Higher Residues, LNCS 1403, Advances in Cryptology, Proceedings of Eurocrypt'98, Springer-Verlag, pp. 308-318, 1998.
17. D. Naccache and J. Stern, A New Public-Key Cryptosystem, LNCS 1233, Advances in Cryptology, Proceedings of Eurocrypt'97, Springer-Verlag, pp. 27-36, 1997.
18. P. Nguyen and J. Stern, Cryptanalysis of the Ajtai-Dwork Cryptosystem, LNCS 1462, Proceedings of Crypto'98, Springer-Verlag, pp. 223-242, 1998.
19. T. Okamoto and S. Uchiyama, A New Public-Key Cryptosystem as secure as Factoring, LNCS 1403, Advances in Cryptology, Proceedings of Eurocrypt'98, Springer-Verlag, pp. 308-318, 1998.
20. S. Park and D. Won, A Generalization of Public-Key Residue Cryptosystem, In Proceedings of 1993 Korean-Japan Joint Workshop on Information Security and Cryptology, pp. 202-206, 1993.
21. J. Patarin, The Oil and Vinegar Algorithm for Signatures, presented at the Dagstuhl Workshop on Cryptography, 1997.
22. J. Patarin and L. Goubin, Trapdoor One-Way Permutations and Multivariate Poly- nomials, LNCS 1334, Proceedings of ICICS'97, Springer-Verlag, pp. 356-368, 1997.
23. R. Peralta and E. Okamoto, Faster Factoring of Integers of a Special Form, IEICE, Trans. Fundamentals, E79-A, Vol. 4, pp. 489-493, 1996.
24. M. Rabin, Digital Signatures and Public-Key Encryptions as Intractable as Fac- torization, MIT Technical Report No 212, 1979.
25. R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol. 21, No 2, pp. 120-126, 1978.
26. A. Salomaa, Public-Key Cryptography, Springer-Verlag, 1990.
27. T. Sander and F. Tschudin, On Software Protection Via Function Hiding, Pro- ceedings of Information Hiding Workshop'98, 1998.
28. S. Vanstone and R. Zuccherato, Elliptic Curve Cryptosystem Using Curves of Smooth Order Over the Ring Zn, IEEE Trans. Inf. Theory, Vol. 43, No 2, July 1997.
29. S. Vaudenay, Cryptanalysis of the Chor-Rivest Cryptosystem, LNCS 1462, Pro- ceedings of Crypto'98, Springer-Verlag, pp. 243-256, 1998.
30. H. Williams, Some Public-Key Crypto-Functions as Intractable as Factorization, LNCS 196, Proceedings of Crypto'84, Springer-Verlag, pp. 66-70, 1985.