Probabilistic couplings are the foundation for many probabilistic relational program logics
and arise when relating random sampling statements across two programs. In relational …

Developing secure distributed systems is difficult, and even harder when advanced
cryptography must be used to achieve security goals. Following prior work, we advocate …

Developing secure distributed systems is difficult, and even harder when advanced
cryptography must be used to achieve security goals. Following prior work, we advocate …

State-separating proofs (SSP) is a recent methodology for structuring game-based
cryptographic proofs in a modular way, by using algebraic laws to exploit the modular …

Proving the security of a Multiparty Computation (MPC) protocol is a difficult task. Under the
current simulation-based definition of MPC, a security proof consists of a simulator, which is …

Formal methods for guaranteeing that a protocol satisfies a cryptographic security definition
have advanced substantially, but such methods are still labor intensive and the need …

Abstract Machine-checked cryptography aims to reinforce confidence in the primitives and
protocols that underpin all digital security. However, machine-checked proof techniques …

Security analysis of composite protocols is a critical issue in the field of network security. In
complex network environments, the traditional approach of analyzing a single protocol …

Rigorous reasoning about implementations of software systems requires a detailed
mathematical model of the behavior of the programming language. However, real-world …

Abstract In 1985, Goldwasser, Micali, and Rackoff introduced a compelling new notion of a
proof, known as a proof of knowledge, in which a verifier interactively checks that a prover …