English
Related papers

Related papers: State Amplification Subject To Masking Constraints

200 papers

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and…

Information Theory · Computer Science 2010-04-07 Somayeh Salimi , Mahmoud Salmasizadeh , Mohammad Reza Aref

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

In order to communicate a message over a noisy channel, a sender (Alice) uses an error-correcting code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever there is at most a small constant fraction of…

Information Theory · Computer Science 2024-07-10 Meghal Gupta , Venkatesan Guruswami , Mihir Singhal

We investigate the privacy amplification problem in which Eve can observe the uniform binary source through a binary erasure channel (BEC) or a binary symmetric channel (BSC). For this problem, we derive the so-called expurgation exponent…

Information Theory · Computer Science 2016-11-17 Shun Watanabe

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We consider a wiretap channel with an eavesdropper (Eve) and an honest but curious relay (Ray). Ray and the destination (Bob) are full-duplex (FD) devices. Since we aim at not revealing information on the secret message to the relay, we…

Information Theory · Computer Science 2016-06-15 Stefano Tomasin

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the…

Information Theory · Computer Science 2023-09-27 Yingbo Hua

Entanglement shared between two seperated parties could not be increased without transmitting quantum system. We suggest the project to gain entanglement shared between Alice and Bob by transmitting quantum system and a nem scheme to…

Quantum Physics · Physics 2007-05-23 Yi-Xin Chen , Dong Yang

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

Quantum Physics · Physics 2025-07-08 Pete Rigas

This paper investigates the impact of authentication on effective capacity (EC) of an underwater acoustic (UWA) channel. Specifically, the UWA channel is under impersonation attack by a malicious node (Eve) present in the close vicinity of…

Cryptography and Security · Computer Science 2020-02-13 Waqas Aman , Zeeshan Haider , S. Waqas H. Shah , M. Mahboob Ur Rahman , Octavia A. Dobre

Optical networks are vulnerable to physical layer attacks; wiretappers can improperly receive messages intended for legitimate recipients. Our work considers an aspect of this security problem within the domain of multimode fiber (MMF)…

Cryptography and Security · Computer Science 2016-11-17 Eva C. Song , Emina Soljanin , Paul Cuff , H. Vincent Poor , Kyle Guan

The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message…

Information Theory · Computer Science 2021-08-10 Te Sun Han , Masahide Sasaki

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

We consider a group of $m$ trusted and authenticated nodes that aim to create a shared secret key $K$ over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel…

Cryptography and Security · Computer Science 2016-04-11 Mahdi Jafari Siavoshani , Shaunak Mishra , Christina Fragouli , Suhas N. Diggavi

We study oblivious transfer (OT) between Alice and Bob in the presence of an eavesdropper Eve over a degraded wiretapped binary erasure channel from Alice to Bob and Eve. In addition to the privacy goals of oblivious transfer between Alice…

Information Theory · Computer Science 2016-11-17 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

Action-dependent channels model scenarios in which transmission takes place in two successive phases. In the first phase, the encoder selects an "action" sequence, with the twofold aim of conveying information to the receiver and of…

Information Theory · Computer Science 2012-07-24 Behzad Ahmadi , Osvaldo Simeone

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2022-08-16 Onur Günlü , Matthieu Bloch , Rafael F. Schaefer , Aylin Yener

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-05-01 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This paper considers a scenario in which an Alice-Bob pair wishes to communicate in secret in the presence of an active Eve, who is capable of jamming as well as eavesdropping in Full-Duplex (FD) mode. As countermeasure, Bob also operates…

Information Theory · Computer Science 2016-12-07 Lingxiang Li , Athina P. Petropulu , Zhi Chen

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2023-03-22 Onur Günlü , Matthieu R. Bloch , Rafael F. Schaefer , Aylin Yener