Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

  • Pascal Paillier
  • David Pointcheval
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1716)


This paper proposes two new public-key cryptosystems semantically secure against adaptive chosen-ciphertext attacks. Inspired from a recently discovered trapdoor technique based on composite-degree residues, our converted encryption schemes are proven, in the random oracle model, secure against active adversaries (NM-CCA2) under the assumptions that the Decision Composite Residuosity and Decision Partial Discrete Logarithms problems are intractable. We make use of specific techniques that differ from Bellare-Rogaway or Fujisaki-Okamoto conversion methods. Our second scheme is specifically designed to be efficient for decryption and could provide an elegant alternative to OAEP.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Pascal Paillier
    • 1
    • 2
  • David Pointcheval
    • 3
  1. 1.Gemplus Cryptography DepartmentIssy-Les-MoulineauxFrance
  2. 2.ENSTParis Cedex 13France
  3. 3.LIENS – CNRS, École Normale SupérieureParis Cedex 05France

Personalised recommendations