Skip to main content

1999 | OriginalPaper | Buchkapitel

Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

verfasst von : Pascal Paillier, David Pointcheval

Erschienen in: Advances in Cryptology - ASIACRYPT’99

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
verfasst von
Pascal Paillier
David Pointcheval
Copyright-Jahr
1999
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-540-48000-6_14