A class of theory-decidable inference systems

Authors: Gagnon, François
Advisor: Mejri, Mohamed
Abstract: In the last two decades, Internet brought a new dimension to communications. It is now possible to communicate with anyone, anywhere at anytime in few seconds. While some distributed communications, like e-mail, chat, . . . , are rather informal and require no security at all, others, like military or medical information exchange, electronic-commerce, . . . , are highly formal and require a quite strong security. To achieve security goals in distributed communications, it is common to use cryptographic protocols. However, the informal design and analysis of such protocols are error-prone. Some protocols were shown to be deficient many years after their conception. It is now well known that formal methods are the only hope of designing completely secure cryptographic protocols. This thesis is a contribution in the field of cryptographic protocols analysis in the following way: • A classification of the formal methods used in cryptographic protocols analysis. • The use of inference systems to model cryptographic protocols. • The definition of a class of theory-decidable inference systems. • The proposition of a decision procedure for a wide class of cryptographic protocols.
Document Type: Mémoire de maîtrise
Issue Date: 2005
Open Access Date: 12 April 2018
Permalink: http://hdl.handle.net/20.500.11794/19426
Grantor: Université Laval
Collection:Thèses et mémoires

Files in this item:
22448.pdf1.41 MBAdobe PDFView/Open
All documents in CorpusUL are protected by Copyright Act of Canada.