English
Related papers

Related papers: Reliable, Deniable, and Hidable Communication over…

200 papers

We study a distributed binary hypothesis testing (HT) problem with communication and security constraints, involving three parties: a remote sensor called Alice, a legitimate decision centre called Bob, and an eavesdropper called Eve, all…

Information Theory · Computer Science 2022-11-08 Sara Faour , Mustapha Hamad , Mireille Sarkiss , Michele Wigger

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

The coding problem for wiretap channels with causal channel state information available at the encoder and/or the decoder is studied under the strong secrecy criterion. This problem consists of two aspects: one is due to naive wiretap…

Information Theory · Computer Science 2019-07-30 Te Sun Han , Masahide Sasaki

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

This paper investigates the problem of source-channel coding for secure transmission with arbitrarily correlated side informations at both receivers. This scenario consists of an encoder (referred to as Alice) that wishes to compress a…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

This paper consider a new secure communication scene where a full-duplex transmitter (Alan) need to transmit confidential information to a half-duplex receiver (Bob), with a silent eavesdropper (Eve) that tries to eavesdrop the confidential…

Networking and Internet Architecture · Computer Science 2017-10-20 Xinyue Hu , Caihong Kai , Shengli Zhang , Zhongyi Guo , Jun Gao

We model the communication of narratives as a cheap-talk game under model uncertainty. The sender has private information about the true data generating process of publicly observable data. The receiver is uncertain about how to interpret…

Theoretical Economics · Economics 2025-07-09 Gerrit Bauch , Manuel Foerster

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 investigate the physical-layer security of indoor hybrid parallel power-line/wireless orthogonal-frequency division-multiplexing (OFDM) communication systems. We propose an artificial-noise (AN) aided scheme to enhance the system's…

Information Theory · Computer Science 2017-10-31 Ahmed El Shafie , Mohamed F. Marzban , Rakan Chabaan , Naofal Al-Dhahir

We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum…

Quantum Physics · Physics 2020-04-13 Riccardo Laurenza , Cosmo Lupo , Seth Lloyd , Stefano Pirandola

We investigate the possibility of eavesdropping on a quantum key distribution network by local sequential quantum unsharp measurement attacks by the eavesdropper. In particular, we consider a pure two-qubit state shared between two parties…

Quantum Physics · Physics 2023-12-08 Yash Wath , Hariprasad M , Freya Shah , Shashank Gupta

This article presents a novel method for establishing an information theoretically secure encryption key over wireless channels. It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise…

Information Theory · Computer Science 2024-02-08 Amir K. Khandani

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

Information Theory · Computer Science 2021-04-16 Vinayak Suresh , Eric Ruzomberka , David J. Love

We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if…

Quantum Physics · Physics 2007-05-23 Xi-Han Li , Fu-Guo Deng , Hong-Yu Zhou

With growing security threats to the evolving wireless systems, protecting user privacy becomes progressively challenging. Even if the transmitted information is encrypted and the potential wiretap channel is physically limited (e.g.…

Networking and Internet Architecture · Computer Science 2020-04-06 Xiao Lu , Ekram Hossain , Tania Shafique , Shaohan Feng , Hai Jiang , Dusit Niyato

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

We consider a family of quantum communication protocols involving $N$ partners. We demonstrate the existence of a link between the security of these protocols against individual attacks by the eavesdropper, and the violation of some Bell's…

Quantum Physics · Physics 2009-11-07 Valerio Scarani , Nicolas Gisin

Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its…

Quantum Physics · Physics 2015-05-13 P. S. Bourdon , E. Gerjuoy

Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

We discuss quantum key distribution protocols and their security analysis, considering a receiver-device-independent (RDI) model. The sender's (Alice's) device is partially characterized, in the sense that we assume bounds on the overlaps…