POR for Security Protocol Equivalences: Beyond Action-Determinism

04/10/2018
by   David Baelde, et al.
0

Formal methods have proved effective to automatically analyze protocols. Over the past years, much research has focused on verifying trace equivalence on protocols, which is notably used to model many interesting privacy properties, e.g., anonymity or unlinkability. Many tools for checking trace equivalence rely on a naive and expensive exploration of all interleavings of concurrent actions, which calls for partial-order reduction (POR) techniques. In this paper, we present the first POR technique for protocol equivalences that does not rely on an action-determinism assumption: we recast the trace equivalence problem as a reachability problem, to which persistent and sleep set techniques can be applied, and we show how to effectively apply these results in the context of symbolic executions. We report on a prototype implementation, improving the tool DeepSec.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/28/2017

A Type System for Privacy Properties (Technical Report)

Mature push button tools have emerged for checking trace properties (e.g...
10/22/2019

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

In model checking, partial-order reduction (POR) is an effective techniq...
01/12/2018

Symbolic Timed Observational Equivalence

Intruders can infer properties of a system by measuring the time it take...
05/06/2021

There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques

We present a bounded equivalence verification technique for higher-order...
12/31/2020

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

One of the most popular state-space reduction techniques for model check...
08/25/2022

Coarser Equivalences for Concurrent Program Runs

Trace theory is a framework for designing equivalence relations for conc...
10/20/2019

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report

Timed automata (TA) are a well-established formalism for discrete-state/...