Automated proofs for asymmetric encryption
From MaRDI portal
Publication:540682
DOI10.1007/S10817-010-9186-XzbMATH Open1213.94094OpenAlexW2072824406WikidataQ121186469 ScholiaQ121186469MaRDI QIDQ540682FDOQ540682
Authors: Judicaël Courant, M. Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech 
Publication date: 3 June 2011
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-010-9186-x
Recommendations
Cites Work
- Formal certification of code-based cryptographic proofs
- New directions in cryptography
- Title not available (Why is that?)
- Automated Security Proofs with Sequences of Games
- Zero-knowledge proofs of identity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- OAEP reconsidered
- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
- Title not available (Why is that?)
- Automated Reasoning
- Types for Proofs and Programs
Cited In (8)
- Automated proofs of block cipher modes of operation
- Automated proofs for asymmetric encryption
- Automated Security Proofs with Sequences of Games
- A Calculus for Game-Based Security Proofs
- Automated security proof for symmetric encryption modes
- Beyond provable security verifiable IND-CCA security of OAEP
- Automated verification of block cipher modes of operation, an improved method
- Automating Computational Proofs for Public-Key-Based Key Exchange
This page was built for publication: Automated proofs for asymmetric encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540682)
