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

Lecture notes in networks and systems

Secrecy Capacity of Symmetric Keys Generated by Quantising Channel Metrics Over a Fading Channel

L. Srividya, Pattipati Naga Sudha

Published Nov 2, 2019• 1 citation
Publisher
DOI
10.1007/978-3-030-33846-6_45

Related papers

Impact of Correlation on Secrecy Capacity over SIMOME Fading Channels

Thang Van Nguyen, Hyundong Shin

한국통신학회 학술대회논문집•Jun 1, 2014•0 citations

On the outage probability of secrecy capacity in arbitrarily-distributed fading channels

Juan Manuel Romero Jerez, Gerardo Gómez, F. Javier López‐Martínez

We present a general and compact framework for the analysis of the wireless information-theoretic security of arbitrarily-distributed fading channels. We show that performance metrics such as the outage probability of the secrecy capacity, the probability of strictly positive secrecy capacity and the e-outage secrecy capacity can be compactly expressed in terms of the moment generating function (MGF) of the fading models. Using this approach, we can study the effect of considering different propagation conditions for the legitimate and eavesdropper's fading links, which accommodate to many practical scenarios.

European Wireless Conference•May 20, 2015•11 citations

An Empirical Upper Bound on Secrecy Capacity of Multipath Fading Channels

Sima Azizi, Arash Komaee

Extraction of shared secret keys from random state of multipath fading channels is a growing trend in symmetric cryptography. In this context, an essential question is the rate at which the secret keys can be extracted (number of bits per unit of time). This question is addressed in this paper by establishing an empirical upper bound on the extraction rate of the secret bits. A coherent set of signal processing techniques is proposed to numerically estimate this bound from empirical data generated by commercial radios. It is emphasized to solely rely on empirical data rather than mathematical models of fading channels.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2018•2 citations

A Broadcast Approach to Fading Channels under Secrecy Constraints

Ivana Marić, Shlomo Shitz Shamai, Osvaldo Simeone

Cambridge University Press eBooks•Mar 31, 2022•0 citations

Wireless Information-Theoretic Security - Part II: Practical Implementation

Matthieu R. Bloch, João Barros, Miguel R. D. Rodrigues +1 more

In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protocol uses a four-step procedure to secure communications: establish common randomness via an opportunistic transmission, perform message reconciliation, establish a common key via privacy amplification, and use of the key. We introduce a new reconciliation procedure that uses multilevel coding and optimized low density parity check codes which in some cases comes close to achieving the secrecy capacity limits established in Part I. Finally, we develop new metrics for assessing average secure key generation rates and show that our protocol is effective in secure key renewal.

arXiv:cs/0611121•Nov 24, 2006•13 citations

Secret key generation over a Nakagami-m fading channel with correlated eavesdropping channel

Shixun Gong, Xiaofeng Tao, Na Li +2 more

Science China Information Sciences•Aug 29, 2022•2 citations
We present a general and compact framework for the analysis of the wireless information-theoretic security of arbitrarily-distributed fading channels. We show that performance metrics such as the outage probability of the secrecy capacity, the probability of strictly positive secrecy capacity and the e-outage secrecy capacity can be compactly expressed in terms of the moment generating function (MGF) of the fading models. Using this approach, we can study the effect of considering different propagation conditions for the legitimate and eavesdropper's fading links, which accommodate to many practical scenarios.
Extraction of shared secret keys from random state of multipath fading channels is a growing trend in symmetric cryptography. In this context, an essential question is the rate at which the secret keys can be extracted (number of bits per unit of time). This question is addressed in this paper by establishing an empirical upper bound on the extraction rate of the secret bits. A coherent set of signal processing techniques is proposed to numerically estimate this bound from empirical data generated by commercial radios. It is emphasized to solely rely on empirical data rather than mathematical models of fading channels.
In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protocol uses a four-step procedure to secure communications: establish common randomness via an opportunistic transmission, perform message reconciliation, establish a common key via privacy amplification, and use of the key. We introduce a new reconciliation procedure that uses multilevel coding and optimized low density parity check codes which in some cases comes close to achieving the secrecy capacity limits established in Part I. Finally, we develop new metrics for assessing average secure key generation rates and show that our protocol is effective in secure key renewal.