Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • 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
Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks
Swiss Federal Institute of Technology in Lausanne, Switzerland .ORCID iD: 0000-0002-3267-5374
2010 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 28, no 7, 1036-1045 p.Article in journal (Refereed) Published
Abstract [en]

Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, called parasitic adversary, who seeks to exploit sensor networks by obtaining measurements in an unauthorized way. As a countermeasure, we first employ a randomized key refreshing: with low communication cost, it aims at confining (but not eliminating) the effects of the adversary. Moreover, our low-complexity solution, GossiCrypt, leverages on the large scale of sensor networks to protect data confidentiality, efficiently and effectively. GossiCrypt applies symmetric key encryption to data at their source nodes; and it applies re-encryption at a randomly chosen subset of nodes en route to the sink. The combination of randomized key refreshing and GossiCrypt protects data confidentiality with a probability of almost 1; we show this analytically and with simulations. In addition, the energy consumption of GossiCrypt is lower than a public-key based solution by several orders of magnitude.

Place, publisher, year, edition, pages
IEEE , 2010. Vol. 28, no 7, 1036-1045 p.
Keyword [en]
Confidentiality, GossiCrypt, Probabilistic Key Refreshing and En-route Encryption, Security
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-35564DOI: 10.1109/JSAC.2010.100908ISI: 000283181200008Scopus ID: 2-s2.0-77956217417OAI: oai:DiVA.org:kth-35564DiVA: diva2:429028
Note

© 2010 IEEE. Personal use of the attached pdf is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20110713

Available from: 2011-07-13 Created: 2011-07-01 Last updated: 2017-12-11Bibliographically approved

Open Access in DiVA

fulltext(213 kB)112 downloads
File information
File name FULLTEXT01.pdfFile size 213 kBChecksum SHA-512
d9238c0622f064f2da6d930629cea282028edda418942dfc1dbbd5075a5d24c8d59245258f2c86c12590047b659565d7b454bccd6c84aa6b874b2b30925905e4
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Papadimitratos, Panagiotis
In the same journal
IEEE Journal on Selected Areas in Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 112 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 56 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • 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