Noninteractive self-certification for long-lived mobile ad hoc networks

  • Authors:
  • Nitesh Saxena;Jeong Hyun Yi

  • Affiliations:
  • Computer Science and Engineering Department, Polytechnic Institute of New York University, New York;School of Computing, Soongsil University, Seoul, Korea

  • Venue:
  • IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mobile ad hoc networks (MANETs) have many well-known applications in military settings as well as in emergency and rescue operations. However, a lack of infrastructure and centralized control make MANETs inherently insecure, and therefore specialized security services are needed for their deployment. Self-certification is an essential and fundamental security service in MANETs. It is needed to securely cope with dynamic membership and topology, and to bootstrap other important security primitives and services (such as secure routing and group key management) without the assistance of any centralized trusted authority. An ideal protocol must involve minimal interaction among the MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, a self-certification protocol must be efficient in terms of computation and communication. In this paper, we propose a power-aware and fully noninteractive self-certification protocol based on bivariate polynomial secret sharing and a noninteractive threshold signature scheme. In contrast with prior work, our techniques do not require any interaction and do not involve any costly reliable broadcast communication among MANET nodes. We thoroughly analyze our proposal and show that it compares favorably to previous mechanisms.