19th IEEE Computer Security Foundations Workshop (CSFW'06)
Refuting Security Proofs for Tripartite Key Exchange with Model Checker in Planning Problem Setting
Venice, Italy
July 05-July 07
ISBN: 0-7695-2615-2
DOI Bookmark:
http://doi.ieeecomputersociety.org/10.1109/CSFW.2006.26
We encode a simplified version of the Canetti and Krawczyk (2001) formalism using Asynchronous Product Automata (APA). We then use a model checker tool, Simple Homomorphism Verification Tool (SHVT), to perform statespace analysis on our Automata in the setting of planning problem. As a case study, we revisit two tripartite key exchange protocols of Hitchcock, Boyd, and Gonz?alez Nieto (2004), which carry claimed security proofs in the Canetti and Krawczyk (2001) model. We refute their proofs of security by pointing out previously unpublished flaws in the protocols using SHVT. We then point out corresponding flaws in the refuted proofs.
Citation:
Kim-Kwang Raymond Choo, "Refuting Security Proofs for Tripartite Key Exchange with Model Checker in Planning Problem Setting," csfw, pp.297-308, 19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006
Usage of this product signifies your acceptance of the
Terms of Use.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||