A secure communication scheme for mobile wireless sensor networks using hamming distance

Seok Lae Lee, Bo Sung Hwang, Joo Seok Song

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

Abstract

For the secure transmission of information in the mobile wireless sensor network, the information between two nodes must be encrypted. To this end, nodes must share the common key necessary for encryption. At this time, the encryption algorithm should be symmetric cryptography rather than public-key cryptography in consideration of the process performance of sensor nodes, and the number of secret keys that each node must store and manage must be minimized in view of its memory capacity. In this paper, we propose a method of reducing the number of secret keys in spite of using the symmetric encryption algorithm. In this method, each node must store and manage by assigning a unique ID to it, and by ensuring that only those two nodes whose the Hamming Distance between their IDs is " 1" share the same secret key. According to this method, each node needs to store and manage only log2N symmetric secret keys so that two nodes participating in the mobile wireless sensor network can obtain a common key for secure transmission of information. In this paper, we also propose the protocol and algorithm for obtaining a common key between two nodes using their own secret keys and the secret keys acquired from their neighbor nodes, and evaluate the performance (including node connectivity, network resilience against node capture, memory capacity, and key pool size) of our proposing method.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings
Pages900-911
Number of pages12
EditionPART 1
Publication statusPublished - 2007 Dec 1
EventInternational Conference on Computational Science and its Applications, ICCSA 2007 - Kuala Lumpur, Malaysia
Duration: 2007 Aug 262007 Aug 29

Publication series

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

Other

OtherInternational Conference on Computational Science and its Applications, ICCSA 2007
CountryMalaysia
CityKuala Lumpur
Period07/8/2607/8/29

Fingerprint

Mobile Sensor Networks
Hamming distance
Secure Communication
Hamming Distance
Cryptography
Wireless Sensor Networks
Wireless sensor networks
Vertex of a graph
Public key cryptography
Data storage equipment
Sensor nodes
Encryption
Network protocols
Secure communication
Symmetric Cryptography
Public Key Cryptography
Network Connectivity
Resilience

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lee, S. L., Hwang, B. S., & Song, J. S. (2007). A secure communication scheme for mobile wireless sensor networks using hamming distance. In Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings (PART 1 ed., pp. 900-911). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4705 LNCS, No. PART 1).
Lee, Seok Lae ; Hwang, Bo Sung ; Song, Joo Seok. / A secure communication scheme for mobile wireless sensor networks using hamming distance. Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings. PART 1. ed. 2007. pp. 900-911 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{6b0730640d2e4820bb1b14547a79f407,
title = "A secure communication scheme for mobile wireless sensor networks using hamming distance",
abstract = "For the secure transmission of information in the mobile wireless sensor network, the information between two nodes must be encrypted. To this end, nodes must share the common key necessary for encryption. At this time, the encryption algorithm should be symmetric cryptography rather than public-key cryptography in consideration of the process performance of sensor nodes, and the number of secret keys that each node must store and manage must be minimized in view of its memory capacity. In this paper, we propose a method of reducing the number of secret keys in spite of using the symmetric encryption algorithm. In this method, each node must store and manage by assigning a unique ID to it, and by ensuring that only those two nodes whose the Hamming Distance between their IDs is {"} 1{"} share the same secret key. According to this method, each node needs to store and manage only log2N symmetric secret keys so that two nodes participating in the mobile wireless sensor network can obtain a common key for secure transmission of information. In this paper, we also propose the protocol and algorithm for obtaining a common key between two nodes using their own secret keys and the secret keys acquired from their neighbor nodes, and evaluate the performance (including node connectivity, network resilience against node capture, memory capacity, and key pool size) of our proposing method.",
author = "Lee, {Seok Lae} and Hwang, {Bo Sung} and Song, {Joo Seok}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540744689",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "900--911",
booktitle = "Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings",
edition = "PART 1",

}

Lee, SL, Hwang, BS & Song, JS 2007, A secure communication scheme for mobile wireless sensor networks using hamming distance. in Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 4705 LNCS, pp. 900-911, International Conference on Computational Science and its Applications, ICCSA 2007, Kuala Lumpur, Malaysia, 07/8/26.

A secure communication scheme for mobile wireless sensor networks using hamming distance. / Lee, Seok Lae; Hwang, Bo Sung; Song, Joo Seok.

Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings. PART 1. ed. 2007. p. 900-911 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4705 LNCS, No. PART 1).

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

TY - GEN

T1 - A secure communication scheme for mobile wireless sensor networks using hamming distance

AU - Lee, Seok Lae

AU - Hwang, Bo Sung

AU - Song, Joo Seok

PY - 2007/12/1

Y1 - 2007/12/1

N2 - For the secure transmission of information in the mobile wireless sensor network, the information between two nodes must be encrypted. To this end, nodes must share the common key necessary for encryption. At this time, the encryption algorithm should be symmetric cryptography rather than public-key cryptography in consideration of the process performance of sensor nodes, and the number of secret keys that each node must store and manage must be minimized in view of its memory capacity. In this paper, we propose a method of reducing the number of secret keys in spite of using the symmetric encryption algorithm. In this method, each node must store and manage by assigning a unique ID to it, and by ensuring that only those two nodes whose the Hamming Distance between their IDs is " 1" share the same secret key. According to this method, each node needs to store and manage only log2N symmetric secret keys so that two nodes participating in the mobile wireless sensor network can obtain a common key for secure transmission of information. In this paper, we also propose the protocol and algorithm for obtaining a common key between two nodes using their own secret keys and the secret keys acquired from their neighbor nodes, and evaluate the performance (including node connectivity, network resilience against node capture, memory capacity, and key pool size) of our proposing method.

AB - For the secure transmission of information in the mobile wireless sensor network, the information between two nodes must be encrypted. To this end, nodes must share the common key necessary for encryption. At this time, the encryption algorithm should be symmetric cryptography rather than public-key cryptography in consideration of the process performance of sensor nodes, and the number of secret keys that each node must store and manage must be minimized in view of its memory capacity. In this paper, we propose a method of reducing the number of secret keys in spite of using the symmetric encryption algorithm. In this method, each node must store and manage by assigning a unique ID to it, and by ensuring that only those two nodes whose the Hamming Distance between their IDs is " 1" share the same secret key. According to this method, each node needs to store and manage only log2N symmetric secret keys so that two nodes participating in the mobile wireless sensor network can obtain a common key for secure transmission of information. In this paper, we also propose the protocol and algorithm for obtaining a common key between two nodes using their own secret keys and the secret keys acquired from their neighbor nodes, and evaluate the performance (including node connectivity, network resilience against node capture, memory capacity, and key pool size) of our proposing method.

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

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

M3 - Conference contribution

SN - 9783540744689

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 900

EP - 911

BT - Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings

ER -

Lee SL, Hwang BS, Song JS. A secure communication scheme for mobile wireless sensor networks using hamming distance. In Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings. PART 1 ed. 2007. p. 900-911. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).