2014
DOI: 10.1007/978-3-662-44584-6_26
|View full text |Cite
|
Sign up to set email alerts
|

Typing Messages for Free in Security Protocols: The Case of Equivalence Properties

Abstract: Privacy properties such as untraceability, vote secrecy, or anonymity are typically expressed as behavioural equivalence in a process algebra that models security protocols. In this paper, we study how to decide one particular relation, namely trace equivalence, for an unbounded number of sessions. Our first main contribution is to reduce the search space for attacks. Specifically, we show that if there is an attack then there is one that is well-typed. Our result holds for a large class of typing systems and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
21
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 9 publications
(22 citation statements)
references
References 25 publications
1
21
0
Order By: Relevance
“…However, this bound is far from being practical. In this section, we show that the small attack property of [19] still holds even if our semantics has slightly changed (due to eager evaluation) and we further demonstrate that the number of constants can be significantly reduced since only three constants need to be considered (and no nonces), in addition to those explicitly mentioned in the protocol.…”
Section: Reduction Resultsmentioning
confidence: 71%
See 4 more Smart Citations
“…However, this bound is far from being practical. In this section, we show that the small attack property of [19] still holds even if our semantics has slightly changed (due to eager evaluation) and we further demonstrate that the number of constants can be significantly reduced since only three constants need to be considered (and no nonces), in addition to those explicitly mentioned in the protocol.…”
Section: Reduction Resultsmentioning
confidence: 71%
“…Recently, [19] has established how to reduced the search space for attacks by bounding the size of messages involved in a minimal attack. From a theoretical point of view, this also yields a bound on the number of nonces/constants involved in such a minimal attack.…”
Section: Reduction Resultsmentioning
confidence: 99%
See 3 more Smart Citations