English
Related papers

Related papers: Secure Lossy Source-Channel Wiretapping with Side …

200 papers

Secure communication in a potentially malicious environment becomes more and more important. The arbitrarily varying wiretap channel (AVWC) provides information theoretical bounds on how much information can be exchanged even in the…

Information Theory · Computer Science 2022-04-15 Carsten Rudolf Janda , Moritz Wiese , Eduard A. Jorswieck , Holger Boche

A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver,…

Information Theory · Computer Science 2011-02-18 Ninoslav Marina , Hideki Yagi , H. Vincent Poor

We introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under…

Information Theory · Computer Science 2007-07-16 Emin Martinian , Gregory W. Wornell , Ram Zamir

Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly…

Information Theory · Computer Science 2018-03-12 Zhihong Liu , Jiajia Liu , Yong Zeng , Li Yang , Jianfeng Ma

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to…

Information Theory · Computer Science 2019-09-12 Jaume del Olmo , Javier R. Fonollosa

We study the problem of generating a shared secret key between two terminals in a joint source-channel setup -- the sender communicates to the receiver over a discrete memoryless wiretap channel and additionally the terminals have access to…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

The basic problem of secure bidirectional relaying involves two users who want to exchange messages via an intermediate "honest-but-curious" relay node. There is no direct link between the users, all communication must take place via the…

Information Theory · Computer Science 2015-06-09 Shashank Vatedka , Navin Kashyap

Two legitimate parties, referred to as Alice and Bob, wish to generate secret keys from the wireless channel in the presence of an eavesdropper, referred to as Eve, in order to use such keys for encryption and decryption. In general, the…

Information Theory · Computer Science 2020-02-19 Nasser Aldaghri , Hessam Mahdavifar

Zero-delay transmission of a Gaussian source over an additive white Gaussian noise (AWGN) channel is considered with a one-bit analog-to-digital converter (ADC) front end and a correlated side information at the receiver. The design of the…

Information Theory · Computer Science 2019-12-18 Morteza Varasteh , Borzoo Rassouli , Osvaldo Simeone , Deniz Gunduz

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

The construction of a channel code by using a source code with decoder side information is introduced. For the construction, any pair of encoder and decoder is available for a source code with decoder side information. A…

Information Theory · Computer Science 2017-04-18 Jun Muramatsu , Shigeki Miyake

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of…

Information Theory · Computer Science 2012-11-20 Theodoros K. Dikaliotis , Hongyi Yao , Tracey Ho , Michelle Effros , Joerg Kliewer

We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information (SCCSI) and lossy source coding with…

Information Theory · Computer Science 2015-03-19 Benjamin G. Kelly , Aaron B. Wagner

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent…

Information Theory · Computer Science 2011-11-09 Ryutaroh Matsumoto , Masahito Hayashi

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as…

Information Theory · Computer Science 2020-06-02 Seung-Hyun Nam , Si-Hyeon Lee

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…

Cryptography and Security · Computer Science 2020-01-22 Ke Li , Don Towsley , Dennis Goeckel

Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit…

Cryptography and Security · Computer Science 2019-09-30 Zhihong Liu , Jiajia Liu , Yong Zeng , Jianfeng Ma

We develop a one-out-of-two oblivious transfer protocol over the binary-input additive white Gaussian noise (BI-AWGN) channel using polar codes. The scheme uses two decoder views linked by automorphisms of the polar transform and publicly…

Information Theory · Computer Science 2026-02-13 Pin-Hsun Lin , Hadi Aghaee , Christian Deppe , Eduard A. Jorswieck , Holger Boche
‹ Prev 1 8 9 10 Next ›