English
Related papers

Related papers: Physical layer insecurity

200 papers

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

Information Theory · Computer Science 2014-10-28 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Nicola Laurenti , Stefano Tomasin , Francesco Renna

We establish that during the execution of any Guessing Random Additive Noise Decoding (GRAND) algorithm, an interpretable, useful measure of decoding confidence can be evaluated. This measure takes the form of a log-likelihood ratio (LLR)…

Information Theory · Computer Science 2023-08-11 Ken R. Duffy , Muriel Medard

We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in discrete channels with or without memory. In it, the receiver rank orders noise sequences from most likely to least likely. Subtracting noise from the received…

Information Theory · Computer Science 2019-08-12 Ken R. Duffy , Jiange Li , Muriel Médard

The design and implementation of error correcting codes has long been informed by two fundamental results: Shannon's 1948 capacity theorem, which established that long codes use noisy channels most efficiently; and Berlekamp, McEliece, and…

Information Theory · Computer Science 2024-10-30 Ken R. Duffy , Muriel Médard , Wei An

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

Shannon introduced the classic model of a cryptosystem in 1949, where Eve has access to an identical copy of the cyphertext that Alice sends to Bob. Shannon defined perfect secrecy to be the case when the mutual information between the…

Information Theory · Computer Science 2024-09-10 Angeles Vazquez-Castro , Masahito Hayashi

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2011-10-05 Hessam Mahdavifar , Alexander Vardy

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed universal decoding algorithm for linear error correcting codes. Since GRAND does not depend on the structure of the code, it can be used for any code encountered in…

Information Theory · Computer Science 2020-07-16 Syed Mohsin Abbas , Thibaud Tonnellier , Furkan Ercan , Warren J. Gross

In this paper we propose a two-way protocol of physical layer security using the method of privacy amplification against eavesdroppers. First we justify our proposed protocol by analyzing the physical layer security provided by the classic…

Information Theory · Computer Science 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the…

Information Theory · Computer Science 2008-06-01 Chung Chan

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

Information Theory · Computer Science 2009-08-27 Aly El Gamal , Moustafa Youssef , Hesham El Gamal

Guessing Random Additive Noise Decoding (GRAND) is a code-agnostic decoding technique for short-length and high-rate channel codes. GRAND tries to guess the channel noise by generating test error patterns (TEPs), and the sequence of the…

Information Theory · Computer Science 2022-12-02 Syed Mohsin Abbas , Marwan Jalaleddine , Warren J. Gross

This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ("amplify") the channel state sequence to Bob while "masking" it from Eve. The extent…

Information Theory · Computer Science 2015-10-27 O. Ozan Koyluoglu , Rajiv Soundararajan , Sriram Vishwanath

We consider a wiretap channel with an eavesdropper (Eve) and an honest but curious relay (Ray). Ray and the destination (Bob) are full-duplex (FD) devices. Since we aim at not revealing information on the secret message to the relay, we…

Information Theory · Computer Science 2016-06-15 Stefano Tomasin

In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap channel. In this paper, we consider a general class of polar…

Information Theory · Computer Science 2024-07-02 Hessam Mahdavifar , Fariba Abbasi

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed Maximum Likelihood (ML) decoding technique. Irrespective of the structure of the error correcting code, GRAND tries to guess the noise that corrupted the codeword in…

Information Theory · Computer Science 2021-08-31 Syed Mohsin Abbas , Marwan Jalaleddine , Warren J. Gross

Guessing random additive noise decoding (GRAND) is a noise-centric decoding method, which is suitable for ultra-reliable low-latency communications, as it supports high-rate error correction codes that generate short-length codewords. GRAND…

Information Theory · Computer Science 2022-12-12 Ioannis Chatzigeorgiou , Francisco A. Monteiro

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

Information Theory · Computer Science 2018-01-23 Amirsina Torfi , Sobhan Soleymani , Siamak Aram , Vahid Tabataba Vakili

We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data packets if a sufficient number of error-free coded packets are gathered. The…

Information Theory · Computer Science 2024-02-13 Ioannis Chatzigeorgiou , Dmitry Savostyanov
‹ Prev 1 2 3 10 Next ›