Computer Science – Cryptography and Security
Scientific paper
2008-04-14
Computer Science
Cryptography and Security
Scientific paper
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.
No associations
LandOfFree
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-71485