uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
ARPD: Asynchronous random key predistribution in the LEAP framework for Wireless Sensor Networks
RWTH Aachen.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Communication Research)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Communication Research)
2007 (English)In: 3rd IEEE International Workshop on Wireless and Sensor Networks Security (IEEE WSNS 2007), 2007Conference paper, Published paper (Refereed)
Abstract [en]

In the LEAP framework for wireless sensor networks a set of keys is used to secure communication. LEAP distinguishes between unicast (pairwise) communication, group (cluster) communication and global (broadcast) communication. The keys used in pairwise communication are derived from an initial key KI that nodes are equipped with prior to deployment

and that is deleted after link setup. Further keys are distributed encrypted with these pairwise keys. If the initial key is ever disclosed, the whole network is compromised.

To lower the threat of KI disclosure, we present a novel KI -less scheme for key predistribution. Our scheme is based on random key redistribution, and proves to perform better in medium sized networks than previous proposals. It is resilient against node capture attacks and allows node to node authentication. Attacks against overlying protocols in the network are more difficult with this scheme.

We have conducted computations to show the feasibility of our scheme for networks up to a size of 1000 nodes. By introducing a key reuse system we are able to increase the probability of a successful link setup. We have included a security analysis that discusses our scheme’s resistance against commonly known attacks.

Place, publisher, year, edition, pages
2007.
National Category
Engineering and Technology
Research subject
Computer Science with specialization in Computer Communication
Identifiers
URN: urn:nbn:se:uu:diva-12150OAI: oai:DiVA.org:uu-12150DiVA: diva2:39919
Projects
WISENET
Available from: 2008-01-07 Created: 2008-01-07 Last updated: 2011-03-28Bibliographically approved

Open Access in DiVA

No full text

Other links

http://www.it.uu.se/research/group/core/publications/achtzehn-wsns07.pdf

Authority records BETA

Rohner, Christian

Search in DiVA

By author/editor
Rohner, Christian
By organisation
Computer Systems
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 463 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf