Beyond Provable Security Verifiable IND-CCA Security of OAEP
From MaRDI portal
Publication:3073706
DOI10.1007/978-3-642-19074-2_13zbMath1284.94052OpenAlexW1539009458MaRDI QIDQ3073706
Benjamin Grégoire, Santiago Zanella Béguelin, Gilles Barthe, Yassine Lakhneche
Publication date: 11 February 2011
Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_13
Related Items
Automated proofs of block cipher modes of operation ⋮ Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+} ⋮ Post-quantum verification of Fujisaki-Okamoto ⋮ Verifiable Security of Boneh-Franklin Identity-Based Encryption
Uses Software
Cites Work
- Automated proofs for asymmetric encryption
- Proofs of randomized algorithms in Coq
- A revision of the proof of the Kepler conjecture
- RSA-OAEP is secure under the RSA assumption
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Formal Proof of Provable Security by Game-Playing in a Proof Assistant
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- OAEP Is Secure under Key-Dependent Messages
- Strengthening Security of RSA-OAEP
- A method for obtaining digital signatures and public-key cryptosystems
- Formal certification of code-based cryptographic proofs
- Formal certification of a compiler back-end or
- Another look at automated theorem-proving
- A Formal Language for Cryptographic Pseudocode
- Programming Language Techniques for Cryptographic Proofs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
