Beyond Provable Security Verifiable IND-CCA Security of OAEP

Abstract : OAEP is a widely used public-key encryption scheme based on trapdoor permutations. Its security proof has been scrutinized and amended repeatedly. Fifteen years after the introduction of OAEP, we present a machine-checked proof of its security against adaptive chosen-ciphertext attacks under the assumption that the underlying permutation is partial-domain one-way. The proof can be independently verified by running a small and trustworthy proof checker and fixes minor glitches that have subsisted in published proofs. We provide an overview of the proof, highlight the differences with earlier works, and explain in some detail a crucial step in the reduction: the elimination of indirect queries made by the adversary to random oracles via the decryption oracle. We also provide—within the limits of a conference paper—a broader perspective on independently verifiable security proofs.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Benjamin Gregoire <>
Submitted on : Monday, February 2, 2015 - 11:33:13 AM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM

Links full text




Gilles Barthe, Benjamin Grégoire, Yassine Lakhnech, Santiago Zanella-Béguelin. Beyond Provable Security Verifiable IND-CCA Security of OAEP. Topics in Cryptology - 2011 - The Cryptographers' Track at the Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings, 2011, San Francisco, United States. 2011, 〈10.1007/978-3-642-19074-2_13〉. 〈hal-01112084〉



Record views