✦ LIBER ✦

Verification of cryptographic protocols: tagging enforces termination

✍ Scribed by Bruno Blanchet; Andreas Podelski

Book ID: 108281007
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 305 KB
Volume: 333
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.10.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Practice of Cryptographic Protocol V

The Practice of Cryptographic Protocol Verification

✍ Michael Rusinowitch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 119 KB

We present CASRUL, a compiler for cryptographic protocols specifications. Its purpose is to verify the executability of protocols and to translate them into rewrite rules that can be used by several kinds of automatic or semi-automatic tools for finding design flaws. We also present a related comple

On the Verification of Cryptographic Pro

On the Verification of Cryptographic Protocols: A Tale of Two Committees

✍ Dieter Gollmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 660 KB

A game-theoretic framework for specifica

A game-theoretic framework for specification and verification of cryptographic protocols

✍ Mohamed Saleh; Mourad Debbabi 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 385 KB

Symbolic reachability analysis using nar

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

✍ José Meseguer; Prasanna Thati 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 536 KB

Symbolic Reachability Analysis Using Nar

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

✍ José Meseguer; Prasanna Thati 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 522 KB