The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
A simple LP-free approximation algorithm for the minimum weight vertex cover problem
Information Processing Letters
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Anonymity, unobservability, and pseudeonymity — a proposal for terminology
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Mix Zones: User Privacy in Location-aware Services
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
The familiar stranger: anxiety, comfort, and play in public places
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Vehicle-to-vehicle safety messaging in DSRC
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
The minimum generalized vertex cover problem
ACM Transactions on Algorithms (TALG)
Swing & swap: user-centric approaches towards maximizing location privacy
Proceedings of the 5th ACM workshop on Privacy in electronic society
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Micro-Blog: sharing and querying content through mobile phones and social participation
Proceedings of the 6th international conference on Mobile systems, applications, and services
On the Anonymity of Home/Work Location Pairs
Pervasive '09 Proceedings of the 7th International Conference on Pervasive Computing
PeerSoN: P2P social networking: early experiences and insights
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
On the Optimal Placement of Mix Zones
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
A distortion-based metric for location privacy
Proceedings of the 8th ACM workshop on Privacy in the electronic society
On the effectiveness of changing pseudonyms to provide location privacy in VANETS
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Security Games for Vehicular Networks
IEEE Transactions on Mobile Computing
Tracking games in mobile networks
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
MobiMix: Protecting location privacy with mix-zones over road networks
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Impact of pseudonym changes on geographic routing in VANETs
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Towards modeling wireless location privacy
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Evaluating the privacy risk of location-based services
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Big brother knows your friends: on privacy of social communities in pervasive networks
Pervasive'12 Proceedings of the 10th international conference on Pervasive Computing
Hi-index | 0.00 |
One major concern in pervasive wireless applications is location privacy, where malicious eavesdroppers, based on static device identifiers, can continuously track users. As a commonly adopted countermeasure to prevent such identifier-based tracking, devices regularly and simultaneously change their identifiers in special areas called mixzones. Although mix-zones provide spatio-temporal de-correlations between old and new identifiers, pseudonym changes, depending on the position of the mix-zone, can incur a substantial cost on the network due to lost communications and additional resources such as energy. In this paper, we address this trade-off by studying the problem of determining an optimal set of mix-zones such that the degree of mixing in the network is maximized, whereas the overall network-wide mixing cost is minimized. We follow a graph-theoretic approach and model the optimal mixing problem as a novel generalization of the vertex cover problem, called the Mix Cover (MC) problem. We propose three bounded-ratio approximation algorithms for the MC problem and validate them by an empirical evaluation of their performance on real data. The combinatorics-based approach followed here enables us to study the feasibility of determining optimal mix-zones regularly and under dynamic network conditions.