A Symbolic Logic with Concrete Bounds for Cryptographic Protocols
CoRR, Volume abs/1511.07536, 2015.
We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on t...More
PPT (Upload PPT)