Dekker, Anthony H., C3PO: a Tool for Automatic Sound Cryptographic Protocol Analysis, Proceedings of 13th IEEE Computer Security Foundations Workshop, Cambridge, England, July 3--5, 2000. Available electronically at http://www.acm.org/~dekker/c3po.pdf. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Category-Theoretic Approach to Social Network Analysis - Dekker (2001) (Correct)
....(ii) N = p # q if and only if p #N q. Proof. By definition 2.4, proposition 3.1, and and closure or closure of link sets. # In other words, we really have extended the definition of p #N q. We incorporate the notion of belief about networks by using Kripke (possible worlds) semantics [2,5,6,11,13]. Each person or entity P is associated with a predicate p such that for a network N , P believes the network is actually N # p, i.e. the functor # p acts as an accessibility relation between possible worlds which is transitive (by proposition 3.2, therefore corresponding to doxastic or K4 ....
....will introduce more complex models of belief, using the same categorytheoretic framework. We intend to implement logical analysis of belief as we have outlined it here within our CAVALIER tool, in the same way that in previous work we have automated belief logic for cryptographic protocol analysis [5]. Our goal in doing this is to provide practical assistance to military commanders assembling coalition forces, and also to analyse coalition forces assembled by other countries. 8 Acknowledgements The author is indebted to Dawn Hayter and Jon Rigter for useful discussions on military ....
Dekker, Anthony H., C3PO: a Tool for Automatic Sound Cryptographic Protocol Analysis, Proceedings of 13th IEEE Computer Security Foundations Workshop, Cambridge, England, July 3--5, 2000. Available electronically at http://www.acm.org/~dekker/c3po.pdf.
The Logic of Authentication Protocols - Syverson, Cervesato (2001) (8 citations) (Correct)
....this can be formalized. But a rigorous formalization makes for a very complicated logic and some of the intuitiveness of SVO is lost. Nonetheless, it may be desirable if the intent is to automate as much of the reasoning as possible. Instances of such a formalization can be found in [WK96,Dek00] P14. S believes S received (A; B; hnA i s ) P15. A believes A received fnA ; B; hk AB i A ; hfk AB ; Ag kBS i A g kAS P16. B believes B received fhk AB i B ; Ag kBS P17. A believes A received fhnB i A from Bg hkAB i A P18. B believes B received fnB 1g hkAB i B NSSK Interpretation ....
....may be unfamiliar or not decryptable by the principal. In fact, the WK notation for not understood messages motivated the notation given above in Section 3, although the use by Wedel and Kessler is not exactly the same. Another automated tool in the BAN family is the recent C3PO of Anthony Dekker [Dek00] This is a GUI tool based on the Isabelle theorem prover. The logic associated with this tool is called SVD , and, like WK, it is a variant on SVO. Neither of these has the published track record of analyses of Brackin s work, however. A di erent approach to automation that again combines ....
Anthony H. Dekker. C3po: a tool for automatic sound cryptographic protocol analysis. In 13th IEEE Computer Security Foundations Workshop, pages 77-87. IEEE CS Press, June 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC