From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
Cryptography and Security
2008-12-18 v1 Artificial Intelligence
Logic in Computer Science
Abstract
A 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.
Cite
@article{arxiv.0804.2155,
title = {From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic},
author = {Joseph Y. Halpern},
journal= {arXiv preprint arXiv:0804.2155},
year = {2008}
}