English
Related papers

Related papers: The Computational Wiretap Channel

200 papers

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

The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender $X$, a legitimate quantum receiver $B$, and a quantum eavesdropper $E$. The goal of a private communication protocol that uses…

Quantum Physics · Physics 2017-09-19 Mark M. Wilde

Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…

Quantum Physics · Physics 2007-05-23 Pablo Arrighi

Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state $\rho_{ABE}$, such that Alice possesses the $A$ systems and Bob…

Quantum Physics · Physics 2020-02-12 Kunal Sharma , Eyuri Wakakuwa , Mark M. Wilde

Various wireless sensor network applications involve the computation of a pre-defined function of the measurements without the need for reconstructing each individual sensor reading. Widely-considered examples of such functions include the…

Information Theory · Computer Science 2012-10-16 Mario Goldenbaum , Sławomir Stańczak

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new…

Information Theory · Computer Science 2010-10-06 Masahito Hayashi , Ryutaroh Matsumoto

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

We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if $F \subseteq \mathbb{R}^n$ is a closed set represented so that the distance function $x \mapsto d(x,F)$ can be…

Logic · Mathematics 2026-04-07 Andrea Brun , Guido Gherardi , Alberto Marcone

The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is "noisier" than the channel from sender to receiver. It…

Information Theory · Computer Science 2015-03-20 Mihir Bellare , Stefano Tessaro , Alexander Vardy

An artificial-noise (AN)-aided beamformer specific to correlated main and wiretap channels is designed in this paper. We consider slow-fading multiple-input-single-output (MISO) wiretap channels with a passive single-antenna eavesdropper,…

Information Theory · Computer Science 2019-07-03 Shuai Han , Sai Xu , Weixiao Meng , Lei He

The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve…

Information Theory · Computer Science 2016-10-31 Anatoly Khina , Yuval Kochman , Ashish Khisti

Security against eavesdropping is one of the key concerns in the design of any communication system. Many common considerations of the security of a wireless communication channel rely on comparing the signal level measured by Bob (the…

Ray tracing is increasingly utilized in wireless system simulations to estimate channel paths. In large-scale simulations with complex environments, ray tracing at high resolution can be computationally demanding. To reduce the computation,…

Signal Processing · Electrical Eng. & Systems 2026-02-02 Ruibin Chen , Jayadev Joy , Yaqi Hu , Mingsheng Yin , Marco Mezzavilla , Sundeep Rangan

Uncertain wiretap channels are introduced. Their zero-error secrecy capacity is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with…

In this paper, we study the problem of obtaining $1$-of-$2$ string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from…

Cryptography and Security · Computer Science 2016-04-21 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of…

Information Theory · Computer Science 2015-03-17 Eran Hof , Shlomo Shamai

Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Aslan Tchamkerten , Gregory Wornell

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , 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

Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate $\lambda$ packets per second for a time period $T$. Suppose that covert transmitter Alice wishes to…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Dennis Goeckel , Don Towsley , Amir Houmansadr
‹ Prev 1 4 5 6 7 8 10 Next ›