For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Edinburgh

Return to search Previous output Next output
Output 48 of 401 in the submission
Output title

Analysing Unlinkability and Anonymity Using the Applied Pi Calculus

Type
E - Conference contribution
Name of conference/published proceedings
Computer Security Foundations Symposium (CSF), 2010 23rd IEEE
Volume number
-
Issue number
-
First page of article
107
ISSN of proceedings
-
Year of publication
2010
Number of additional authors
3
Additional information

<10>Originality: This paper proposes a framework for analysing privacy properties such as anonymity and unlinkability.

Significance: Privacy is an ever-increasing concern of our societies. The proposed methodology has been used for the analysis of widely deployed applications such as electronic passport and telecommunication protocols. The paper analyses the implementation of the electronic passport protocols by Morpho (Saphran group) for France, and shows an attack that makes bearers of French electronic passports trackable. Arapinis [CCS 2012] has also used this framework to uncover privacy vulnerabilities in 3G telecommunication networks.

Rigour: Paper accepted at the main conference on theory of computer security.

Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
14
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-