Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Vehicular Technology Conference

Analysis of Information Reconciliation in Secret Key Agreement from the AWGN Channel

Kana Deguchi, Motohiko Isaka

Published May 1, 2014• 2 citations
Publisher

Abstract

We analyze the error performance of coding scheme that is found in the protocol for secret key agreement based on the Gaussian channel. The approach is regarded as the Slepian-Wolf coding or the source coding with side information at the decoder. One remarkable feature of the coding in the key agreement is that two parties may extract the set of reliable signals before Slepian-Wolf coding is performed. We derive a tight upper bound on the error probability of this coding scheme, which allows us to quantify the effect of signal extraction.

DOI
10.1109/vtcspring.2014.7022831

Related papers

Approximate performance bound for coding in secret key agreement from the Gaussian channel

Kana Deguchi, Motohiko Isaka

We analyze a coding scheme used in secret key agreement based on noisy resource for physical layer security. We discuss approximate performance bound for a variant of asymmetric Slepian-Wolf coding system, or source coding with side information at the decoder. Numerical results indicate that the derived bound provides accurate prediction of error probability when noisy resource is the binary-input Gaussian channel.

IEEE Wireless Communications and Networking Conference•Mar 1, 2015•0 citations

Comparison of Short Blocklength Slepian-Wolf Coding for Key Reconciliation

Mahdi Shakiba-Herfeh, Arsenia Chorti

In this work, we focus on Slepian-Wolf (SW) coding in the short blocklength for reconciliation in secret key generation and physical unclonable functions (PUF). In the problem formulation, two legitimate parties wish to generate a common secret key from a noisy observation of a common random source in the presence of a passive eavesdropper. We consider three different families of codes for key reconciliation. All the selected codes show promising performances in information transmission in the short blocklength regime. We implement and compare the performance of the codes for SW reconciliation in the terms of reliability and decoding complexity for different blocklengths.

arXiv:2103.11423•IEEE Statistical Signal Processing Workshop (SSP)•Jul 11, 2021•13 citations

Slepian-Wolf Coding for Reconciliation of Physical Layer Secret Keys

Xiaojun Sun, Xiaofu Wu, Chunming Zhao +2 more

In this paper, we show how to compute the Slepian-Wolf lower bound for the reconciliation of physical layer secret keys between two radio terminals. Two coding approaches, including the syndrome method and the parity method, have been proven to require the same number of bits exchanged between two terminals for the reconciliation in the noiseless environment. We also present a practical coding approach based on LDPC codes, and the gap between the practical approach and the Slepian-Wolf bound is given.

IEEE Wireless Communications and Networking Conference•Apr 1, 2010•17 citations

Secure rate-adaptive reconciliation

David Elkouss, Jesus Martinez-Mateo, Vicente Martin

We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede and Csiszár, the channel-type model with wiretapper, we study a protocol based on error correcting codes. The protocol can be adapted to changes in the communication channel extending the original source. The efficiency of the reconciliation is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice's and Bob's sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.

arXiv:1007.0904•International Symposium on Information Theory and its Applications•Oct 1, 2010•22 citations

Secret Key Agreement by LLR Thresholding and Syndrome Feedback over AWGN Channel

Stefano Tomasin, Francesco Trentini, Nicola Laurenti

In this paper we propose novel advantage distillation and reconciliation approaches for secret key agreement (SKA) over additive white Gaussian noise (AWGN) (possibly fading) channels, using binary phase shift keying (BPSK) constellations. For advantage distillation Bob selects bits having an absolute log-likelihood ratio (LLR) larger than some threshold. For reconciliation, Alice transmits the syndrome of the selected bits with respect to a globally pre-shared forward error correcting (FEC) code. We show that the syndrome transmission does not diminish the advantage of Bob over Eve on the key knowledge, thus being an efficient solution. For the proposed scheme we derive both a lower bound on the achievable secret key rate with ideal wiretap coding, and the effective throughput achieved by using practical codes.

IEEE Communications Letters•Jan 1, 2014•11 citations

Quantization and LLR computation for physical layer security

Oana Graur, Nazia Islam, Alexandra Filip +1 more

The problem of key reconciliation based on Low-Density Parity-Check (LDPC) codes and Slepian-Wolf coding for physical layer key generation is investigated.When using the channel-state-information (CSI) of a reciprocal wireless channel for key generation between two legitimate users, independent noise components, quantization, and synchronization errors at the end nodes give rise to key differences that need to be corrected by sending side information.We provide a comparison of three different quantization schemes in terms of key disagreement rate and output probability distributions and present the loglikelihood formulations required by a soft decision LDPC decoder to perform key reconciliation, for the investigated quantization methods.

•Jan 1, 2016•2 citations
We analyze the error performance of coding scheme that is found in the protocol for secret key agreement based on the Gaussian channel. The approach is regarded as the Slepian-Wolf coding or the source coding with side information at the decoder. One remarkable feature of the coding in the key agreement is that two parties may extract the set of reliable signals before Slepian-Wolf coding is performed. We derive a tight upper bound on the error probability of this coding scheme, which allows us to quantify the effect of signal extraction.
In this work, we focus on Slepian-Wolf (SW) coding in the short blocklength for reconciliation in secret key generation and physical unclonable functions (PUF). In the problem formulation, two legitimate parties wish to generate a common secret key from a noisy observation of a common random source in the presence of a passive eavesdropper. We consider three different families of codes for key reconciliation. All the selected codes show promising performances in information transmission in the short blocklength regime. We implement and compare the performance of the codes for SW reconciliation in the terms of reliability and decoding complexity for different blocklengths.
In this paper, we show how to compute the Slepian-Wolf lower bound for the reconciliation of physical layer secret keys between two radio terminals. Two coding approaches, including the syndrome method and the parity method, have been proven to require the same number of bits exchanged between two terminals for the reconciliation in the noiseless environment. We also present a practical coding approach based on LDPC codes, and the gap between the practical approach and the Slepian-Wolf bound is given.
We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede and Csiszár, the channel-type model with wiretapper, we study a protocol based on error correcting codes. The protocol can be adapted to changes in the communication channel extending the original source. The efficiency of the reconciliation is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice's and Bob's sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed.
In this paper we propose novel advantage distillation and reconciliation approaches for secret key agreement (SKA) over additive white Gaussian noise (AWGN) (possibly fading) channels, using binary phase shift keying (BPSK) constellations. For advantage distillation Bob selects bits having an absolute log-likelihood ratio (LLR) larger than some threshold. For reconciliation, Alice transmits the syndrome of the selected bits with respect to a globally pre-shared forward error correcting (FEC) code. We show that the syndrome transmission does not diminish the advantage of Bob over Eve on the key knowledge, thus being an efficient solution. For the proposed scheme we derive both a lower bound on the achievable secret key rate with ideal wiretap coding, and the effective throughput achieved by using practical codes.
The problem of key reconciliation based on Low-Density Parity-Check (LDPC) codes and Slepian-Wolf coding for physical layer key generation is investigated.When using the channel-state-information (CSI) of a reciprocal wireless channel for key generation between two legitimate users, independent noise components, quantization, and synchronization errors at the end nodes give rise to key differences that need to be corrected by sending side information.We provide a comparison of three different quantization schemes in terms of key disagreement rate and output probability distributions and present the loglikelihood formulations required by a soft decision LDPC decoder to perform key reconciliation, for the investigated quantization methods.