Abstract
Digital signature has been widely employed in wireless mobile networks to ensure the authenticity of messages and identity of nodes. A paramount concern in signature verification is reducing the verification delay to ensure the network QoS. To address this issue, researchers have proposed the batch cryptography technology. However, most of the existing works focus on designing batch verification algorithms without sufficiently considering the impact of invalid signatures. The performance of batch verification could dramatically drop, if there are verification failures caused by invalid signatures. In this paper, we propose a Game-theory-based Batch Identification Model (GBIM) for wireless mobile networks, enabling nodes to find invalid signatures with the optimal delay under heterogeneous and dynamic attack scenarios. Specifically, we design an incomplete information game model between a verifier and its attackers, and prove the existence of Nash Equilibrium, to select the dominant algorithm for identifying invalid signatures. Moreover, we propose an auto-match protocol to optimize the identification algorithm selection, when the attack strategies can be estimated based on history information. Comprehensive simulation results demonstrate that GBIM can identify invalid signatures more efficiently than existing algorithms.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 262-270 |
| Number of pages | 9 |
| Volume | 26 |
| ISBN (Print) | 9781479983810 |
| DOIs | |
| State | Published - Aug 21 2015 |
| Event | 34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015 - Hong Kong, Hong Kong Duration: Apr 26 2015 → May 1 2015 |
Other
| Other | 34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015 |
|---|---|
| Country | Hong Kong |
| City | Hong Kong |
| Period | 4/26/15 → 5/1/15 |
Fingerprint
Keywords
- Batch identification
- game theory
- wireless mobile networks
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering
Cite this
Game-theory-based batch identification of invalid signatures in wireless mobile networks. / Chen, Jing; Yuan, Quan; Xue, Guoliang; Du, Ruiying.
Proceedings - IEEE INFOCOM. Vol. 26 Institute of Electrical and Electronics Engineers Inc., 2015. p. 262-270 7218390.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Game-theory-based batch identification of invalid signatures in wireless mobile networks
AU - Chen, Jing
AU - Yuan, Quan
AU - Xue, Guoliang
AU - Du, Ruiying
PY - 2015/8/21
Y1 - 2015/8/21
N2 - Digital signature has been widely employed in wireless mobile networks to ensure the authenticity of messages and identity of nodes. A paramount concern in signature verification is reducing the verification delay to ensure the network QoS. To address this issue, researchers have proposed the batch cryptography technology. However, most of the existing works focus on designing batch verification algorithms without sufficiently considering the impact of invalid signatures. The performance of batch verification could dramatically drop, if there are verification failures caused by invalid signatures. In this paper, we propose a Game-theory-based Batch Identification Model (GBIM) for wireless mobile networks, enabling nodes to find invalid signatures with the optimal delay under heterogeneous and dynamic attack scenarios. Specifically, we design an incomplete information game model between a verifier and its attackers, and prove the existence of Nash Equilibrium, to select the dominant algorithm for identifying invalid signatures. Moreover, we propose an auto-match protocol to optimize the identification algorithm selection, when the attack strategies can be estimated based on history information. Comprehensive simulation results demonstrate that GBIM can identify invalid signatures more efficiently than existing algorithms.
AB - Digital signature has been widely employed in wireless mobile networks to ensure the authenticity of messages and identity of nodes. A paramount concern in signature verification is reducing the verification delay to ensure the network QoS. To address this issue, researchers have proposed the batch cryptography technology. However, most of the existing works focus on designing batch verification algorithms without sufficiently considering the impact of invalid signatures. The performance of batch verification could dramatically drop, if there are verification failures caused by invalid signatures. In this paper, we propose a Game-theory-based Batch Identification Model (GBIM) for wireless mobile networks, enabling nodes to find invalid signatures with the optimal delay under heterogeneous and dynamic attack scenarios. Specifically, we design an incomplete information game model between a verifier and its attackers, and prove the existence of Nash Equilibrium, to select the dominant algorithm for identifying invalid signatures. Moreover, we propose an auto-match protocol to optimize the identification algorithm selection, when the attack strategies can be estimated based on history information. Comprehensive simulation results demonstrate that GBIM 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=84954234227&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84954234227&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2015.7218390
DO - 10.1109/INFOCOM.2015.7218390
M3 - Conference contribution
SN - 9781479983810
VL - 26
SP - 262
EP - 270
BT - Proceedings - IEEE INFOCOM
PB - Institute of Electrical and Electronics Engineers Inc.
ER -