Beyond provable security verifiable IND-CCA security of OAEP

DOI10.1007/978-3-642-19074-2_13MaRDI QIDQ3073706zbMATH OpenOpenAlexFDO

Authors Gilles Barthe, Benjamin Grégoire, Santiago Zanella-Béguelin, Yassine Lakhnech

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• OAEP reconsidered
• Instantiability of RSA-OAEP under chosen-plaintext attack
• scientific article; zbMATH DE number 1842495
• Strengthening Security of RSA-OAEP
• On the Security of OAEP

Cites work

• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• scientific article; zbMATH DE number 1842495 (Why is no real title available?)
• A Formal Language for Cryptographic Pseudocode
• A method for obtaining digital signatures and public-key cryptosystems
• A revision of the proof of the Kepler conjecture
• Another look at automated theorem-proving
• Automated proofs for asymmetric encryption
• Formal Proof of Provable Security by Game-Playing in a Proof Assistant
• Formal certification of a compiler back-end or: programming a compiler with a proof assistant
• Formal certification of code-based cryptographic proofs
• Formal proof
• Formal proof - the four color theorem
• OAEP Is Secure under Key-Dependent Messages
• Programming language techniques for cryptographic proofs
• Proofs of randomized algorithms in Coq
• Provable security for public key schemes
• RSA-OAEP is secure under the RSA assumption
• Strengthening Security of RSA-OAEP
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

Cited in

(5)

• Formal verification of Saber's public-key encryption scheme in easycrypt
• Automated proofs of block cipher modes of operation
• Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+}
• Verifiable security of Boneh-Franklin identity-based encryption
• Post-quantum verification of Fujisaki-Okamoto

Describes a project that uses

Uses Software

• kepler98
• seL4
• CertiCrypt
• Coq

This page was built for publication: Beyond provable security verifiable IND-CCA security of OAEP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073706)