DeepSec: Deciding Equivalence Properties for Security Protocols -- Improved theory and practice
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916347431092224 |
|---|---|
| author | Cheval, Vincent Kremer, Steve Rakotonirina, Itsaka |
| author_facet | Cheval, Vincent Kremer, Steve Rakotonirina, Itsaka |
| contents | Automated verification has become an essential part in the security evaluation of cryptographic protocols. In this context privacy-type properties are often modelled by indistinguishability statements, expressed as behavioural equivalences in a process calculus. In this paper we contribute both to the theory and practice of this verification problem. We establish new complexity results for static equivalence, trace equivalence and labelled bisimilarity and provide a decision procedure for these equivalences in the case of a bounded number of protocol sessions. Our procedure is the first to decide trace equivalence and labelled bisimilarity exactly for a large variety of cryptographic primitives -- those that can be represented by a subterm convergent destructor rewrite system. We also implemented the procedure in a new tool, DeepSec. We showed through extensive experiments that it is significantly more efficient than other similar tools, while at the same time raises the scope of the protocols that can be analysed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_03225 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | DeepSec: Deciding Equivalence Properties for Security Protocols -- Improved theory and practice Cheval, Vincent Kremer, Steve Rakotonirina, Itsaka Cryptography and Security C.2.2; D.2.4; F.3.1 Automated verification has become an essential part in the security evaluation of cryptographic protocols. In this context privacy-type properties are often modelled by indistinguishability statements, expressed as behavioural equivalences in a process calculus. In this paper we contribute both to the theory and practice of this verification problem. We establish new complexity results for static equivalence, trace equivalence and labelled bisimilarity and provide a decision procedure for these equivalences in the case of a bounded number of protocol sessions. Our procedure is the first to decide trace equivalence and labelled bisimilarity exactly for a large variety of cryptographic primitives -- those that can be represented by a subterm convergent destructor rewrite system. We also implemented the procedure in a new tool, DeepSec. We showed through extensive experiments that it is significantly more efficient than other similar tools, while at the same time raises the scope of the protocols that can be analysed. |
| title | DeepSec: Deciding Equivalence Properties for Security Protocols -- Improved theory and practice |
| topic | Cryptography and Security C.2.2; D.2.4; F.3.1 |
| url | https://arxiv.org/abs/2211.03225 |