Structures for communication-efficient public key revocation in ubiquitous sensor network

Abedelaziz Mohaisen, Dae Hun Nyang, Young Jae Maeng, Kyung Hee Lee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper we discuss the uprising problem of public key revocation. The main problem in key revocation includes the relatively large memory and communication required to store and transmit the revoked list of keys. This problem becomes serious as the sensor network is subjected to several constraints. In this paper, we introduce several efficient representation mechanisms for representing a set of revoked identifiers of keys. We discuss several network and revocation scenarios and introduce the corresponding solution for each. To demonstrate the value of our proposed approaches, practical simulation results and several comparisons with the current used revocation mechanism are included.

Original languageEnglish
Title of host publicationMobile Ad-hoc and Sensor Networks - Third International Conference, MSN 2007, Proceedings
PublisherSpringer Verlag
Pages822-833
Number of pages12
ISBN (Print)9783540770237
DOIs
StatePublished - 2007
Event3rd International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2007 - Beijing, China
Duration: 12 Dec 200714 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4864 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2007
Country/TerritoryChina
CityBeijing
Period12/12/0714/12/07

Keywords

  • Bit vector
  • Complete subtree cover
  • Dynamic run-length encoding
  • Key revocation efficiency

Fingerprint

Dive into the research topics of 'Structures for communication-efficient public key revocation in ubiquitous sensor network'. Together they form a unique fingerprint.

Cite this