From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/212369A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is needed for reasoning about security protocols. A complete axiomatization is provided for this semantics, and it is shown how a qualitative proof of the correctness of a security protocol can be automatically converted to a quantitative proof appropriate for reasoning about concrete security.Cryptography and SecurityArtificial IntelligenceLogic in Computer ScienceD.4.6; I.2.3; I.2.4; F.4.1; K.6.5From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logictext