A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties

Cortier, Véronique; Delaune, Stéphanie; Sundararajan, Vaishnavi

doi:10.1007/s10817-020-09582-9

Cited by 6 publications

(13 citation statements)

References 29 publications

(60 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• In [16], [21], the notion of typed protocols is relaxed to consider type-compliance, that intuitively requires that unifiable messages have the same type. While protocol agents may receive arbitrary messages, type-compliance ensures the existence of a well-typed witness when an attack exists.…”

Section: Related Work Several Results Have Studied This Questionmentioning

confidence: 99%

“…While protocol agents may receive arbitrary messages, type-compliance ensures the existence of a well-typed witness when an attack exists. In [16], [21], the notion of dependency graph is introduced with the aim to characterize how actions depend from the other ones. For protocols with an acyclic dependency graph, the number of sessions can be bounded and hence reachability and equivalence properties are decidable.…”

Section: Related Work Several Results Have Studied This Questionmentioning

confidence: 99%

“…However, they do not provide explicit bounds or the bounds are not practical. For example, [21] gives a bound of 10 19 sessions for the simple Denning-Sacco protocol and the bound is even larger for more complex protocols.…”

Section: Related Work Several Results Have Studied This Questionmentioning

confidence: 99%

See 2 more Smart Citations

A small bound on the number of sessions for security protocols

Cortier

Dallon

Delaune

2022

2022 IEEE 35th Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

Bounding the number of sessions is a long-standing problem in the context of security protocols. It is well known that even simple properties like secrecy are undecidable when an unbounded number of sessions is considered. Yet, attacks on existing protocols only require a few sessions.In this paper, we propose a sound algorithm that computes a sufficient set of scenarios that need to be considered to detect an attack. Our approach can be applied for both reachability and equivalence properties, for protocols with standard primitives that are type-compliant (unifiable messages have the same type). Moreover, when equivalence properties are considered, else branches are disallowed, and protocols are supposed to be simple (an attacker knows from which role and session a message comes from). Since this class remains undecidable, our algorithm may return an infinite set. However, our experiments show that on most basic protocols of the literature, our algorithm computes a small number of sessions (a dozen). As a consequence, tools for a bounded number of sessions like DeepSec can then be used to conclude that a protocol is secure for an unbounded number of sessions.

show abstract

Section: Related Work Several Results Have Studied This Questionmentioning

confidence: 99%

Section: Related Work Several Results Have Studied This Questionmentioning

confidence: 99%

See 1 more Smart Citation

A small bound on the number of sessions for security protocols

Cortier

Dallon

Delaune

2022

2022 IEEE 35th Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

show abstract

“…First work, which expounds a CP model based on Milner's approach, is [99AG]. Among other works related to this direction, it should be noted [00RS], [01AF], [05KR], [07ABF], [11RS], [16ABF], [16B], [17CW], [21CDS].…”

Section: An Overview Of Methods Of Modeling and Verification Of Crypt...mentioning

confidence: 99%

A Distributed Process Model of Cryptographic Protocols

Mironov

2021

Preprint

View full text Add to dashboard Cite

Cryptographic Protocols (CP) are distributed algorithms intended for secure communication in an insecure environment. They are used, for example, in electronic payments, electronic voting procedures, systems of confidential data processing, etc. Errors in CPs can bring to great financial and social damage, therefore it is necessary to use mathematical methods to substantiate the correctness and safety of CPs. In this paper, a distributed process model of CPs is presented, which allows one to formally describe CPs and their properties. It is shown how to solve the problems of verification of CPs on the base of this model.

show abstract

“…Without else branches there is still an attack. Some papers that analyse the BAC protocol drop the else branch [CDS20]. This is convenient since not all tools and methods handle else branches.…”

Section: 33mentioning

confidence: 99%

Discovering ePassport Vulnerabilities using Bisimilarity

Horne,

Mauw

2020

Preprint

View full text Add to dashboard Cite

We uncover privacy vulnerabilities in the ICAO 9303 standard implemented by ePassports worldwide. These vulnerabilities, confirmed by ICAO, enable an ePassport holder who recently passed through a checkpoint to be reidentified without openning their ePassport. This paper explains how bisimilarity was used to discover these vulnerabilities. In order to tackle such bisimilarity problems, we develop here a chain of methods for the applied π-calculus including a symbolic under approximation of bisimilarity, called open bisimilarity, and a modal logic, called classical FM, for describing and certifying attacks. Evidence is provided to argue for a new scheme for specifying such unlinkability problems that more accurately reflects the capabilities of an attacker.

show abstract

A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties

Cited by 6 publications

References 29 publications

A small bound on the number of sessions for security protocols

A small bound on the number of sessions for security protocols

A Distributed Process Model of Cryptographic Protocols

Discovering ePassport Vulnerabilities using Bisimilarity

Contact Info

Product

Resources

About