Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

  • Pascal Paillier
  • David Pointcheval
Conference paper

DOI: 10.1007/978-3-540-48000-6_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1716)
Cite this paper as:
Paillier P., Pointcheval D. (1999) Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries. In: Lam KY., Okamoto E., Xing C. (eds) Advances in Cryptology - ASIACRYPT’99. ASIACRYPT 1999. Lecture Notes in Computer Science, vol 1716. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

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