SMT-based Automation for Overwhelming Truth - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2025

SMT-based Automation for Overwhelming Truth

Résumé

Cryptographers are interested in showing that facts hold with overwhelming probability, i.e., a probability that grows fast enough to 1 wrt. some security parameter. It is thus natural to consider a formal logic where terms and formulas are interpreted as random variables, with a notion of validity based on overwhelming truth. In such a setting, one can postulate e.g. an axiom stating that the hash of two distinct adversarial terms do not collide, even though there is actually a negligible probability that an attacker finds such a collision. This results in a logic that is both fully formal and allows easy reasoning. However, the non-standard semantics of the logic makes it nontrivial to use common automation techniques. In this work, we show that it is actually possible to use classical reasoning tools, and more specifically SMT solvers. We develop this approach in practice in the setting of the Squirrel proof assistant, designing efficient encodings that leverage standard theories. We present benchmarks comparing our approach to existing automated reasoning techniques in Squirrel, and show how the new SMTbased tactics enable much shorter proof scripts.

Fichier principal
Vignette du fichier
main.pdf (2.18 Mo) Télécharger le fichier
supplementary_material.tar.gz (61.98 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04884758 , version 1 (13-01-2025)

Licence

Identifiants

  • HAL Id : hal-04884758 , version 1

Citer

David Baelde, Stéphanie Delaune, Stanislas Riou. SMT-based Automation for Overwhelming Truth. 38th IEEE Computer Security Foundations Symposium, Owen Arden and Mohsen Lesani, Jun 2025, Santa Cruz, United States. ⟨hal-04884758⟩
0 Consultations
0 Téléchargements

Partager

More