Secure Key Generation for Distributed Inference in IoT

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Standard

Secure Key Generation for Distributed Inference in IoT. / Hentilä, Henri; Koivunen, Visa; Poor, H. Vincent; Blum, Rick S.

2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019. IEEE, 2019. 8692935.

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Harvard

Hentilä, H, Koivunen, V, Poor, HV & Blum, RS 2019, Secure Key Generation for Distributed Inference in IoT. in 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019., 8692935, IEEE, Conference on Information Sciences and Systems, Baltimore, United States, 20/03/2019. https://doi.org/10.1109/CISS.2019.8692935

APA

Hentilä, H., Koivunen, V., Poor, H. V., & Blum, R. S. (2019). Secure Key Generation for Distributed Inference in IoT. In 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019 [8692935] IEEE. https://doi.org/10.1109/CISS.2019.8692935

Vancouver

Hentilä H, Koivunen V, Poor HV, Blum RS. Secure Key Generation for Distributed Inference in IoT. In 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019. IEEE. 2019. 8692935 https://doi.org/10.1109/CISS.2019.8692935

Author

Hentilä, Henri ; Koivunen, Visa ; Poor, H. Vincent ; Blum, Rick S. / Secure Key Generation for Distributed Inference in IoT. 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019. IEEE, 2019.

Bibtex - Download

@inproceedings{027d42e069e14f6f9a234991675dfdb5,
title = "Secure Key Generation for Distributed Inference in IoT",
abstract = "A secret key generation scheme is proposed for generating keys to be used for one-time pad encryption. This type of encryption is suitable for e.g., short packet communication in distributed inference in IoT. The scheme exploits the phase of the channel fading coefficient in a Rayleigh fading channel to extract highly correlated key bits at two legitimate parties. Compared to other existing methods, the proposed scheme trades off higher bit error probabilities in the keys for lower error correction communication requirements. The bit error of generated keys is characterized via an approximate upper bound, which is shown to be fairly tight for reasonable signal-to-noise ratios.",
author = "Henri Hentil{\"a} and Visa Koivunen and Poor, {H. Vincent} and Blum, {Rick S.}",
year = "2019",
month = "4",
day = "16",
doi = "10.1109/CISS.2019.8692935",
language = "English",
booktitle = "2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019",
publisher = "IEEE",

}

RIS - Download

TY - GEN

T1 - Secure Key Generation for Distributed Inference in IoT

AU - Hentilä, Henri

AU - Koivunen, Visa

AU - Poor, H. Vincent

AU - Blum, Rick S.

PY - 2019/4/16

Y1 - 2019/4/16

N2 - A secret key generation scheme is proposed for generating keys to be used for one-time pad encryption. This type of encryption is suitable for e.g., short packet communication in distributed inference in IoT. The scheme exploits the phase of the channel fading coefficient in a Rayleigh fading channel to extract highly correlated key bits at two legitimate parties. Compared to other existing methods, the proposed scheme trades off higher bit error probabilities in the keys for lower error correction communication requirements. The bit error of generated keys is characterized via an approximate upper bound, which is shown to be fairly tight for reasonable signal-to-noise ratios.

AB - A secret key generation scheme is proposed for generating keys to be used for one-time pad encryption. This type of encryption is suitable for e.g., short packet communication in distributed inference in IoT. The scheme exploits the phase of the channel fading coefficient in a Rayleigh fading channel to extract highly correlated key bits at two legitimate parties. Compared to other existing methods, the proposed scheme trades off higher bit error probabilities in the keys for lower error correction communication requirements. The bit error of generated keys is characterized via an approximate upper bound, which is shown to be fairly tight for reasonable signal-to-noise ratios.

UR - http://www.scopus.com/inward/record.url?scp=85065211402&partnerID=8YFLogxK

U2 - 10.1109/CISS.2019.8692935

DO - 10.1109/CISS.2019.8692935

M3 - Conference contribution

BT - 2019 53rd Annual Conference on Information Sciences and Systems, CISS 2019

PB - IEEE

ER -

ID: 33939072