PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005.
DOI: 10.1109/pccc.2005.1460551
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Eficient schemes for key predistribution and shared-key discovery play a vital role in security and eficiency of pairwise key establishment an sensor networks. In this paper, we propose a scheme for key predistribution using hash-chain and subsequent shared-key discove y. We show potential active attacks on sensor networks due to key predistribution which can have severer consequences as compared to attucks described in existing proposals. We also show that as compared to the existing schemes, our scheme is mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(16 citation statements)
references
References 5 publications
0
16
0
Order By: Relevance
“…However, inside every framework there are some KMS that are optimized to minimize the communication overhead, even reducing the amount of information exchanged to only the ID of a node. Some "key pool" KMS reduce the communication overhead by linking the contents of the "key chains" to the IDs of the nodes [MHH05]. Also, in certain mathematical frameworks, the IDs of the nodes will be used as an input for a function that will return the pairwise key: Polynomial-based key predistribution KMS calculate f (ID i , ID j ) = f (ID j , ID i ) (being f a bivariate polynomial) [LNL05], whereas Blom-based key predistribu-…”
Section: Nike and Symmetric Key-based Kmsmentioning
confidence: 99%
“…However, inside every framework there are some KMS that are optimized to minimize the communication overhead, even reducing the amount of information exchanged to only the ID of a node. Some "key pool" KMS reduce the communication overhead by linking the contents of the "key chains" to the IDs of the nodes [MHH05]. Also, in certain mathematical frameworks, the IDs of the nodes will be used as an input for a function that will return the pairwise key: Polynomial-based key predistribution KMS calculate f (ID i , ID j ) = f (ID j , ID i ) (being f a bivariate polynomial) [LNL05], whereas Blom-based key predistribu-…”
Section: Nike and Symmetric Key-based Kmsmentioning
confidence: 99%
“…Many proposed methods are based on random key pre-distribution [16][17][18]. The main idea is that any two sensor nodes have a probability for choosing the same key from the predistributed key pool.…”
Section: Related Workmentioning
confidence: 99%
“…For static key management schemes, the network resilience against node capture can be further enhanced by using the key polynomials (as in [40]) or deployment location [20,38,39]. Examples of static key management schemes include [9,15,16,20,21,25,29,[37][38][39]41] and dynamic key management schemes are [10,24,42]. In [24], Eltoweissy et al [24] proposed a dynamic key management system, called exclusion-based system (EBS).…”
Section: Related Workmentioning
confidence: 99%