On Caching with Finite Blocklength Coding for Secrecy over the Binary Erasure Wiretap Channel

Harrison, Willie K.; Shoushtari, Morteza

doi:10.1109/wts51064.2021.9433710

Cited by 2 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later, in [3], Ozarow and Wyner introduced the wiretap channel type II, wherein the eavesdropper is able to select the positions of revealed bits, and they provided a secure coding technique based on coset codes. These channel models have been studied by many authors from the perspectives of security, reliability, and coding construction [4][5][6]. In recent years, coset coding has emerged as an important coding technique in the context of the finite-blocklength regime [7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code

Shoushtari,

Harrison

2023

Entropy

Self Cite

View full text Add to dashboard Cite

Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to characterize the performance of nested linear codes. In addition, the rank properties of generator and parity-check matrices can also precisely characterize their security performance. Despite this, finding optimal nested linear secrecy codes remains a challenge in the finite-blocklength regime, often requiring brute-force search methods. This paper investigates the properties of nested linear codes, introduces a new representation of the relative generalized Hamming weight, and proposes a novel method for finding the best nested linear secrecy code for the binary erasure wiretap channel by working from the worst nested linear secrecy code in the dual space. We demonstrate that our algorithm significantly outperforms the brute-force technique in terms of speed and efficiency.

show abstract