Secrecy by Witness-Functions on Increasing Protocols

01/11/2018
by   Jaouhar Fattahi, et al.
0

In this paper, we present a new formal method to analyze cryptographic protocols statically for the property of secrecy. It consists in inspecting the level of security of every component in the protocol and making sure that it does not diminish during its life cycle. If yes, it concludes that the protocol keeps its secret inputs. We analyze in this paper an amended version of the Woo-Lam protocol using this new method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions

In this paper, we enunciate the theorem of secrecy in tagged protocols u...
research
01/05/2018

Secrecy by Witness-Functions under Equational Theories

In this paper, we use the witness-functions to analyze cryptographic pro...
research
01/16/2018

Relaxed Conditions for Secrecy in a Role-Based Specification

In this paper, we look at the property of secrecy through the growth of ...
research
04/16/2018

Enrich-by-need Protocol Analysis for Diffie-Hellman (Extended Version)

Enrich-by-need protocol analysis is a style of symbolic protocol analysi...
research
04/28/2018

Towards Practical Implementation of Deep Random Secrecy

We have formerly introduced Deep Random Secrecy, a new cryptologic techn...
research
06/29/2019

Towards Forward Secure Internet Traffic

Forward Secrecy (FS) is a security property in key-exchange algorithms w...
research
05/13/2021

The Inductive Approach to Verifying Cryptographic Protocols

Informal arguments that cryptographic protocols are secure can be made r...

Please sign up or login with your details

Forgot password? Click here to reset