Amirreza Zamani

Dr. Amirreza Zamani

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 December 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
AZAmirreza Zamani
Amirreza Zamani
Tobias OechteringTobias Oechtering
Tobias Oechtering
MSMikael Skoglund
Mikael Skoglund
We study a statistical signal processing privacy problem, where an agent observes useful data $Y$ and wants to reveal the information to a user. Since the useful data is correlated with the private data $X$ , the agent employs a privacy mechanism to generate data $U$ that can be released. We study the privacy mechanism design that maximizes the revealed information about $Y$ while satisfying a strong $\ell _{1}$ -privacy criterion. When a sufficiently small leakage is allowed, we show that the optimizer distributions of the privacy mechanism design problem have a specific geometry, i.e., they are perturbations of fixed vector distributions. This geometrical structure allows us to use a local approximation of the conditional entropy. By using this approximation the original optimization problem can be reduced to a linear program so that an approximate solution for the optimal privacy mechanism can be easily obtained. The main contribution of this work is to consider a non-invertible leakage matrix with non-zero leakage. In our first example, inspired by a watermark application, we first demonstrate the accuracy of the approximation. Then, we employ different measures for utility and privacy leakage to compare the privacy-utility trade-off using our approach with other methods. In particular, we show that by allowing small leakage, significant utility can be achieved using our method compared to the case where no leakage is allowed. In the second and third examples which are based on the MNIST data set and medical applications, we illustrate the suggested design for disclosed data $U$ . It has been shown that the letters of $Y$ which are disclosing more information about $X$ are combined (randomized) to produce a new letter of $U$ .

21 January 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
AZAmirreza Zamani
Amirreza Zamani
Tobias OechteringTobias Oechtering
Tobias Oechtering
MSMikael Skoglund
Mikael Skoglund
In this paper, we study a stochastic disclosure control problem using information-theoretic methods. The useful data to be disclosed depend on private data that should be protected. Thus, we design a privacy mechanism to produce new data which maximizes the disclosed information about the useful data under a strong χ 2 -privacy criterion. For sufficiently small leakage, the privacy mechanism design problem can be geometrically studied in the space of probability distributions by a local approximation of the mutual information. By using methods from Euclidean information geometry, the original highly challenging optimization problem can be reduced to a problem of finding the principal right-singular vector of a matrix, which characterizes the optimal privacy mechanism. In two extensions we first consider a scenario where an adversary receives a noisy version of the user's message and then we look for a mechanism which finds U based on observing X, maximizing the mutual information between U and Y while satisfying the privacy criterion on U and Z under the Markov chain (Z, Y)-X-U.

19 October 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
AZAmirreza Zamani
Amirreza Zamani
Tobias OechteringTobias Oechtering
Tobias Oechtering
MSMikael Skoglund
Mikael Skoglund
We study an information theoretic privacy mechanism design problem for two scenarios where the private data is either observable or hidden. In the hidden private data scenario, an agent observes useful data $Y$ that is correlated with private data $X$ , and generate disclosed data $U$ which maximizes the revealed information about $Y$ while satisfying a bounded privacy leakage constraint. Considering the other scenario, the agent has additional access to $X$ . To design the privacy mechanism, we first extend the Functional Representation Lemma and Strong Functional Representation Lemma by relaxing the independence condition and thereby allowing a certain leakage. We then find lower and upper bounds on the privacy-utility trade-offs in both scenarios. In particular, for the case where no leakage is allowed and $X$ is observable, our upper and lower bounds improve previous bounds. Considering bounded mutual information as privacy constraint and the observable private data scenario we show that if the common information and mutual information between $X$ and $Y$ are equal, then the attained upper bound is tight. Finally, the privacy-utility trade-off with prioritized private data is studied where part of $X$ is more private than the remaining part.

24 January 2025 in Entropy
Verified
Journal Article
Open access
PDF file
AZAmirreza Zamani
Amirreza Zamani
MSMikael Skoglund
Mikael Skoglund
A private compression design problem is studied, where an encoder observes useful data Y, wishes to compress them using variable-length code, and communicates them through an unsecured channel. Since Y are correlated with the private attribute X, the encoder uses a private compression mechanism to design an encoded message C and sends it over the channel. An adversary is assumed to have access to the output of the encoder, i.e., C, and tries to estimate X. Furthermore, it is assumed that both encoder and decoder have access to a shared secret key W. In this work, the design goal is to encode message C with the minimum possible average length that satisfies certain privacy constraints. We consider two scenarios: 1. zero privacy leakage, i.e., perfect privacy (secrecy); 2. non-zero privacy leakage, i.e., non-perfect privacy constraint. Considering the perfect privacy scenario, we first study two different privacy mechanism design problems and find upper bounds on the entropy of the optimizers by solving a linear program. We use the obtained optimizers to design C. In the two cases, we strengthen the existing bounds: 1. |X|≥|Y|; 2. The realization of (X,Y) follows a specific joint distribution. In particular, considering the second case, we use two-part construction coding to achieve the upper bounds. Furthermore, in a numerical example, we study the obtained bounds and show that they can improve existing results. Finally, we strengthen the obtained bounds using the minimum entropy coupling concept and a greedy entropy-based algorithm. Considering the non-perfect privacy scenario, we find upper and lower bounds on the average length of the encoded message using different privacy metrics and study them in special cases. For achievability, we use two-part construction coding and extended versions of the functional representation lemma. Lastly, in an example, we show that the bounds can be asymptotically tight.

27 November 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
AZAmirreza Zamani
Amirreza Zamani
MSMikael Skoglund
Mikael Skoglund
A cache-aided compression problem with perfect privacy is studied, where a server has access to a database of N files, (Y1, ..., YN), each of size F bits. The server is connected to K users through a shared link, where each user has access to a local cache of size MF bits. In the placement phase, the server fills the users’ caches without prior knowledge of their future demands, while the delivery phase takes place after the users send their demands to the server. We assume that each file Yi is arbitrarily correlated with a private attribute X, and an adversary is assumed to have access to the shared link. The users and the server have access to a shared secret key W. The goal is to design the cache contents and the delivered message C such that the average length of C is minimized, while satisfying: i. The response C does not disclose any information about X, i.e., X and C are statistically independent yielding I(X; C) = 0, which corresponds to the perfect privacy constraint; ii. User i is able to decode its demand, Ydi, by using its local cache Zi, delivered message C, and the shared secret key W. Due to the correlation of database with the private attribute, existing codes for cache-aided delivery do not fulfill the perfect privacy constraint. Indeed, in this work, we propose a lossless variable-length coding scheme that combines privacy-aware compression with coded caching techniques. In particular, we use two-part code construction and Functional Representation Lemma. Furthermore, we propose an alternative coding scheme based on the minimum entropy coupling concept and a greedy entropy-based algorithm. We show that the proposed scheme improves the previous results obtained by Functional Representation Lemma. Considering two special cases we improve both coding schemes using the common information concept. Finally, we compare the proposed schemes in numerical examples and provide an application considering an encoder with limited buffer size.

1 July 2026 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AZAmirreza Zamani
Amirreza Zamani
ACAbolfazl Changizi
Abolfazl Changizi
MSMikael Skoglund
Mikael Skoglund