report · 1996
A Unified Cryptographic Protocol Logic
Paul Syverson, Paul C. van Oorschot
Cited by 81Abstract and details only
Abstract
Abstract : We present a logic for analyzing cryptographic protocols. This logic is based on a unification of four of its predecessors in the BAN family of logics, namely those given in [GNY90], [AT91], [vO93b], and BAN itself [BAN89]. The logic herein captures the desirable features of its predecessors and more; nonetheless, as a logic it is relatively simple and simple to use. We also present a model-theoretic semantics, and we prove soundness for the logic with respect to that semantics. We illustrate the logic by applying it to the Needham- Schroeder protocol, revealing that BAN analysis of it may lead to inappropriate conclusions in some settings. We also use the logic to analyze two key agreement protocols, examining an attack on one of them.
Cite this paper
Syverson, P., & van Oorschot, P. C. (1996). A Unified Cryptographic Protocol Logic. https://doi.org/10.21236/ada464967
Syverson, Paul, and Paul C. van Oorschot. “A Unified Cryptographic Protocol Logic.” 1996, https://doi.org/10.21236/ada464967.
Syverson, Paul, and Paul C. van Oorschot. 1996. “A Unified Cryptographic Protocol Logic.” https://doi.org/10.21236/ada464967.
Syverson, P. and van Oorschot, P.C. (1996) ‘A Unified Cryptographic Protocol Logic’. Available at: https://doi.org/10.21236/ada464967.
@article{syverson1996unified,
title = {{A Unified Cryptographic Protocol Logic}},
author = {Syverson, Paul and van Oorschot, Paul C.},
year = {1996},
doi = {10.21236/ada464967}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.