Article | REF: AF176 V1

Cryptographic protocols: analysis using formal methods

Author: Véronique CORTIER

Publication date: April 10, 2006

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

5. Results and limitations

5.1 Automatic analysis tools

In this formal framework, however, the preservation of secrecy by a protocol is an undecidable problem, i.e. it can be shown [5] that it is impossible to construct an algorithm which, given a protocol, answers whether it preserves the requested secrecy. The undecidability of this problem stems from the fact that many parameters are unbounded:

  • the number of agents is arbitrary;

  • the number of sessions is arbitrary;

  • at each stage, the number of possible actions is arbitrary, as the opponent can send any deducible message of his choice;

  • new arbitrary...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Results and limitations