Matrix based key agreement algorithms for sensor networks

Abhishek Parakh, Subhash Kak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

Communication between nodes in a sensor network is often secured by the use of symmetric keys installed on them before deployment. A more efficient method is to install sensors with a small amount of secret information that can be used to generate a pairwise common key when required. We propose new key agreement algorithms based on matrix factorization that requires a maximum of m multiplications to generate a key, where M ≤ N is a system parameter and N is the total number of nodes in the network.

Original languageEnglish (US)
Title of host publicationANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems
DOIs
StatePublished - 2011
Event5th IEEE International Conference on Advanced Networks and Telecommunication Systems, ANTS 2011 - Bengaluru, India
Duration: Dec 18 2011Dec 21 2011

Publication series

NameInternational Symposium on Advanced Networks and Telecommunication Systems, ANTS
ISSN (Print)2153-1684

Conference

Conference5th IEEE International Conference on Advanced Networks and Telecommunication Systems, ANTS 2011
CountryIndia
CityBengaluru
Period12/18/1112/21/11

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Matrix based key agreement algorithms for sensor networks'. Together they form a unique fingerprint.

Cite this