RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks

Manish Mehta; Dijiang Huang; Lein Harn

RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks

Manish Mehta, Dijiang Huang, Lein Harn

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.

Original language	English (US)
Title of host publication	Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
Editors	T. Dahlberg, R. Oliver, A. Sen, G. Xue
Pages	193-197
Number of pages	5
State	Published - 2005
Externally published	Yes
Event	24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States Duration: Apr 7 2005 → Apr 9 2005

Other

Other	24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
Country/Territory	United States
City	Phoenix, AZ
Period	4/7/05 → 4/9/05

ASJC Scopus subject areas

General Engineering

Cite this

RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks. / Mehta, Manish; Huang, Dijiang; Harn, Lein.
Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. ed. / T. Dahlberg; R. Oliver; A. Sen; G. Xue. 2005. p. 193-197 4a.3.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mehta, M, Huang, D & Harn, L 2005, RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks. in T Dahlberg, R Oliver, A Sen & G Xue (eds), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference., 4a.3, pp. 193-197, 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005, Phoenix, AZ, United States, 4/7/05.

@inproceedings{3fa194226c3c4cf09d45fa41efc0abbc,

title = "RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks",

abstract = "Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.",

author = "Manish Mehta and Dijiang Huang and Lein Harn",

year = "2005",

language = "English (US)",

pages = "193--197",

editor = "T. Dahlberg and R. Oliver and A. Sen and G. Xue",

booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",

note = "24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 ; Conference date: 07-04-2005 Through 09-04-2005",

}

TY - GEN

T1 - RINK-RKP

T2 - 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005

AU - Mehta, Manish

AU - Huang, Dijiang

AU - Harn, Lein

PY - 2005

Y1 - 2005

N2 - Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.

AB - Efficient schemes for key predistribution and shared-key discovery play a vital role in security and efficiency of pairwise key establishment in sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discovery. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attacks described in existing proposals. We also show that as compared to the existing schemes, our scheme is more resilient to these active attacks.

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

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

M3 - Conference contribution

AN - SCOPUS:28444462524

SP - 193

EP - 197

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

A2 - Dahlberg, T.

A2 - Oliver, R.

A2 - Sen, A.

A2 - Xue, G.

Y2 - 7 April 2005 through 9 April 2005

ER -

RINK-RKP: A scheme for key predistribution and shared-key discovery in sensor networks

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this