Balancing authentication and location privacy in cooperative authentication

Authors:
Liu Licai;Guo Yunchuan;Yin Lihua;Sun Yan
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, China;Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China;Beijing University of Posts and Telecommunications, Beijing, China
Venue:
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Year:
2013

Citing 3
Cited 0

Quantifying Location Privacy

SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In MANET, the cooperative authentication mechanism requires the cooperation of the neighbor nodes and significantly enhances the authentication probability. However, it exposes location privacy of neighbor nodes and is costly. How to balance the authentication and location privacy is a key issue. In this paper, we use game theory to analyze the behavior of neighbor nodes in cooperative authentication and gain the optimal strategy. Every node seeks to obtain most reward at least location privacy loss and cost. We first build the static game with complete information and obtain two pure-strategy and one mixed-strategy Nash equilibria. These equilibria can be used efficiently to balance authentication and location privacy. Then, we build the static game with incomplete information and obtain the Bayesian Nash equilibria.