A Probabilistic Logic for Concrete Security - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2024

A Probabilistic Logic for Concrete Security

David Baelde
  • Function : Author
  • PersonId : 1135652
Caroline Fontaine
Adrien Koutsos
Guillaume Scerri
Théo Vignon
  • Function : Author
  • PersonId : 1383265

Abstract

The Squirrel Prover is a proof assistant designed for the computational verification of cryptographic protocols. It implements a probabilistic logic that captures cryptographic and probabilistic arguments used in security proofs. This logic operates in the asymptotic security setting, which limits the expressiveness of formulas and proofs. As a consequence, it can only prove security for finite interactions with a protocol, falling outside of the polynomial-level of security usually expected by cryptographers. We lift all these limitations by moving to a concrete security setting. We extend the logic with concrete security predicates, and design a corresponding proof system. We show the usefulness of these extensions on a case study, and through a novel proof-transformation result which shows that a large class of asymptotic logic security proofs can be automatically rewritten into concrete logic security proofs, improving security bounds exponentially.
Fichier principal
Vignette du fichier
main.pdf (672.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Licence

Dates and versions

hal-04577828 , version 1 (16-05-2024)

Licence

Identifiers

  • HAL Id : hal-04577828 , version 1

Cite

David Baelde, Caroline Fontaine, Adrien Koutsos, Guillaume Scerri, Théo Vignon. A Probabilistic Logic for Concrete Security. CSF 2024 - 37th IEEE Computer Security Foundations Symposium, Jul 2024, Enschede, Netherlands. ⟨hal-04577828⟩
133 View
75 Download

Share

More