A simple unpredictable pseudo random number generator
SIAM Journal on Computing
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Source-location privacy in energy-constrained sensor network routing
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Unleashing public-key cryptography in wireless sensor networks
Journal of Computer Security - On IWAP'05
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Efficient anonymity schemes for clustered wireless sensor networks
International Journal of Sensor Networks
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Hi-index | 0.00 |
By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. We propose an effective way to measure how well issuing a disperse set of k queries protects the user's area of interest. However, issuing k queries instead of one facilitates the adversary determining the user's location. To address that issue, we define a quantitative measure of how much information the k queries leak about the user's location. Experiments reveal that how dispersed the k queries are has no effect on the privacy of the user's location. However, smaller k , randomized routing, and non-broadcast transmission improve the user's location privacy. We also show that compromising nodes in the user's network yields no significant advantage to the adversary over an eavesdropping strategy.