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

Simple item page
dc.creatorHalpern, Joseph Y.
dc.date2008-04-14
dc.date.accessioned2026-07-07T12:18:19Z
dc.date.available2026-07-07T12:18:19Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/0804.2155
dc.identifierhttp://arxiv.org/abs/0804.2155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212369
dc.subjectCryptography and Security
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectD.4.6; I.2.3; I.2.4; F.4.1; K.6.5
dc.titleFrom Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
dc.typetext

Files

Collections

arXiv