✦ LIBER ✦

Key agreement in ad hoc networks

✍ Scribed by N Asokan; P Ginzboorg

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 284 KB
Volume: 23
Category: Article
ISSN: 0140-3664
DOI: 10.1016/s0140-3664(00)00249-8

No coin nor oath required. For personal study only.

✦ Synopsis

We encounter new types of security problems in ad hoc networks because such networks have little or no support infrastructure. In this paper we consider one such problem: a group of people in a meeting room do not have access to public key infrastructure or third party key management service, and they do not share any other prior electronic context. How can they set up a secure session among their computers? We examine various alternatives and propose new protocols for password-based multi-party key agreement in this scenario. Our protocols may be applicable in other scenarios, too. We also present a fault-tolerant version of a multi-party Diffie-Hellman key agreement protocol which can be of independent interest.

📜 SIMILAR VOLUMES

Dynamic asymmetric group key agreement f

Dynamic asymmetric group key agreement for ad hoc networks

✍ Xingwen Zhao; Fangguo Zhang; Haibo Tian 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 291 KB

A group key agreement protocol allows a set of users to establish a common symmetric key via open networks. Dynamic asymmetric group key agreement means that a dynamic set of users form a temporary group and negotiate to share a public encryption key, so that anyone can send message securely and eff

Non-interactive key establishment in mob

Non-interactive key establishment in mobile ad hoc networks

✍ Zhenjiang Li; J.J. Garcia-Luna-Aceves 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 252 KB

We present a new non-interactive key agreement and progression (NIKAP) scheme for mobile ad hoc networks (MANETs), which does not require an on-line centralized authority, can non-interactively establish and update pairwise keys between nodes, is configurable to operate synchronously or asynchronous

Advances in Ad Hoc Networks (I)

✍ Jun Zheng; Shiwen Mao; Scott F. Midkiff; Tommaso Melodia 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Ad hoc networks, which include a variety of autonomous networks for specific purposes, promise to enable a broad range of civilian, commercial, and military applications. These networks were originally envisioned as collections of autonomous mobile or stationary nodes that dynamically auto-configure

Preemptive routing in ad hoc networks

✍ Tom Goff; Nael Abu-Ghazaleh; Dhananjay Phatak; Ridvan Kahvecioglu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Routing in ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken. Existing on-demand ad hoc routing algorithms initiate route discovery only after a path breaks, incurring a significant cost in detecting the disconnection and establishi

Flooding in wireless ad hoc networks

✍ H Lim; C Kim 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 265 KB

In an ad hoc network, each host assumes the role of a router and relays packets toward ®nal destinations. This paper studies ef®cient routing mechanisms for packet ¯ooding in ad hoc wireless networks. Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network

Ad hoc QoS on-demand routing (AQOR) in m

Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks

✍ Qi Xue; Aura Ganz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 869 KB