activity
20202026
most citedA Design Framework for Strongly -Private Data Disclosure

32 citations · 35 across the 22 of their papers we have counts for

collaborators

29 papers

cs.IT2026

Exact Privacy--Distortion Design of Support-Constrained Randomized Response

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

Full-support local randomizers can incur unnecessary reporting distortion on ordered alphabets. We study randomized response whose output is restricted to a radius- neighborhood…

cs.IT2026

Residual-Information Generalization Bounds Under Selective Privacy: Extended Version

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

Information-theoretic generalization bounds usually control dependence on the task sample, whereas selective privacy may constrain only a different, private coordinate. We study i.…

cs.IT2026

Sparse Kernel Mechanisms for Locally Differentially Private Discrete Channels

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

We study sparse locally private discrete mechanisms generated by a nonnegative kernel and an input-dependent admissible output support. The support set is intentionally small relat…

cs.LG2026

Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy

Raghav Bongole, Amirreza Zamani, Tobias J. Oechtering +1

Minimax risk and regret are expectation-based criteria and do not capture rare but consequential failures. To address this concern, we develop a -explicit minimax-quantile theor…

cs.IT2026

Sparse Discrete Laplace and Gaussian Mechanisms under Local Differential Privacy

Amirreza Zamani, Sajad Daei, Parastoo Sadeghi +1

We study sparse locally private channels of the form where the admissible output set is allowed to depend on the private input …

cs.IT2026

Sparse Point-wise Privacy Leakage: Mechanism Design and Fundamental Limits

Amirreza Zamani, Sajad Daei, Parastoo Sadeghi +1

We study an information-theoretic privacy mechanism design problem, where an agent observes useful data that is arbitrarily correlated with sensitive data , and design discl…

cs.IT2026

Privacy-Utility Trade-offs Under Multi-Level Point-Wise Leakage Constraints

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

An information-theoretic privacy mechanism design is studied, where an agent observes useful data which is correlated with the private data . The agent wants to reveal the i…

cs.IT2025

An Information Geometric Approach to Fairness With Equalized Odds Constraint

Amirreza Zamani, Ayfer Özgür, Mikael Skoglund

We study the statistical design of a fair mechanism that attains equalized odds, where an agent uses some useful data (database) to solve a task . Since both and are…

cs.IT2025

On Information Theoretic Fairness With A Bounded Point-Wise Statistical Parity Constraint: An Information Geometric Approach

Amirreza Zamani, Ayfer Özgür, Mikael Skoglund

In this paper, we study an information-theoretic problem of designing a fair representation under a bounded point-wise statistical (demographic) parity constraint. More specificall…

cs.IT2025

Risk level dependent Minimax Quantile lower bounds for Interactive Statistical Decision Making

Raghav Bongole, Amirreza Zamani, Tobias J. Oechtering +1

Minimax risk and regret focus on expectation, missing rare failures critical in safety-critical bandits and reinforcement learning. Minimax quantiles capture these tails. Three str…

cs.IT2025

Information-Theoretic Fairness with A Bounded Statistical Parity Constraint

Amirreza Zamani, Abolfazl Changizi, Ragnar Thobaben +1

In this paper, we study an information-theoretic problem of designing a fair representation that attains bounded statistical (demographic) parity. More specifically, an agent uses…

cs.IT2025

An Information Geometric Approach to Local Information Privacy with Applications to Max-lift and Local Differential Privacy

Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund

We study an information-theoretic privacy mechanism design, where an agent observes useful data and wants to reveal the information to a user. Since the useful data is correlat…

cs.IT2024

Private Semantic Communications with Separate Blind Encoders

Amirreza Zamani, Mikael Skoglund

We study a semantic communication problem with a privacy constraint where an encoder consists of two separate parts, e.g., encoder 1 and encoder 2. The first encoder has access to…

cs.IT2024

Extended Functional Representation Lemma: A Tool For Privacy, Semantic Representation, Caching, and Compression Design

Amirreza Zamani, Mikael Skoglund

This paper provides an overview of a problem in information-theoretic privacy mechanism design, addressing two scenarios in which private data is either observable or hidden. In ea…

eess.SP2024

Near-Field ISAC in 6G: Addressing Phase Nonlinearity via Lifted Super-Resolution

Sajad Daei, Amirreza Zamani, Saikat Chatterjee +2

Integrated sensing and communications (ISAC) is a promising component of 6G networks, fusing communication and radar technologies to facilitate new services. Additionally, the use…

cs.IT2024

Improving Achievability of Cache-Aided Private Variable-Length Coding with Zero Leakage

Amirreza Zamani, Mikael Skoglund

A statistical cache-aided compression problem with a privacy constraint is studied, where a server has access to a database of files, , each of size bits and…

cs.IT2024

On Information Theoretic Fairness: Compressed Representations With Perfect Demographic Parity

Amirreza Zamani, Borja Rodríguez-Gálvez, Mikael Skoglund

In this article, we study the fundamental limits in the design of fair and/or private representations achieving perfect demographic parity and/or perfect privacy through the lens o…

cs.IT2024

Multi-Task Private Semantic Communication

Amirreza Zamani, Sajad Daei, Tobias J. Oechtering +1

We study a multi-task private semantic communication problem, in which an encoder has access to an information source arbitrarily correlated with some latent private data. A user h…

cs.IT2023

Private Variable-Length Coding with Non-zero Leakage

Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund

A private compression design problem is studied, where an encoder observes useful data , wishes to compress it using variable length code and communicates it through an unsecure…

cs.IT2023★ 2 cited

Private Variable-Length Coding with Zero Leakage

Amirreza Zamani, Tobias J. Oechtering, Deniz Gündüz +1

A private compression design problem is studied, where an encoder observes useful data , wishes to compress it using variable length code and communicates it through an unsecure…

cs.IT2023

Private Variable-Length Coding with Sequential Encoder

Amirreza Zamani, Tobias J. Oechtering, Deniz Gündüz +1

A multi-user private data compression problem is studied. A server has access to a database of files, , each of size bits and is connected to an encoder. The…

cs.IT2023

New Privacy Mechanism Design With Direct Access to the Private Data

Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund

The design of a statistical signal processing privacy problem is studied where the private data is assumed to be observable. In this work, an agent observes useful data , which…

cs.IT2023

Cache-Aided Variable-Length Coding with Perfect Privacy

Amirreza Zamani, Mikael Skoglund

A cache-aided compression problem with perfect privacy is studied, where a server has access to a database of files, , each of size bits. The server is conne…

cs.IT2022★ 1 cited

On the Privacy-Utility Trade-off With and Without Direct Access to the Private Data

Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund

We study an information theoretic privacy mechanism design problem for two scenarios where the private data is either observable or hidden. In each scenario, we first consider boun…