activity
20192026
most citedSecure Source Coding Resilient Against Compromised Users via an Access Structure

1 citations · 2 across the 9 of their papers we have counts for

collaborators

11 papers

quant-ph2026

From Classical to Quantum Channels: Achieving Positive Covert Rates

Hassan ZivariFard, Xiaodong Wang, Alexei Ashikhmin

In this paper, we study the conditions under which covert communication at positive rates is feasible over discrete memoryless classical, classical-quantum, and quantum channels. F…

cs.IT2026

Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters

Hassan ZivariFard, Xiaodong Wang

We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters.…

cs.IT2026

Keyless Covert Communication Over Quantum MACs with General Message Sets

Hassan ZivariFard, Xiaodong Wang

We study covert classical communication over quantum multiple-access channels (MACs) with general message sets. Specifically, we consider a fully quantum MAC with arbitrary message…

cs.IT2025

Covert Communication and Key Generation Over Quantum State-Dependent Channels

Hassan ZivariFard, Rémi A. Chou, Xiaodong Wang

We study covert communication and covert secret key generation with positive rates over quantum state-dependent channels. Specifically, we consider fully quantum state-dependent ch…

cs.IT2025

Resource Allocation for Positive-Rate Covert Communications Using Optimization and Deep Reinforcement Learning

Yubo Zhang, Hassan ZivariFard, Xiaodong Wang

We aim to achieve keyless covert communication with a positive-rate in Rayleigh block-fading channels. Specifically, the transmitter and the legitimate receiver are assumed to have…

cs.IT2025

Covert Communication Over a Quantum MAC with a Helper

Hassan ZivariFard, Rémi A. Chou, Xiaodong Wang

We study covert classical communication over a quantum multiple-access channel (MAC) with a helper. Specifically, we consider three transmitters, where one transmitter helps the ot…

cs.IT2025

Covert Communication via Action-Dependent States

Hassan ZivariFard, Xiaodong Wang

This paper studies covert communication over channels with ADSI when the state is available either non-causally or causally at the transmitter. Covert communication refers to relia…

cs.IT2024★ 1 cited

Secure Source Coding Resilient Against Compromised Users via an Access Structure

Hassan ZivariFard, Remi A. Chou

Consider a source and multiple users who observe the independent and identically distributed (i.i.d.) copies of correlated Gaussian random variables. The source wishes to compress…

cs.IT2023

Private Information Retrieval with Private Noisy Side Information

Hassan ZivariFard, Remi A. Chou

Consider Private Information Retrieval (PIR), where a client wants to retrieve one file out of files that are replicated in different servers and the client selection must…

cs.IT2020★ 1 cited

Keyless Covert Communication via Channel State Information

Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia

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 th…

cs.IT2019

Two-Multicast Channel with Confidential Messages

Hassan ZivariFard, Matthieu Bloch, Aria Nosratinia

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers…