arXiv · 0804.2155
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
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.
Explore related subjects
Keep this discovery
Joseph Y. Halpern. 2008-04-14. From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic. https://arxiv.org/abs/0804.2155
Cite the original work for its findings. Save a collection to share your selection of sources.