Key Revocation for Identity-Based Schemes in Mobile Ad Hoc Networks

Hoeper, Katrin; Gong, Guang

doi:10.1007/11814764_19

Cited by 19 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hoeper and Gong [12] presented a self-organized key revocation scheme for MANETs. In their scheme, each node uses a neighborhood watch scheme to monitor other nodes' behavior within its communication range.…”

Section: A Key Revocation Schemes In Menetsmentioning

confidence: 99%

“…2) Registration of network nodes: For the purpose of key revocation, we use the public key format Q i = H(ID i date version) for each node with identity ID i as introduced in [12], where date is the expiry date of the key and version is its version number. After the user ID i shows his credential and passes the authentication of the TTP, the TTP will derive his public key Q i and generate the corresponding ID-based private key d i = sQ i .…”

Section: B Step 1 Network Initializationmentioning

confidence: 99%

“…We note that all previous key revocation schemes for MANETs [2], [12], [18], [21], [24], [29] only classify nodes' behavior as either good or malicious. The main motivation that we consider suspicious behavior is based on the observation that nodes show some misbehavior for a short time just by accident.…”

Section: B Step 1 Network Initializationmentioning

confidence: 99%

“…Although a number of schemes have been proposed for the key The authors are with the Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada (e-mail: x5fan@engmail.uwaterloo.ca, ggong@calliope.uwaterloo.ca). management in MANETs [9], [18], [24], [28]- [30], only a few of literature explicitly address the issue of the key revocation, see [2], [12], [18], [21], [24], [29] for example.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Key revocation based on Dirichlet multinomial model for mobile ad hoc networks

Fan

Gong

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

Self Cite

View full text Add to dashboard Cite

Abstract-The absence of an online trusted authority makes the issue of key revocation in mobile ad hoc networks (MANETs) particularly challenging. In this paper, we present a novel selforganized key revocation scheme based on the Dirichlet multinomial model and identity-based cryptography (IBC). Our key revocation scheme offers a theoretically sound basis for a node in MANETs to predict the behavior of other nodes based on its own observations and reports from peers. In our scheme, each node keeps track of three categories of behavior defined and classified by an external trusted authority, and updates its knowledge about other nodes' behavior with 3-dimension Dirichlet distribution. Differentiating between suspicious behavior and malicious behavior enables nodes to make multilevel response by either revoking keys of malicious nodes or ceasing the communication with suspicious nodes for some time to gather more information for making further decision. Furthermore, we also analyze the attack-resistant properties of our key revocation scheme through extensive simulations in the presence of independent and collusive adversaries, respectively.

show abstract

Section: A Key Revocation Schemes In Menetsmentioning

confidence: 99%

Section: B Step 1 Network Initializationmentioning

confidence: 99%

Section: B Step 1 Network Initializationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Key revocation based on Dirichlet multinomial model for mobile ad hoc networks

Fan

Gong

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…If a party A wishes to encrypt a message for B, he only needs to know Bs identifier and the system-wide public parameters; he need not have any relation with the TA to send the message, and need not authenticate B's public key. A number of authors have studied the applicability of IBE to MANETs [11], [6], [12], [9], [2].…”

Section: Introductionmentioning

confidence: 99%

Flexible and secure communications in an identity-based coalition environment

Boklan

Klagsbrun

Paterson

et al. 2008

MILCOM 2008 - 2008 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-In this paper we consider the problem of how entities operating under distinct roots of trust in a coalition environment can flexibly and securely communicate with one another. We consider the identity-based setting, with each entity being preconfigured with a private key from a particular Trusted Authority (TA), but where multiple, independent TAs are involved in the coalition. Our solution to the problem adapts the Boneh-Franklin identity-based encryption (IBE) scheme. It allows any entity to securely communicate with any other entity, even without knowing the TA with which the intended recipient is associated. To enable this, we assume that the TAs co-operate to distribute certain additional public information to all entities which allows entities to decrypt a ciphertext that was composed using the public parameters of one TA, using a private key issued by another. We include a security analysis of our new approach.

show abstract

PAPA‐UIC: a design approach and a framework for secure mobile ad hoc networks

Zhao

Aggarwal

2009

Security Comm Networks

View full text Add to dashboard Cite

Security of Mobile Ad hoc Networks (MANETs) is still a hard problem after years of research. We propose a new design approach and a framework for securing a practical type of MANETs. The framework is named PAPA-UIC, short for Pre-planned Ad-hoc Proactive Approach Using Identity-based Cryptography. In proactive approach, the system starts from a secure status and fortifies this status by protecting packets using cryptography and updating cryptographic keys periodically or when necessary. The proposed scheme addresses the interdependency cycle of secure routing and security services by combining secure routing and key management in one framework. The framework proposes a secure routing protocol (SRP) using identity-based cryptography and solutions to general problems of identity-based cryptography. The routing protocol has several improvements over existing ones. The novel ideas to solve key escrow, identity disclosure and identity revocation issues can be integrated into the framework, and can be transplanted to other environments as well.These certain characteristics include: lack of a network infrastructure and online administration, the dynamics of the network topology and node membership, limited communication and computational resources, the potential attacks from inside the network, and vulnerability of wireless links.Routing in MANETs enables packet delivery from one node to another by way of intermediate nodes. It is the fundamental issue considered in MANETs. Secure routing is a fundamental issue in MANET security. Secure routing ensures successful routing among authentic nodes in the existence of adversary nodes around or inside the network, and forms the bedrock In order to build a secure MANET, we first need a secure routing protocol and answer these questions DESIGN APPROACH AND A FRAMEWORK FOR SECURE MOBILE AD HOC NETWORKS 377 ‡ê (d A , P) =ê(Q A , P pub ) =ê(Q A , P) s . §ê (v, P pub ) =ê(r · Q A , sP) =ê(r · s · Q A , P) = e(d A , P) r = g r .

show abstract

Key Revocation for Identity-Based Schemes in Mobile Ad Hoc Networks

Cited by 19 publications

References 10 publications

Key revocation based on Dirichlet multinomial model for mobile ad hoc networks

Key revocation based on Dirichlet multinomial model for mobile ad hoc networks

Flexible and secure communications in an identity-based coalition environment

PAPA‐UIC: a design approach and a framework for secure mobile ad hoc networks

Contact Info

Product

Resources

About