Name
Abstract | ||
|---|---|---|
The majority of security systems for wireless sensor networks are based on symmetric encryption. The main open issue for these approaches concerns the establishment of symmetric keys. A promising key distribution technique is the random pre-distribution of secret keys. Despite its effectiveness, this approach presents considerable memory overheads, in contrast with the limited resources of wireless sensor networks. A new scheme, called Seed based Min–Max Composite (S2MC), is proposed that exploits the best features of random pre-distribution with lower memory requirements and higher resilience. The novelty of the S2MC scheme lies in the organization of the secret material that uses the limited number of light weight pre-distributed seeds in a certain range and generating keys from the seeds during communication. The simulative analysis demonstrates that the introduced approach provides a higher level of security in terms of resilience than the existing schemes since the keys are erased after communication in the presence of compromised nodes. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11277-019-06503-x | Wireless Personal Communications |
Keywords | Field | DocType |
Wireless sensor network (WSN), Key management, Security, S2MC, Integrity, Communication | Key distribution,Symmetric-key algorithm,Psychological resilience,Key management,Computer science,Computer network,Exploit,Novelty,Wireless sensor network,Secure communication | Journal |
Volume | Issue | ISSN |
108 | 3 | 0929-6212 |
Citations | PageRank | References |
1 | 0.40 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Geetha | 1 | 4 | 1.83 |
| V. Madhusudhan | 2 | 1 | 0.40 |
| T. Padmavathy | 3 | 1 | 1.07 |
| A. Lallithasree | 4 | 1 | 0.73 |