English
Related papers

Related papers: Secret Communication with Feedback

200 papers

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

We consider reversely-degraded secure-communication channels, for which the secrecy capacity is zero if there is no channel feedback. Specifically, we focus on a seeded modular code design for the block-fading Gaussian wiretap channel with…

Information Theory · Computer Science 2026-05-13 Yingyao Zhou , Natasha Devroye , Onur Günlü

In this paper we propose a feedback scheme for transmitting secret messages between two legitimate parties, over an eavesdropped communication link. Relative to Wyner's traditional encoding scheme \cite{wyner1}, our feedback-based encoding…

Information Theory · Computer Science 2009-09-29 George Amariucai , Shuangqing Wei

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical…

Information Theory · Computer Science 2026-01-15 Sheng Su , Yuhan Yang , Chao Qi , Xuan He , Bin Dai , Xiaohu Tang

In this paper, the k-th order autoregressive moving average (ARMA(k)) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of the signals in both forward and feedback…

Information Theory · Computer Science 2018-01-23 Chong Li , Yingbin Liang , H. Vincent Poor , Shlomo Shamai

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the…

Information Theory · Computer Science 2016-11-17 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

We present simple coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted feedback. More specifically, we consider a framework…

Information Theory · Computer Science 2007-07-13 Nuno C Martins , Tsachy Weissman

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel…

Information Theory · Computer Science 2019-03-26 Germán Bassi , Pablo Piantanida , Shlomo Shamai

In this paper we introduce a fundamental principle for optimal communication over general memoryless channels in the presence of noiseless feedback, termed posterior matching. Using this principle, we devise a (simple, sequential) generic…

Information Theory · Computer Science 2010-08-11 Ofer Shayevitz , Meir Feder

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers…

Information Theory · Computer Science 2009-03-24 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to the…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using…

Information Theory · Computer Science 2019-04-09 Lan V. Truong , Hirosuke Yamamoto

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

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

The Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the point-to-point white Gaussian channel with feedback, is secure by itself and also achieves the secrecy capacity of the Gaussian wiretap channel with feedback, i.e., the…

Information Theory · Computer Science 2021-11-19 Bin Dai , Chong Li , Yingbin Liang , Zheng Ma , Shlomo Shamai

A novel private communication framework is proposed where privacy is induced by transmitting over a channel instances of linear inverse problems that are identifiable to the legitimate receiver but unidentifiable to an eavesdropper. The gap…

Information Theory · Computer Science 2024-07-24 Maxime Ferreira Da Costa , Jianxiu Li , Urbashi Mitra

Revealing expressions of secret-key capacity (SKC) based on data sets from Gaussian MIMO channel probing are presented. It is shown that Maurer's upper and lower bounds on SKC coincide when the used data sets are produced from one-way…

Information Theory · Computer Science 2025-07-21 Yingbo Hua , Ahmed Maksud
‹ Prev 1 2 3 10 Next ›