The Security Protocol Verifier ProVerif and its Horn Clause Resolution Algorithm

11/22/2022
by   Bruno Blanchet, et al.
0

ProVerif is a widely used security protocol verifier. Internally, ProVerif uses an abstract representation of the protocol by Horn clauses and a resolution algorithm on these clauses, in order to prove security properties of the protocol or to find attacks. In this paper, we present an overview of ProVerif and discuss some specificities of its resolution algorithm, related to the particular application domain and the particular clauses that ProVerif generates. This paper is a short summary that gives pointers to publications on ProVerif in which the reader will find more details.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

Formal Modelling and Security Analysis of Bitcoin's Payment Protocol

The Payment Protocol standard BIP70, specifying how payments in Bitcoin ...
research
12/03/2017

Analiza bezbednosnih mehanizama OSPF protokola

The security of the service and the system depends on the security of ea...
research
07/03/2019

Towards a formally verified implementation of the MimbleWimble cryptocurrency protocol

MimbleWimble is a privacy-oriented cryptocurrency technology encompassin...
research
03/03/2018

Security issues in a group key establishment protocol

Major shortcomings in a recently published group key establishment proto...
research
05/12/2017

TraX: The visual Tracking eXchange Protocol and Library

In this paper we address the problem of developing on-line visual tracki...
research
06/30/2023

A Quic(k) Security Overview: A Literature Research on Implemented Security Recommendations

Built on top of UDP, the relatively new QUIC protocol serves as the base...
research
09/14/2021

QKD parameter estimation by two-universal hashing leads to faster convergence to the asymptotic rate

This paper proposes and proves security of a QKD protocol which uses two...

Please sign up or login with your details

Forgot password? Click here to reset