A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)

Qing Chen; Zubair Md Fadlullah; Xiaodong Lin; Nei Kato

doi:10.1016/j.jnca.2010.12.012

A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)

Qing Chen, Zubair Md Fadlullah, Xiaodong Lin, Nei Kato

INF - Applied Information Sciences

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

Abstract

Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by CanettiKrawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.

Original language	English
Pages (from-to)	1827-1835
Number of pages	9
Journal	Journal of Network and Computer Applications
Volume	34
Issue number	6
DOIs	https://doi.org/10.1016/j.jnca.2010.12.012
Publication status	Published - 2011 Nov

Keywords

Key management
Mobile ad hoc networks (MANETs)
Pairing-based cryptography

ASJC Scopus subject areas

Hardware and Architecture
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1016/j.jnca.2010.12.012

Cite this

@article{455671da37fb4586bbd38d1fc76b98ef,

title = "A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)",

abstract = "Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by CanettiKrawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.",

keywords = "Key management, Mobile ad hoc networks (MANETs), Pairing-based cryptography",

author = "Qing Chen and Fadlullah, {Zubair Md} and Xiaodong Lin and Nei Kato",

year = "2011",

month = nov,

doi = "10.1016/j.jnca.2010.12.012",

language = "English",

volume = "34",

pages = "1827--1835",

journal = "Journal of Network and Computer Applications",

issn = "1084-8045",

publisher = "Academic Press Inc.",

number = "6",

}

TY - JOUR

T1 - A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)

AU - Chen, Qing

AU - Fadlullah, Zubair Md

AU - Lin, Xiaodong

AU - Kato, Nei

PY - 2011/11

Y1 - 2011/11

N2 - Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by CanettiKrawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.

AB - Wireless mobile ad hoc networks (MANETs) do not have centralized infrastructure and it is difficult to provide authentication services. In this paper, we apply Certificate Graph (CG) and identity-based security in designing an admission control scheme for MANETs. We first use one-hop message exchange to build CG at each mobile node. Then we select maximum clique nodes in CG as distributed Certificate Authorities (CAs). We use identity-based key agreement from pairings to protect each session. Then we prove the security by CanettiKrawczyk (CK) model-based analysis. We demonstrate the effectiveness and feasibility of our protocol through computer simulations.

KW - Key management

KW - Mobile ad hoc networks (MANETs)

KW - Pairing-based cryptography

UR - http://www.scopus.com/inward/record.url?scp=80052725253&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052725253&partnerID=8YFLogxK

U2 - 10.1016/j.jnca.2010.12.012

DO - 10.1016/j.jnca.2010.12.012

M3 - Article

AN - SCOPUS:80052725253

VL - 34

SP - 1827

EP - 1835

JO - Journal of Network and Computer Applications

JF - Journal of Network and Computer Applications

SN - 1084-8045

IS - 6

ER -

A clique-based secure admission control scheme for mobile ad hoc networks (MANETs)

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this