International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 1999: Advances in Cryptology — EUROCRYPT ’99 pp 223-238

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

  • Pascal Paillier
Conference paper

DOI: 10.1007/3-540-48910-X_16

Volume 1592 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Pascal Paillier
    • 1
    • 2
  1. 1.Cryptography DepartmentGEMPLUSIssy-Les-MoulineauxFrance
  2. 2.Computer Science DepartmentENSTParis Cedex 13France