26 citations · 59 across the 8 of their papers we have counts for
9 papers
POR for Security Protocol Equivalences: Beyond Action-Determinism
David Baelde, Stéphanie Delaune, Lucca Hirschi
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 notabl…
A method for unbounded verification of privacy-type properties
Lucca Hirschi, David Baelde, Stéphanie Delaune
In this paper, we consider the problem of verifying anonymity and unlinkability in the symbolic model, where protocols are represented as processes in a variant of the applied pi c…
A Reduced Semantics for Deciding Trace Equivalence
David Baelde, Stéphanie Delaune, Lucca Hirschi
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be de…
A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
Stéphanie Delaune, Lucca Hirschi
Cryptographic protocols aim at securing communications over insecure networks such as the Internet, where dishonest users may listen to communications and interfere with them. A se…
Partial Order Reduction for Security Protocols
David Baelde, Stéphanie Delaune, Lucca Hirschi
Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has…
Composing security protocols: from confidentiality to privacy
Myrto Arapinis, Vincent Cheval, Stéphanie Delaune
Security protocols are used in many of our daily-life applications, and our privacy largely depends on their design. Formal verification techniques have proved their usefulness to…
Dynamic Tags for Security Protocols
Myrto Arapinis, Stéphanie Delaune, Steve Kremer
The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to t…
A reduced semantics for deciding trace equivalence using constraint systems
David Baelde, Stéphanie Delaune, Lucca Hirschi
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be de…
YAPA: A generic tool for computing intruder knowledge
Mathieu Baudet, Véronique Cortier, Stéphanie Delaune
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages…