Computer-aided cryptography is an active area of research that develops and applies
formal, machine-checkable approaches to the design, analysis, and implementation of …

Given the central importance of designing secure protocols, providing solid mathematical
foundations and computer-assisted methods to attest for their correctness is becoming …

State-separating proofs (SSP) is a recent methodology for structuring game-based
cryptographic proofs in a modular way. While very promising, this methodology was …

We present a logic for reasoning about pairs of interactive quantum programs–quantum
relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoare …

We present a methodology for using the EasyCrypt proof assistant (originally designed for
mechanizing the generation of proofs of game-based security of cryptographic schemes and …

The standard definition of security for digital signatures-existential unforgeability-does not
ensure certain properties that protocol designers might expect. For example, in many …

We introduce eRHL, a program logic for reasoning about relational expectation properties of
pairs of probabilistic programs. eRHL is quantitative, ie, its pre-and post-conditions take …

Succinct Non-interactive Arguments of Knowledge (SNARKs) have seen interest and
development from the cryptographic community over recent years, and there are now …

In this paper we enhance the EasyCrypt proof assistant to reason about computational
complexity of adversaries. The key technical tool is a Hoare logic for reasoning about …

We propose the first framework for defining relational program logics for arbitrary monadic
effects. The framework is embedded within a relational dependent type theory and is highly …