@inproceedings{ICTAC21,
author = {Horne, Ross and Mauw, Sjouke and Yurkov, Semen},
editor = {Cerone, Antonio and {\"O}lveczky, Peter Csaba},
title = {Compositional Analysis of Protocol Equivalence in the Applied \pi-Calculus Using Quasi-open Bisimilarity},
booktitle = {Theoretical Aspects of Computing -- ICTAC 2021},
year = {2021},
publisher = {Springer International Publishing},
address = {Cham},
doi = {10.1007/978-3-030-85315-0_14},
pages = {235--255},
abstract = {This paper shows that quasi-open bisimilarity is the coarsest bisimilarity congruence for the applied {\$}{\$}{\backslash}pi {\$}{\$}$\pi$-calculus. Furthermore, we show that this equivalence is suited to security and privacy problems expressed as an equivalence problem in the following senses: (1) being a bisimilarity is a safe choice since it does not miss attacks based on rich strategies; (2) being a congruence it enables a compositional approach to proving certain equivalence problems such as unlinkability; and (3) being the coarsest such bisimilarity congruence it can establish proofs of some privacy properties where finer equivalences fail to do so.},
isbn = {978-3-030-85315-0}
}