Pour suivre notre actualité, les rencontres d'auteurs, les ateliers, les coups de coeur... abonnez-vous à la newsletter de La Grande Ourse !




Verifpal user manual
Books on Demand
Date de publication
Nombre de pages
22,6 x 16 x 1 cm
372 g

Verifpal user manual

Books on Demand

Books On Demand


The security of cryptographic protocols remains as relevant as ever, with systems such as TLS and Signal being responsible for much of the Web's security guarantees. One main venue for the analysis and verification of these protocols has been automated analysis with formal verification tools, such as ProVerif, CryptoVerif and Tamarin. Indeed, these tools have led to confirming security guarantees (as well as finding attacks) in secure channel protocols, including TLS and Signal. However, formal verification in general has not managed to significantly attract a wider audience. Verifpal is new software for verifying the security of cryptographic protocols. Building upon contemporary research in symbolic formal verification, Verifpal's main aim is to appeal more to real-world practitioners, students and engineers without sacrificing comprehensive formal verification features. In order to achieve this, Verifpal introduces a new, intuitive language for modeling protocols that is much easier to write and understand than the languages employed by existing tools. At the same time, Verifpal is able to model protocols under an active attacker with unbounded sessions and fresh values, and supports queries for advanced security properties such as forward secrecy or key compromise impersonation. Verifpal has already been used to verify security properties for Signal, Scuttlebutt, TLS 1.3, Telegram and other protocols. It is a community-focused project, and available under a GPLv3 license. The Verifpal language is meant to illustrate protocols close to how one may describe them in an informal conversation, while still being precise and expressive enough for formal modeling. Verifpal reasons about the protocol model with explicit principals: Alice and Bob exist and have independent states. Easy to Understand Analysis Output When a contradiction is found for a query, the result is related in a readable format that ties the attack to a real-world scenario. This is done by using...
S'identifier pour envoyer des commentaires.