A randomized protocol for signing contracts
Communications of the ACM
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Extending cryptographic logics of belief to key agreement protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Reasoning about knowledge
A critique of the Burrows, Abadi and Needham logic
ACM SIGOPS Operating Systems Review
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Formal Semantics for Authentication Logics
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
On BAN Logics for Industrial Security Protocols
CEEMAS '01 Revised Papers from the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems: From Theory to Practice in Multi-Agent Systems
C3PO: A Tool for Automatic Sound Cryptographic Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Authentication: a practical study in belief and action
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
L-PEP: a logic to reason about privacy-enhancing cryptography protocols
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
Hi-index | 0.00 |
BAN logic, an epistemic logic for analyzing security protocols, contains an unjustifiable inference rule. The inference rule assumes that possession of H(X) (i.e., the cryptographic hash value of X) counts as a proof of possession of X, which is not the case. As a result, BAN logic exhibits a problematic property, which is similar to unsoundness, but not strictly equivalent to it. We will call this property `unsoundness' (with quotes). The property is demonstrated using a specially crafted protocol, the two parrots protocol. The `unsoundness' is proven using the partial semantics which is given for BAN logic. Because of the questionable character of the semantics of BAN logic, we also provide an alternative proof of `unsoundness' which we consider more important.