Zobrazeno 1 - 10
of 362
pro vyhledávání: '"Sadeghi, Parastoo"'
Matroid theory is fundamentally connected with index coding and network coding problems. In fact, the reliance of linear index coding and network coding rates on the characteristic of a field has been demonstrated by using the two well-known matroid
Externí odkaz:
http://arxiv.org/abs/2407.12215
This paper explores the implications of guaranteeing privacy by imposing a lower bound on the information density between the private and the public data. We introduce an operationally meaningful privacy measure called pointwise maximal cost (PMC) an
Externí odkaz:
http://arxiv.org/abs/2407.01167
Autor:
Biswas, Sayan, Dras, Mark, Faustini, Pedro, Fernandes, Natasha, McIver, Annabelle, Palamidessi, Catuscia, Sadeghi, Parastoo
Within the machine learning community, reconstruction attacks are a principal attack of concern and have been identified even in federated learning, which was designed with privacy preservation in mind. In federated learning, it has been shown that a
Externí odkaz:
http://arxiv.org/abs/2406.13569
Information density and its exponential form, known as lift, play a central role in information privacy leakage measures. $\alpha$-lift is the power-mean of lift, which is tunable between the worst-case measure max-lift ($\alpha=\infty$) and more rel
Externí odkaz:
http://arxiv.org/abs/2406.06990
This paper introduces a novel class of PICOD($t$) problems referred to as $g$-group complete-$S$ PICOD($t$) problems. It constructs a multi-stage achievability scheme to generate pliable index codes for group complete PICOD problems when $S = \{s\}$
Externí odkaz:
http://arxiv.org/abs/2405.07151
For $\tilde{f}(t) = \exp(\frac{\alpha-1}{\alpha}t)$, this paper proposes a $\tilde{f}$-mean information gain measure. R\'{e}nyi divergence is shown to be the maximum $\tilde{f}$-mean information gain incurred at each elementary event $y$ of channel o
Externí odkaz:
http://arxiv.org/abs/2405.00423
Wireless data communications are always facing the risk of eavesdropping and interception. Conventional protection solutions which are based on encryption may not always be practical as is the case for wireless IoT networks or may soon become ineffec
Externí odkaz:
http://arxiv.org/abs/2403.10342
We examine the relationship between privacy metrics that utilize information density to measure information leakage between a private and a disclosed random variable. Firstly, we prove that bounding the information density from above or below in turn
Externí odkaz:
http://arxiv.org/abs/2402.12967
This paper proposes an $\alpha$-leakage measure for $\alpha\in[0,\infty)$ by a cross entropy interpretation of R{\'{e}}nyi entropy. While R\'{e}nyi entropy was originally defined as an $f$-mean for $f(t) = \exp((1-\alpha)t)$, we reveal that it is als
Externí odkaz:
http://arxiv.org/abs/2401.15202
Autor:
Torkamani, Sahel, Ebrahimi, Javad B., Sadeghi, Parastoo, D'Oliveira, Rafael G. L., Médard, Muriel
We present the notion of \emph{reasonable utility} for binary mechanisms, which applies to all utility functions in the literature. This notion induces a partial ordering on the performance of all binary differentially private (DP) mechanisms. DP mec
Externí odkaz:
http://arxiv.org/abs/2310.20486