TY - GEN
T1 - Towards statistically strong source anonymity for sensor networks
AU - Shao, Min
AU - Yang, Yi
AU - Zhu, Sencun
AU - Cao, Guohong
PY - 2008
Y1 - 2008
N2 - For sensor networks deployed to monitor and report real events, event source anonymity is an attractive and critical security property, which unfortunately is also very difficult and expensive to achieve. This is not only because adversaries may attack against sensor source privacy through traffic analysis, but also because sensor networks are very limited in resources. As such, a practical tradeoff between security and performance is desirable. In this paper, for the first time we propose the notion of statistically strong source anonymity, under a challenging attack model where a global attacker is able to monitor the traffic in the entire network. We propose a scheme called FitProbRate, which realizes statistically strong source anonymity for sensor networks. We also demonstrate the robustness of our scheme under various statistical tests that might be employed by the attacker to detect real events. Our analysis and simulation results show that our scheme, besides providing source anonymity, can significantly reduce real event reporting latency compared to two baseline schemes.
AB - For sensor networks deployed to monitor and report real events, event source anonymity is an attractive and critical security property, which unfortunately is also very difficult and expensive to achieve. This is not only because adversaries may attack against sensor source privacy through traffic analysis, but also because sensor networks are very limited in resources. As such, a practical tradeoff between security and performance is desirable. In this paper, for the first time we propose the notion of statistically strong source anonymity, under a challenging attack model where a global attacker is able to monitor the traffic in the entire network. We propose a scheme called FitProbRate, which realizes statistically strong source anonymity for sensor networks. We also demonstrate the robustness of our scheme under various statistical tests that might be employed by the attacker to detect real events. Our analysis and simulation results show that our scheme, besides providing source anonymity, can significantly reduce real event reporting latency compared to two baseline schemes.
UR - http://www.scopus.com/inward/record.url?scp=51349086896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349086896&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2007.19
DO - 10.1109/INFOCOM.2007.19
M3 - Conference contribution
AN - SCOPUS:51349086896
SN - 9781424420261
T3 - Proceedings - IEEE INFOCOM
SP - 466
EP - 474
BT - INFOCOM 2008
T2 - INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
Y2 - 13 April 2008 through 18 April 2008
ER -