SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq

Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Joaquim S Van Muylder, Théo Winterhalter, Cătălin Hrițcu, Kenji Maillard, Bas Spitters

Research output: Chapter in Book/Report/Conference proceedingConference paper

Abstract

State-separating proofs (SSP) is a recent methodology for structuring game-based cryptographic proofs in a modular way. While very promising, this methodology was previously not fully formalized and came with little tool support. We address this by introducing SSProve, the first general verification framework for machine-checked state-separating proofs. SSProve combines high-level modular proofs about composed protocols, as proposed in SSP, with a probabilistic relational program logic for formalizing the lower-level details, which together enable constructing fully machine-checked crypto proofs in the Coq proof assistant. Moreover, SSProve is itself formalized in Coq, including the algebraic laws of SSP, the soundness of the program logic, and the connection between these two verification styles.
Original languageEnglish
Title of host publication2021 IEEE 34th Computer Security Foundations Symposium (CSF)
PublisherIEEE Computer Society
Pages608-622
Volume1
DOIs
Publication statusPublished - 2021
Event2021 IEEE 34th Computer Security Foundations Symposium (CSF) -
Duration: 21 Jun 2021 → …

Conference

Conference2021 IEEE 34th Computer Security Foundations Symposium (CSF)
Abbreviated titleCSF 2021
Period21/06/21 → …

Fingerprint

Dive into the research topics of 'SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq'. Together they form a unique fingerprint.

Cite this