Adaptive Secrecy Amplification with Radio Channel Key Extraction

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00101123" target="_blank" >RIV/00216224:14330/18:00101123 - isvavai.cz</a>

Result on the web

<a href="https://ieeexplore.ieee.org/document/8510973" target="_blank" >https://ieeexplore.ieee.org/document/8510973</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/DCOSS.2018.00028" target="_blank" >10.1109/DCOSS.2018.00028</a>

Result language

angličtina

Original language name

Adaptive Secrecy Amplification with Radio Channel Key Extraction

Original language description

Wireless sensor networks with a large number of cheap low-power interconnected devices bring up challenging tasks when considering the security of their communications. Our paper addresses the issue how cryptographic link keys between communicating sensor nodes can be continuously re-secured even in presence of an attacker who can read the memory of captured nodes. Distributed sensor systems enable us to use two different approaches to link key (re-)establishment – secrecy amplification and key extraction from radio channel fading. A secrecy amplification protocol lets a group of neighboring nodes cooperate together to re-secure previously compromised link keys using the non-compromised paths, and previous research showed the ability of secrecy amplification protocols to improve the security of a network from 50% of compromised link keys to 90% of secure keys. Key extraction then exploits radio channel properties to generate secret bits shared between two radio-enabled devices. We propose to combine secrecy amplification and key extraction into a dynamic protocol, where every node will dynamically decide what approach provides a greater benefit, considering the probability of getting the link key re-secured and the resources available. In principle, the more standard traffic messages are exchanged on a given link, the more beneficiary is the usage of key extractions. And less busy links then rely on secrecy amplification.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2018

Confidentiality

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

Article name in the collection

2018 14th International Conference on Distributed Computing in Sensor Systems (DCOSS)

ISBN

9781538654705

ISSN

2325-2944

e-ISSN

—

Number of pages

8

Pages from-to

123-130

Publisher name

IEEE

Place of publication

New York, NY, USA

Event location

New York, NY, USA

Event date

Jan 1, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—