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

03/21/2018
by   Jaouhar Fattahi, et al.
0

In this paper, we enunciate the theorem of secrecy in tagged protocols using the theory of witness-functions and we run a formal analysis on a new tagged version of the Needham-Schroeder public-key protocol using this theorem. We discuss the significance of tagging in securing cryptographic protocols as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2018

Secrecy by Witness-Functions on Increasing Protocols

In this paper, we present a new formal method to analyze cryptographic p...
research
03/01/2019

On the Security of Cryptographic Protocols Using the Little Theorem of Witness Functions

In this paper, we show how practical the little theorem of witness funct...
research
03/14/2019

Authentication by Witness Functions

Witness functions have recently been introduced in cryptographic protoco...
research
10/18/2019

Universal Composability is Secure Compilation

Universal composability is a framework for the specification and analysi...
research
08/28/2023

CryptoBap: A Binary Analysis Platform for Cryptographic Protocols

We introduce CryptoBap, a platform to verify weak secrecy and authentica...
research
01/15/2018

DKVF: A Framework for Rapid Prototyping and Evaluating Distributed Key-value Stores

We present our framework DKVF that enables one to quickly prototype and ...
research
01/05/2018

Secrecy by Witness-Functions under Equational Theories

In this paper, we use the witness-functions to analyze cryptographic pro...

Please sign up or login with your details

Forgot password? Click here to reset