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

03/01/2019
by   Jaouhar Fattahi, et al.
0

In this paper, we show how practical the little theorem of witness functions is in detecting security flaws in some category of cryptographic protocols. We convey a formal analysis of the Needham-Schroeder symmetric-key protocol in the theory of witness functions. We show how it helps to teach about a security vulnerability in a given step of this protocol where the value of security of a particular sensitive ticket in a sent message unexpectedly plummets compared with its value when received. This vulnerability may be exploited by an intruder to mount a replay attack as described by Denning and Sacco.

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
04/26/2023

A Security Verification Framework of Cryptographic Protocols Using Machine Learning

We propose a security verification framework for cryptographic protocols...
research
07/05/2018

FocusST Solution for Analysis of Cryptographic Properties

To analyse cryptographic properties of distributed systems in a systemat...
research
02/20/2019

Misbinding Attacks on Secure Device Pairing

In identity misbinding attacks against authenticated key-exchange protoc...
research
02/13/2021

Risk Framework for Bitcoin Custody Operation with the Revault Protocol

Our contributions with this paper are twofold. First, we elucidate the m...
research
04/19/2018

Homomorphisms and Minimality for Enrich-by-Need Security Analysis

Cryptographic protocols are used in different environments, but existing...
research
03/14/2018

The Hsu-Harn-Mu-Zhang-Zhu group key establishment protocol is insecure

A significant security vulnerability in a recently published group key e...

Please sign up or login with your details

Forgot password? Click here to reset