Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
First-order conditional logic for default reasoning revisited
ACM Transactions on Computational Logic (TOCL)
Intercepting mobile communications: the insecurity of 802.11
Proceedings of the 7th annual international conference on Mobile computing and networking
Plausibility measures and default reasoning
Journal of the ACM (JACM)
A Maximum Entropy Approach to Nonmonotonic Reasoning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic polynomial-time semantics for a protocol security logic
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computational indistinguishability logic
Proceedings of the 17th ACM conference on Computer and communications security
| Hi-index | 0.01 |
A first-order conditional logic is considered, with semantics given by a variant of Ε-semantics (Adams 1975; Goldszmidt & Pearl 1992), where Φ→ψ means that Pr(ψ | Φ) 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.