Abstract
We show how to automate fragments of the logical framework (α, β)-privacy which provides an alternative to bisimilarity-based and tracebased definitions of privacy goals for security protocols. We consider the so-called message-analysis problem, which is at the core of (α, β)-privacy: given a set of concrete messages and their structure, which models can the intruder rule out? While in general this problem is undecidable, we give a decision procedure for a standard class of algebraic theories.
Original language | English |
---|---|
Title of host publication | Proceedings of 17th International Workshop on Security and Trust Management |
Number of pages | 22 |
Publication date | 2021 |
Publication status | Published - 2021 |
Event | 17th International Workshop on Security and Trust Management - Virtual event, Darmstadt, Germany Duration: 8 Oct 2021 → 8 Oct 2021 Conference number: 17 https://www.nics.uma.es/stm2021/ |
Conference
Conference | 17th International Workshop on Security and Trust Management |
---|---|
Number | 17 |
Location | Virtual event |
Country/Territory | Germany |
City | Darmstadt |
Period | 08/10/2021 → 08/10/2021 |
Internet address |
Keywords
- Privacy
- Formal Methods
- Security protocols
- Automated verification