Analysis of short blocklength codes for secrecy

W K. Harrison, D Sarmento, J P. Vilela… - EURASIP Journal on …, 2018 - Springer
In this paper, we provide secrecy metrics applicable to physical-layer coding techniques with
finite blocklengths over Gaussian and fading wiretap channel models and analyze their …

Implications of coding layers on physical-layer security: A secrecy benefit approach

WK Harrison, E Beard, S Dye, E Holmes, K Nelson… - Entropy, 2019 - mdpi.com
In this work, we consider the pros and cons of using various layers of keyless coding to
achieve secure and reliable communication over the Gaussian wiretap channel. We define a …

Physical-layer secrecy performance in finite blocklength case

C Cao, H Li, Z Hu, W Liu… - 2015 IEEE Global …, 2015 - ieeexplore.ieee.org
For physical-layer secrecy performance, existing studies only focus on coding schemes that
can achieve the secrecy capacity. However, finite blocklength penalty could be fatal for …

Coding for secrecy: An overview of error-control coding techniques for physical-layer security

WK Harrison, J Almeida, MR Bloch… - IEEE Signal …, 2013 - ieeexplore.ieee.org
While secrecy in communication systems has historically been obtained through
cryptographic means in the upper layers, recent research efforts have focused on the …

Generating a binary symmetric channel for wiretap codes

WK Harrison, T Fernandes… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
In this paper, we fill a void between information theoretic security and practical coding over
the Gaussian wiretap channel using a three-stage encoder/decoder technique. Security is …

Secrecy coding for the binary symmetric wiretap channel

Y Chen, AJ Han Vinck - Security and Communication Networks, 2011 - Wiley Online Library
In this paper, we investigate the binary symmetric wiretap channel. We show that the secrecy
capacitycan be achieved by using random linear codes. The random coding scheme gives …

Short blocklength wiretap channel codes via deep learning: Design and performance evaluation

V Rana, RA Chou - IEEE Transactions on Communications, 2023 - ieeexplore.ieee.org
We design short blocklength codes for the Gaussian wiretap channel under information-
theoretic security guarantees. Our approach consists in decoupling the reliability and …

Achieving secrecy: Capacity vs. resolvability

MR Bloch - 2011 IEEE International Symposium on Information …, 2011 - ieeexplore.ieee.org
In this paper, we investigate the nature of the coding mechanisms required to ensure strong
secrecy over wiretap channels. Specifically, we analyze the limitations of capacity-based …

Achievable second-order coding rates for the wiretap channel

VYF Tan - 2012 IEEE International Conference on …, 2012 - ieeexplore.ieee.org
We derive lower bounds to the second-order coding rates for the wiretap channel. The
decoding error probability and the information leakage measured in terms of the variational …

Coding schemes for achieving strong secrecy at negligible cost

RA Chou, BN Vellambi, MR Bloch… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We study the problem of achieving strong secrecy over wiretap channels at negligible cost,
in the sense of maintaining the overall communication rate of the same channel without …