A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Modeling and Verifying Ad Hoc Routing Protocols
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
Formal Verification of Privacy for RFID Systems
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Analysing routing protocols: four nodes topologies are sufficient
POST'12 Proceedings of the First international conference on Principles of Security and Trust
| Hi-index | 0.00 |
Routing protocols aim at establishing a route between distant nodes in ad hoc networks. Secured versions of routing protocols have been proposed to provide more guarantees on the resulting routes, and some of them have been designed to protect the privacy of the users. In this paper, we propose a framework for analysing privacy-type properties for routing protocols. We use a variant of the applied-pi calculus as our basic modelling formalism. More precisely, using the notion of equivalence between traces, we formalise three security properties related to privacy, namely indistinguishability, unlinkability, and anonymity. We study the relationship between these definitions and we illustrate them using two versions of the ANODR routing protocol.