相关论文: Covert Cycle Stealing in a Single FIFO Server
Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate $\lambda$ packets per second for a time period $T$. Suppose that covert transmitter Alice wishes to…
Network traffic analysis reveals important information even when messages are encrypted. We consider active traffic analysis via flow fingerprinting by invisibly embedding information into packet timings of flows. In particular, assume…
Based on the covert communication framework, we consider a covert queueing problem that has a Markovian statistic. Willie jobs arrive according to a Poisson process and require service from server Bob. Bob does not have a queue for jobs to…
Covert communication conceals the existence of the transmission from a watchful adversary. We consider the fundamental limits for covert communications via packet insertion over packet channels whose packet timings are governed by a renewal…
Security and privacy are major concerns in modern communication networks. In recent years, the information theory of covert communications, where the very presence of the communication is undetectable to a watchful and determined adversary,…
Covert transmission is studied for an intelligent reflecting surface (IRS) aided communication system, where Alice aims to transmit messages to Bob without being detected by the warden Willie. Specifically, an IRS is used to increase the…
Covert communication is necessary when revealing the mere existence of a message leaks sensitive information to an attacker. Consider a network link where an authorized transmitter Jack sends packets to an authorized receiver Steve, and the…
In this paper, we investigate joint information theoretic secrecy and covert communication in a single-input multi-output (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that…
We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the…
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…
We investigate the possibility of "having someone carry out the work of executing a function for you, but without letting him learn anything about your input". Say Alice wants Bob to compute some known function f upon her input x, but wants…
This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…
We introduce a gossip-like protocol for covert message passing between Alice and Bob as they move in an area watched over by a warden Willie. The area hosts a multitude of Internet of (Battlefield) Things (Io\b{eta}T) objects. Alice and Bob…
In this paper, we study covert communication in wireless networks consisting of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a Poisson field of interferers. Bob and Willie are subject to uncertain shot noise due to…
The study of the fundamental limits of covert communications, where a transmitter Alice wants to send information to a desired recipient Bob without detection of that transmission by an attentive and capable warden Willie, has emerged…
Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter…
Hiding the wireless communication by transmitter Alice to intended receiver Bob from a capable and attentive adversary Willie has been widely studied under the moniker "covert communications". However, when such covert communication is done…
We consider a two-user secure computation problem in which Alice and Bob communicate interactively in order to compute some deterministic functions of the inputs. The privacy requirement is that each user should not learn any additional…
Work-stealing is a popular technique to implement dynamic load balancing in a distributed manner. In this approach, each process owns a set of tasks that have to be executed. The owner of the set can put tasks in it and can take tasks from…
In this work, we consider a scenario where two multiple-aperture legitimate nodes (Alice and Bob) communicate by means of Free-Space Optical (FSO) communication in the presence of a multiple-aperture eavesdropper (Eve), which is subject to…