English
Related papers

Related papers: Can Marton Coding Alone Ensure Individual Secrecy?

200 papers

We propose a new framework for determining the wiretap code rates of single-input single-output multi-antenna eavesdropper (SISOME) wiretap channels when the capacity of the eavesdropper's channel is not available at the transmitter. In our…

Information Theory · Computer Science 2016-09-01 Shihao Yan , Nan Yang , Giovanni Geraci , Robert Malaney , Jinhong Yuan

We consider the problem of covert communication over a state-dependent channel when the channel state is available either non-causally, causally, or strictly causally, either at the transmitter alone or at both transmitter and receiver.…

Information Theory · Computer Science 2021-05-24 Hassan ZivariFard , Matthieu R. Bloch , Aria Nosratinia

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…

Cryptography and Security · Computer Science 2013-01-23 Mohsen Bahrami , Ali Bereyhi , Mahtab Mirmohseni , Mohammad Reza Aref

Information leakage in Wyner's wiretap channel model is usually defined as the mutual information between the secret message and the eavesdropper's received signal. We define a new quantity called "conditional information leakage given the…

Information Theory · Computer Science 2019-01-28 Yutaka Jitsumatsu , Ukyo Michiwaki , Yasutada Oohama

This work addresses private communication with distributed systems in mind. We consider how to best use secret key resources and communication to transmit signals across a system so that an eavesdropper is least capable to act on the…

Cryptography and Security · Computer Science 2015-03-19 Paul Cuff

In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the…

Information Theory · Computer Science 2017-07-20 Chao Qi , Bin Dai , Xiaohu Tang

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…

Information Theory · Computer Science 2014-06-25 Kittipong Kittichokechai , Tobias J. Oechtering , Mikael Skoglund

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Ryutaroh Matsumoto

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the…

Information Theory · Computer Science 2014-08-15 Alejandro Cohen , Asaf Cohen

In this work, we focus on the classical optical channel having Poissonian statistical behavior and propose a novel secrecy coding-based physical layer protocol. Our protocol is different but complementary to both (computationally secure)…

Cryptography and Security · Computer Science 2022-04-26 Masahito Hayashi , Angeles Vazquez-Castro

Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol to transmit a secret without revealing it to external observers. This is a question of how large a…

Combinatorics · Mathematics 2021-05-20 Ragnar Freij-Hollanti , Olga Kuznetsova

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

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

We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund

We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the…

Information Theory · Computer Science 2016-11-17 Nir Weinberger , Neri Merhav

In this paper, we investigate methods for reducing the likelihood that a message transmitted between two multiantenna nodes is intercepted by an undetected eavesdropper. In particular, we focus on the judicious transmission of artificial…

Information Theory · Computer Science 2015-05-19 Amitav Mukherjee , A. Lee Swindlehurst

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck

This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are…

Information Theory · Computer Science 2016-11-17 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

We give a complete characterization of the correlated random coding secrecy capacity of arbitrarily varying wiretap channels (AVWCs). We apply two alternative strong secrecy criteria, which both lead to the same multi-letter formula. The…

Information Theory · Computer Science 2016-11-17 Moritz Wiese , Janis Nötzel , Holger Boche
‹ Prev 1 4 5 6 7 8 10 Next ›