TY - JOUR
T1 - Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks
AU - Chen, Jing
AU - He, Kun
AU - Yuan, Quan
AU - Xue, Guoliang
AU - Du, Ruiying
AU - Wang, Lina
N1 - Funding Information:
This research was supported in part by US National Science Foundation grants 1421685, 1457262, the Key Laboratory of Aerospace Information Security and Trusted Computing, Fig. 11. Identification delay versus movement speed. Fig. 12. Identification delay versus percentages of attackers.Ministry of Education, the National Natural Science Foundation of China under Grant No. 61272451, 61572380, U1536204, the Major State Basic Research Development Program of China under Grant No. 2014CB340600, and the National High Technology Research and Development Program (863 Program) of China under Grant No. 2014BAH41B00. The authors extend their appreciation to the Deanship of Scientific Research at King Saud University, Riyadh, Saudi Arabia for funding this work through the research group project No. RGP-318. The information reported here does not reflect the position or the policy of the funding agencies. The corresponding author is Kun He.
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - Secure access is one of the fundamental problems in wireless mobile networks. Digital signature is a widely used technique to protect messages' authenticity and nodes' identities. From the practical perspective, to ensure the quality of services in wireless mobile networks, ideally the process of signature verification should introduce minimum delay. Batch cryptography technique is a powerful tool to reduce verification time. However, most of the existing works focus on designing batch verification algorithms for wireless mobile networks without sufficiently considering the impact of invalid signatures, which can lead to verification failures and performance degradation. In this paper, we propose a Batch Identification Game Model (BIGM) in wireless mobile networks, enabling nodes to find invalid signatures with reasonable delay no matter whether the game scenario is complete information or incomplete information. Specifically, we analyze and prove the existence of Nash Equilibriums (NEs) in both scenarios, to select the dominant algorithm for identifying invalid signatures. To optimize the identification algorithm selection, we propose a self-adaptive auto-match protocol which estimates the strategies and states of attackers based on historical information. Comprehensive simulation results in terms of NE reasonability, algorithm selection accuracy, and identification delay are provided to demonstrate that BIGM can identify invalid signatures more efficiently than existing algorithms.
AB - Secure access is one of the fundamental problems in wireless mobile networks. Digital signature is a widely used technique to protect messages' authenticity and nodes' identities. From the practical perspective, to ensure the quality of services in wireless mobile networks, ideally the process of signature verification should introduce minimum delay. Batch cryptography technique is a powerful tool to reduce verification time. However, most of the existing works focus on designing batch verification algorithms for wireless mobile networks without sufficiently considering the impact of invalid signatures, which can lead to verification failures and performance degradation. In this paper, we propose a Batch Identification Game Model (BIGM) in wireless mobile networks, enabling nodes to find invalid signatures with reasonable delay no matter whether the game scenario is complete information or incomplete information. Specifically, we analyze and prove the existence of Nash Equilibriums (NEs) in both scenarios, to select the dominant algorithm for identifying invalid signatures. To optimize the identification algorithm selection, we propose a self-adaptive auto-match protocol which estimates the strategies and states of attackers based on historical information. Comprehensive simulation results in terms of NE reasonability, algorithm selection accuracy, and identification delay are provided to demonstrate that BIGM can identify invalid signatures more efficiently than existing algorithms.
KW - Batch identification
KW - game theory
KW - wireless mobile networks
UR - http://www.scopus.com/inward/record.url?scp=85027556022&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027556022&partnerID=8YFLogxK
U2 - 10.1109/TMC.2016.2604820
DO - 10.1109/TMC.2016.2604820
M3 - Article
AN - SCOPUS:85027556022
SN - 1536-1233
VL - 16
SP - 1530
EP - 1543
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 6
ER -