Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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 (Engelska)Ingår i: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 28, nr 7, s. 1036-1045Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
IEEE , 2010. Vol. 28, nr 7, s. 1036-1045
Nyckelord [en]
Confidentiality, GossiCrypt, Probabilistic Key Refreshing and En-route Encryption, Security
Nationell ämneskategori
Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-35564DOI: 10.1109/JSAC.2010.100908ISI: 000283181200008Scopus ID: 2-s2.0-77956217417OAI: oai:DiVA.org:kth-35564DiVA, id: diva2:429028
Anmärkning

© 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

Tillgänglig från: 2011-07-13 Skapad: 2011-07-01 Senast uppdaterad: 2017-12-11Bibliografiskt granskad

Open Access i DiVA

fulltext(213 kB)199 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 213 kBChecksumma SHA-512
d9238c0622f064f2da6d930629cea282028edda418942dfc1dbbd5075a5d24c8d59245258f2c86c12590047b659565d7b454bccd6c84aa6b874b2b30925905e4
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopus

Sök vidare i DiVA

Av författaren/redaktören
Papadimitratos, Panagiotis
I samma tidskrift
IEEE Journal on Selected Areas in Communications
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 199 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 105 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf