English
Related papers

Related papers: Physical layer insecurity

200 papers

Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that can be used to perform maximum likelihood decoding. It attempts to find the errors introduced by the channel by generating a sequence of possible error…

Information Theory · Computer Science 2022-07-26 Carlo Condo

We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a~function of the gap to…

Information Theory · Computer Science 2020-10-15 Arman Fazeli , S. Hamed Hassani , Marco Mondelli , Alexander Vardy

Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that has been recently proposed as a practical way to perform maximum likelihood decoding. It generates a sequence of possible error patterns and applies them…

Information Theory · Computer Science 2022-02-09 Carlo Condo

This paper addresses the establishment of secure communication links between smart-meters (Alice) and an aggregator (Bob) in the presence of an eavesdropper (Eve). The proposed scenario assumes: (i) MIMOME wiretap channel; (ii) transmit…

Information Theory · Computer Science 2015-11-23 Hirley Alves , Mauricio Tomé , Pedro H. J. Nardelli , Carlos H. M. de Lima , Matti Latva-aho

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance…

Information Theory · Computer Science 2020-12-15 Long Kong , Yun Ai , Lei Lei , Georges Kaddoum , Symeon Chatzinotas , Björn Ottersten

Ultra-reliable low-latency communication (URLLC), a major 5G New-Radio use case, is the key enabler for applications with strict reliability and latency requirements. These applications necessitate the use of short-length and high-rate…

Information Theory · Computer Science 2022-03-14 Syed Mohsin Abbas , Thibaud Tonnellier , Furkan Ercan , Marwan Jalaleddine , Warren J. Gross

To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels…

Information Theory · Computer Science 2023-04-18 Wei An , Muriel Médard , Ken R. Duffy

In physical layer security (PHY-security), the frequently observed high correlation between the main and wiretap channels can cause a significant loss of secrecy. This paper investigates a slow fading scenario, where a transmitter (Alice)…

Information Theory · Computer Science 2017-08-16 Shuai Han , Sai Xu , Weixiao Meng , Cheng Li

This letter studies an emerging wireless communication intervention problem at the physical layer, where a legitimate spoofer aims to spoof a malicious link from Alice to Bob, by replacing Alice's transmitted source message with its target…

Information Theory · Computer Science 2016-12-28 Jie Xu , Lingjie Duan , Rui Zhang

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

Parallelism has become a central concern in modern decoding frameworks aiming to meet stringent throughput and latency requirements. Guessing Random Additive Noise Decoding (GRAND) is a recently proposed decoding paradigm that tests…

Information Theory · Computer Science 2026-05-04 Li Wan , Huarui Yin , Wenyi Zhang

We obtain estimates for Eve's forgery probability, namely the probability that she is able to forge a message which Alice or Bob mistakenly accept over a noisy Quantum channel for generating a shared Quantum secret key. This probability is…

Quantum Physics · Physics 2026-03-10 Pete Rigas

Modern applications are driving demand for ultra-reliable low-latency communications, rekindling interest in the performance of short, high-rate error correcting codes. To that end, here we introduce a soft-detection variant of Guessing…

Information Theory · Computer Science 2021-06-16 Ken R. Duffy

Guessing random additive noise decoding (GRAND) is a code-agnostic decoding method that iteratively guesses the noise pattern affecting the received codeword. The number of noise sequences to test depends on the noise realization. Thus,…

Signal Processing · Electrical Eng. & Systems 2025-02-10 Filippo Christen , Darja Nonaca , Christoph Studer

Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through…

Information Theory · Computer Science 2023-08-11 Kevin Galligan , Peihong Yuan , Muriel Médard , Ken R. Duffy

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal…

Information Theory · Computer Science 2018-07-18 Linda Senigagliesi , Marco Baldi , Stefano Tomasin

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed approximate Maximum Likelihood (ML) decoding technique that can decode any linear error-correcting block code. Ordered Reliability Bits GRAND (ORBGRAND) is a powerful…

Information Theory · Computer Science 2021-05-18 Syed Mohsin Abbas , Thibaud Tonnellier , Furkan Ercan , Marwan Jalaleddine , Warren J. Gross

Extremely large-scale arrays (XL-arrays) have emerged as a promising technology to improve the spectrum efficiency and spatial resolution of future wireless systems. Different from existing works that mostly considered physical layer…

Signal Processing · Electrical Eng. & Systems 2025-05-06 Tianyu Liu , Changsheng You , Cong Zhou , Yunpu Zhang , Shiqi Gong , Heng Liu , Guangchi Zhang

The security of two-state quantum key distribution against individual attack is estimated when the channel has losses and noises. We assume that Alice and Bob use two nonorthogonal single-photon polarization states. To make our analysis…

Quantum Physics · Physics 2009-11-07 Kiyoshi Tamaki , Masato Koashi , Nobuyuki Imoto

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

Quantum Physics · Physics 2025-07-08 Pete Rigas