Automated proofs for asymmetric encryption

DOI10.1007/S10817-010-9186-XzbMath1213.94094OpenAlexW2072824406WikidataQ121186469 ScholiaQ121186469MaRDI QIDQ540682

J. Courant, M. Daubignard, Yassine Lakhneche, Pascal Lafourcade, Cristian Ene

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

zbMATH Keywords

Hoare logicautomated verificationprovable cryptographyasymmetric encryption

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

A Calculus for Game-Based Security Proofs ⋮ Automating Computational Proofs for Public-Key-Based Key Exchange ⋮ Beyond Provable Security Verifiable IND-CCA Security of OAEP

Cites Work

• Zero-knowledge proofs of identity
• OAEP reconsidered
• A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
• New directions in cryptography
• Formal certification of code-based cryptographic proofs
• Automated Reasoning
• Automated Security Proofs with Sequences of Games
• Types for Proofs and Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automated proofs for asymmetric encryption