English
Related papers

Related papers: Arbitrarily Varying Wiretap Channels with Type Con…

200 papers

We address the applicability of quantum key distribution with continuous-variable coherent and squeezed states over long-distance satellite-based links, considering low Earth orbits and taking into account strong varying channel…

Quantum Physics · Physics 2021-01-25 Ivan Derkach , Vladyslav C Usenko

This letter investigates the artificial noise aided beamforming design for secure simultaneous wireless information and power transfer (SWIPT) in a two-tier downlink heterogeneous network, where one femtocell is overlaid with one macrocell…

Information Theory · Computer Science 2017-07-25 Bin Li , Zesong Fei , Zheng Chu

A continuous aperture array (CAPA)-based secure communication system is investigated, where a base station equipped with a CAPA transmits signals to a legitimate user under the existence of an eavesdropper. For improving the secrecy…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Jingjing Zhao , Haowen Song , Xidong Mu , Kaiquan Cai , Yanbo Zhu , Yuanwei Liu

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…

Information Theory · Computer Science 2012-01-20 Nevroz Şen , Fady Alajaji , Serdar Yüksel , Giacomo Como

Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side…

Information Theory · Computer Science 2007-07-13 Neri Merhav

Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper…

Information Theory · Computer Science 2015-09-24 Willie K Harrison , Steven W. McLaughlin

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

In network communications, information transmission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of…

Information Theory · Computer Science 2015-05-07 Xuan Guang , Jiyong Lu , Fang-Wei Fu

We design a new secure transmission scheme in the relay wiretap channel where a source communicates with a destination through a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. For the sake of…

Information Theory · Computer Science 2016-05-06 Chenxi Liu , Nan Yang , Robert Malaney , Jinhong Yuan

Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the…

Information Theory · Computer Science 2013-01-10 Meysam Mirzaee , Soroush Akhlaghi

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

We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers.…

Information Theory · Computer Science 2010-07-01 Xiangyun Zhou , Matthew R. McKay

We study a wiretap channel model where the sender has $M$ transmit antennas and there are two groups consisting of $J_1$ and $J_2$ receivers respectively. Each receiver has a single antenna. We consider two scenarios. First we consider the…

Information Theory · Computer Science 2010-03-09 Ashish Khisti

We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, we handle the…

Information Theory · Computer Science 2023-01-24 Vidhi Rana , Remi A. Chou

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…

Information Theory · Computer Science 2017-03-08 Ligong Wang

This paper presents a novel algorithm for building an automatic speech recognition (ASR) model with imperfect training data. Imperfectly transcribed speech is a prevalent issue in human-annotated speech corpora, which degrades the…

Computation and Language · Computer Science 2023-06-05 Dongji Gao , Matthew Wiesner , Hainan Xu , Leibny Paola Garcia , Daniel Povey , Sanjeev Khudanpur

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the…

Information Theory · Computer Science 2016-11-15 Tzu-Han Chou , Vincent Y. F. Tan , Stark C. Draper

We derive a lower bound on the capacity of classical-quantum arbitrarily varying wiretap channel and determine the capacity of the classicalquantum arbitrarily varying wiretap channel with channel state information at the transmitter.

Information Theory · Computer Science 2014-01-17 Vladimir Blinovsky , Minglai Cai

Secrecy issues of free-space optical links realizing information theoretically secure communications as well as high transmission rates are discussed. We numerically study secrecy communication rates of optical wiretap channel based on…

Information Theory · Computer Science 2015-09-15 Hiroyuki Endo , Te Sun Han , Takao Aoki , Masahide Sasaki

The zero-error channel capacity is the maximum asymptotic rate that can be reached with error probability exactly zero, instead of a vanishing error probability. The nature of this problem, essentially combinatorial rather than…

Information Theory · Computer Science 2020-01-13 Nicolas Charpenay , Maël Le Treust
‹ Prev 1 8 9 10 Next ›