Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs

DOI10.1007/978-3-642-31113-0_1zbMATH Open1358.94059OpenAlexW179514658MaRDI QIDQ2908554FDOQ2908554

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

Publication date: 5 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00765864/file/main.pdf

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cited In (4)

• A relation-algebraic approach to the ``Hoare logic of functional dependencies
• On counting propositional logic and Wagner's hierarchy
• Probabilistic relational verification for cryptographic implementations
• Title not available (Why is that?)

Uses Software

• EasyCrypt

This page was built for publication: Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs

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