2008 International Conference on Embedded Software and Systems 2008
DOI: 10.1109/icess.2008.44
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Matrix Key Pre-distribution Scheme for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2012
2012
2014
2014

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…The original Blom's scheme has limitations in that to be secure, it would require substantial memory for storage of keying material when used in large networks. The work in [7], improved on its scalability by using a clustered topology where only the cluster-heads implemented the Blom's scheme. The probabilistic scheme in [8] used multiple key-spaces where nodes would first discover their shared key space to implement the scheme.…”
Section: Related Workmentioning
confidence: 99%
“…The original Blom's scheme has limitations in that to be secure, it would require substantial memory for storage of keying material when used in large networks. The work in [7], improved on its scalability by using a clustered topology where only the cluster-heads implemented the Blom's scheme. The probabilistic scheme in [8] used multiple key-spaces where nodes would first discover their shared key space to implement the scheme.…”
Section: Related Workmentioning
confidence: 99%
“…The probabilistic scheme in [18] used multiple key-spaces where nodes would first discover their shared key space. Another work restricted the scheme to the cluster heads only [19] to compute the pairwise keys among themselves using the Blom's scheme. The recent implementation in [20] introduces a small amount of random perturbation to make it more difficult for the captured keys to be used to break the scheme.…”
Section: Related Workmentioning
confidence: 99%