Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks

Jing Chen, Kun He, Quan Yuan, Guoliang Xue, Ruiying Du, Lina Wang

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1530-1543
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume16
Issue number6
DOIs
StatePublished - Jun 1 2017

Fingerprint

Wireless networks
Identification (control systems)
Electronic document identification systems
Cryptography
Quality of service
Network protocols
Degradation

Keywords

  • Batch identification
  • game theory
  • wireless mobile networks

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks. / Chen, Jing; He, Kun; Yuan, Quan; Xue, Guoliang; Du, Ruiying; Wang, Lina.

In: IEEE Transactions on Mobile Computing, Vol. 16, No. 6, 01.06.2017, p. 1530-1543.

Research output: Contribution to journalArticle

Chen, Jing ; He, Kun ; Yuan, Quan ; Xue, Guoliang ; Du, Ruiying ; Wang, Lina. / Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks. In: IEEE Transactions on Mobile Computing. 2017 ; Vol. 16, No. 6. pp. 1530-1543.
@article{0f495424ce5a4a50b3ca7391636b0410,
title = "Batch Identification Game Model for Invalid Signatures in Wireless Mobile Networks",
abstract = "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.",
keywords = "Batch identification, game theory, wireless mobile networks",
author = "Jing Chen and Kun He and Quan Yuan and Guoliang Xue and Ruiying Du and Lina Wang",
year = "2017",
month = "6",
day = "1",
doi = "10.1109/TMC.2016.2604820",
language = "English (US)",
volume = "16",
pages = "1530--1543",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

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

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

VL - 16

SP - 1530

EP - 1543

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 6

ER -