English
Related papers

Related papers: Secure Identification for Gaussian Channels and Id…

200 papers

The transmission of digital data is one of the principal tasks in modern wireless communication. Classically, the communication channel consists of one transmitter and one receiver; however, due to the constantly increasing demand in higher…

Information Theory · Computer Science 2015-01-08 Andrei Osipov

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , H. Vincent Poor

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by…

Information Theory · Computer Science 2016-11-17 Shabnam Shafiee , Nan Liu , Sennur Ulukus

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while…

Information Theory · Computer Science 2015-05-27 S. Ali. A. Fakoorian , A. Lee Swindlehurst

Common randomness (CR), as a resource, is not commonly exploited in existing practical communication systems. In the CR generation framework, both the sender and receiver aim to generate a common random variable observable to both, ideally…

Signal Processing · Electrical Eng. & Systems 2024-06-27 Rami Ezzine , Wafa Labidi , Christian Deppe , Holger Boche

We extend the recent analysis of the rate-reliability tradeoff in deterministic identification (DI) to general linear Gaussian channels, marking the first such analysis for channels with continuous output. Because DI provides a framework…

Information Theory · Computer Science 2026-02-13 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter

We propose a novel, Gaussian signaling mechanism for low probability of detection (LPD) communication systems with either single or multiple antennas. The new scheme is designed to allow the noncoherent detection of Gaussian-distributed…

Signal Processing · Electrical Eng. & Systems 2023-01-10 Yuma Katsuki , Giuseppe Thadeu Freitas de Abreu , Koji Ishibashi , Naoki Ishikawa

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any…

Information Theory · Computer Science 2013-07-10 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

Recent results on source-channel coding for secure transmission show that separation holds in several cases under some less-noisy conditions. However, it has also been proved through a simple counterexample that pure analog schemes can be…

Information Theory · Computer Science 2011-09-06 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…

Signal Processing · Electrical Eng. & Systems 2025-02-20 Hiroki Fukada , Hiroki Iimori , Chandan Pradhan , Szabolcs Malomsoky , Naoki Ishikawa

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's…

Quantum Physics · Physics 2007-05-23 R. Ahlswede , A. Winter

In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks…

Information Theory · Computer Science 2008-02-20 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel $(W_1,W_2)$ is proposed to achieve information-theoretic security with…

Cryptography and Security · Computer Science 2018-08-19 Dajiang Chen , Ning Zhang , Nan Cheng , Kuan Zhang , Kan Yang , Zhiguang Qin , Xuemin Shen

This work establishes that the physical layer can be used to perform information-theoretic authentication in additive white Gaussian noise channels, as long as the adversary is not omniscient. The model considered consists of an encoder,…

Information Theory · Computer Science 2021-11-12 Eric Graves , Allison Beemer , Jorg Kliewer , Oliver Kosut , Paul Yu

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel which consists of multiple relay-eavesdropper channels as…

Information Theory · Computer Science 2016-11-15 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…

Information Theory · Computer Science 2017-03-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos