Matrix based key agreement algorithms for sensor networks

Abhishek Parakh, Subhash Kak

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

7 Citations (Scopus)

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 - Dec 1 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

Fingerprint

Factorization
Sensor networks
Communication
Sensors
communication

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Parakh, A., & Kak, S. (2011). Matrix based key agreement algorithms for sensor networks. In ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems [6163684] (International Symposium on Advanced Networks and Telecommunication Systems, ANTS). https://doi.org/10.1109/ANTS.2011.6163684

Matrix based key agreement algorithms for sensor networks. / Parakh, Abhishek; Kak, Subhash.

ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems. 2011. 6163684 (International Symposium on Advanced Networks and Telecommunication Systems, ANTS).

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

Parakh, A & Kak, S 2011, Matrix based key agreement algorithms for sensor networks. in ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems., 6163684, International Symposium on Advanced Networks and Telecommunication Systems, ANTS, 5th IEEE International Conference on Advanced Networks and Telecommunication Systems, ANTS 2011, Bengaluru, India, 12/18/11. https://doi.org/10.1109/ANTS.2011.6163684
Parakh A, Kak S. Matrix based key agreement algorithms for sensor networks. In ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems. 2011. 6163684. (International Symposium on Advanced Networks and Telecommunication Systems, ANTS). https://doi.org/10.1109/ANTS.2011.6163684
Parakh, Abhishek ; Kak, Subhash. / Matrix based key agreement algorithms for sensor networks. ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems. 2011. (International Symposium on Advanced Networks and Telecommunication Systems, ANTS).
@inproceedings{ec0b083da198487aa1c35401106416b6,
title = "Matrix based key agreement algorithms for sensor networks",
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.",
author = "Abhishek Parakh and Subhash Kak",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ANTS.2011.6163684",
language = "English (US)",
isbn = "9781467300933",
series = "International Symposium on Advanced Networks and Telecommunication Systems, ANTS",
booktitle = "ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems",

}

TY - GEN

T1 - Matrix based key agreement algorithms for sensor networks

AU - Parakh, Abhishek

AU - Kak, Subhash

PY - 2011/12/1

Y1 - 2011/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84858957250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858957250&partnerID=8YFLogxK

U2 - 10.1109/ANTS.2011.6163684

DO - 10.1109/ANTS.2011.6163684

M3 - Conference contribution

SN - 9781467300933

T3 - International Symposium on Advanced Networks and Telecommunication Systems, ANTS

BT - ANTS 2011 - 5th IEEE International Conference on Advanced Networks and Telecommunication Systems

ER -