Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption

DOI10.1007/11935230_17zbMath1172.94593OpenAlexW1517362503MaRDI QIDQ5459083

Pascal Paillier, Jorge Luis Villar

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Toward RSA-OAEP Without Random Oracles ⋮ Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Factorization, malleability and equivalent problems ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model

This page was built for publication: Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption