Public-key cryptosystems based on composite degree residuosity classes

  • Authors:
  • Pascal Paillier

  • Affiliations:
  • GEMPLUS, Cryptography Department, Issy-Les-Moulineaux and ENST, Computer Science Department, Paris

  • Venue:
  • EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
  • Year:
  • 1999

Quantified Score

Hi-index 0.10

Visualization

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.