Article

Analysing Unlinkability and Anonymity Using the Applied Pi Calculus

Authors:

Myrto Arapinis,

Tom Chothia,

Eike Ritter,

Mark RyanAuthors Info & Claims

CSF '10: Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium

Pages 107 - 121

https://doi.org/10.1109/CSF.2010.15

Published: 17 July 2010 Publication History

Publisher Site

Abstract

An attacker that can identify messages as coming from the same source, can use this information to build up a picture of targets’ behaviour, and so, threaten their privacy. In response to this danger, unlinkable protocols aim to make it impossible for a third party to identify two runs of a protocol as coming from the same device. We present a framework for analysing unlinkability and anonymity in the applied pi calculus. We show that unlinkability and anonymity are complementary properties; one does not imply the other. Using our framework we show that the French RFID e-passport preserves anonymity but it is linkable therefore anyone carrying a French e-passport can be physically traced.

Cited By

View all

Braun CHorne RKäfer TMauw SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)SSI, from Specifications to Protocol? Formally Verify Security!Proceedings of the ACM Web Conference 202410.1145/3589334.3645426(1620-1631)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645426
Horne RMauw SYurkov S(2023)When privacy fails, a formula describes an attackTheoretical Computer Science10.1016/j.tcs.2023.113842959:COnline publication date: 30-May-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113842
Chrétien RCortier VDallon ADelaune S(2019)Typing Messages for Free in Security ProtocolsACM Transactions on Computational Logic10.1145/334350721:1(1-52)Online publication date: 12-Sep-2019
https://dl.acm.org/doi/10.1145/3343507
Show More Cited By

Recommendations

Verifying Anonymous Credential Systems in Applied Pi Calculus
CANS '09: Proceedings of the 8th International Conference on Cryptology and Network Security

Anonymous credentials are widely used to certify properties of a credential owner or to support the owner to demand valuable services, while hiding the user's identity at the same time. A credential system (a.k.a. pseudonym system) usually consists of ...
Anonymity protocol with identity escrow and analysis in the applied π-calculus
TGC'07: Proceedings of the 3rd conference on Trustworthy global computing

Anonymity with identity escrow attempts to allow users of a service to remain anonymous, while providing the possibility that the service owner can break the anonymity if the service is misused. We introduce a new protocol in which the user's identity ...
k-Unlinkability: A privacy protection model for distributed data

In the past, data holders protected the privacy of their constituents by issuing separate disclosures of sensitive (e.g., DNA) and identifying data (e.g., names). However, individuals visit many places and their location-visit patterns, or ''trails'', ...

Comments

Information & Contributors

Information

Published In

CSF '10: Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium

July 2010

333 pages

ISBN:9780769540825

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 July 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Braun CHorne RKäfer TMauw SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)SSI, from Specifications to Protocol? Formally Verify Security!Proceedings of the ACM Web Conference 202410.1145/3589334.3645426(1620-1631)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645426
Horne RMauw SYurkov S(2023)When privacy fails, a formula describes an attackTheoretical Computer Science10.1016/j.tcs.2023.113842959:COnline publication date: 30-May-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113842
Chrétien RCortier VDallon ADelaune S(2019)Typing Messages for Free in Security ProtocolsACM Transactions on Computational Logic10.1145/334350721:1(1-52)Online publication date: 12-Sep-2019
https://dl.acm.org/doi/10.1145/3343507
Cortier VGrimm NLallemand JMaffei MThuraisingham BEvans DMalkin TXu D(2017)A Type System for Privacy PropertiesProceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security10.1145/3133956.3133998(409-423)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.1145/3133956.3133998
Yan GRawat DLindsey W(2017)A Cross-Layer and Optimized Privacy Method in Vehicular Ad-Hoc NetworksWireless Personal Communications: An International Journal10.1007/s11277-017-4599-z97:3(3331-3353)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s11277-017-4599-z
Arapinis MMancini LRitter ERyan M(2017)Analysis of privacy in mobile telephony systemsInternational Journal of Information Security10.1007/s10207-016-0338-916:5(491-523)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s10207-016-0338-9
Babel KCheval VKremer S(2017)On Communication Models When Verifying Equivalence PropertiesProceedings of the 6th International Conference on Principles of Security and Trust - Volume 1020410.1007/978-3-662-54455-6_7(141-163)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54455-6_7
Cortier VDallon ADelaune S(2016)Bounding the Number of Agents, forźEquivalence TooProceedings of the 5th International Conference on Principles of Security and Trust - Volume 963510.5555/3089491.3089505(211-232)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.5555/3089491.3089505
Zuberi RAhmad S(2016)Secure Mix-Zones for Privacy Protection of Road Network Location Based Services UsersJournal of Computer Networks and Communications10.1155/2016/38215932016Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1155/2016/3821593
Chadha RCheval VCiobâcă ŞKremer S(2016)Automated Verification of Equivalence Properties of Cryptographic ProtocolsACM Transactions on Computational Logic10.1145/292671517:4(1-32)Online publication date: 20-Sep-2016
https://dl.acm.org/doi/10.1145/2926715
Show More Cited By

Abstract

Cited By

Recommendations

Verifying Anonymous Credential Systems in Applied Pi Calculus

Anonymity protocol with identity escrow and analysis in the applied π-calculus

k-Unlinkability: A privacy protection model for distributed data

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations