All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00111520" target="_blank" >RIV/00216224:14330/19:00111520 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.3390/s19225041" target="_blank" >http://dx.doi.org/10.3390/s19225041</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/s19225041" target="_blank" >10.3390/s19225041</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification

  • Original language description

    Research in the area of security for Wireless Sensor Networks over the past two decades has yielded many interesting findings. We focus on the topic of (re-)securing link keys between sensor nodes through so-called secrecy amplification (SA) protocols. Crowdsourcing is at the very heart of these SA protocols. Not only do SA protocols work wonders even for low-level constrained nodes with no tamper resistance, they exhibit astonishing performance in networks under significant attacker control. Our work shows that even when 50% of all network links are compromised, SA protocols can re-secure over 90% of the link keys through an intriguingly simple crowdsourcing mechanism. These protocols allow us to re-take control without any broadly coordinated cooperation, without knowledge of the compromised links, with only very limited knowledge of each particular network node and independently of decisions made by other nodes. Our article first outlines the principles of and presents existing approaches to SA, introducing most of the important related concepts, then presents novel conclusive results for a realistic attacker model parametrised by attacker behaviour and capabilities. We undertook this work using two very different simulators, and we present here the results of analyses and detailed comparisons that have not previously been available. Finally, we report the first real, non-simulated network test results for the most attractive SA protocol, our implementations of which are available as open-source code for two platforms: Arduino and TinyOS. This work demonstrates the practical usability (and the attractive performance) of SA, serving as a ripe technology enabler for (among others) networks with many potentially compromised low-level devices.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Sensors

  • ISSN

    1424-8220

  • e-ISSN

  • Volume of the periodical

    19

  • Issue of the periodical within the volume

    22

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    19

  • Pages from-to

    1-19

  • UT code for WoS article

    000503381500219

  • EID of the result in the Scopus database

    2-s2.0-85075318034