English
Related papers

Related papers: Unique Information and Secret Key Decompositions

200 papers

Age-of-information (AoI) is a newly proposed performance metric of information freshness. It differs from the traditional delay metric, because it is destination centric and measures the time that elapsed since the last received fresh…

Networking and Internet Architecture · Computer Science 2019-01-15 Rajat Talak , Sertac Karaman , Eytan Modiano

The minimum rate needed to accurately approximate a product distribution based on an unnormalized informational divergence is shown to be a mutual information. This result subsumes results of Wyner on common information and Han-Verd\'{u} on…

Information Theory · Computer Science 2013-05-14 Jie Hou , Gerhard Kramer

This paper is on developing some computer-assisted proof methods involving non-classical inequalities for Shannon entropy. Two areas of the applications of information inequalities are studied: Secret sharing schemes and hat guessing games.…

Information Theory · Computer Science 2023-10-19 Emirhan Gürpınar

Entanglement and magic are among the most fundamental properties unique to quantum systems. Each quantity captures a different aspect of non-classical behavior, and each can be regarded as a resource within its own operational setting.…

Quantum Physics · Physics 2025-12-19 Mao Kaneyasu , Yoshihiko Hasegawa

Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the…

Information Theory · Computer Science 2017-11-13 Johannes Rauh

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$)…

Information Theory · Computer Science 2024-06-24 Mohammad Amin Zarrabian , Parastoo Sadeghi

We introduce a bottleneck method for learning data representations based on information deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The…

Information Theory · Computer Science 2020-11-05 Pradeep Kr. Banerjee , Guido Montúfar

Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the aggregate. Intuitively, one must come to terms with what…

Information Theory · Computer Science 2016-08-15 Paul Cuff , Lanqing Yu

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

The index coding problem is a problem of efficient broadcasting with side-information. We look at the uniprior index coding problem, in which the receivers have disjoint side-information symbols and arbitrary demand sets. Previous work has…

Information Theory · Computer Science 2017-01-24 Vijaya Kumar Mareedu , Prasad Krishnan

Differentially private (DP) optimization has been widely adopted as a standard approach to provide rigorous privacy guarantees for training datasets. DP auditing verifies whether a model trained with DP optimization satisfies its claimed…

Cryptography and Security · Computer Science 2025-07-08 Ruixuan Liu , Li Xiong

The issue of interference and which-way information is addressed in the context of 3-slit interference experiments. A new path distinguishability ${\mathcal D_Q}$ is introduced, based on Unambiguous Quantum State Discrimination (UQSD). An…

Quantum Physics · Physics 2015-08-28 Mohd Asad Siddiqui , Tabish Qureshi

In this correspondence, we correct an erroneous result on the achievability part of the R\'enyi common information with order $1+s\in(1,2]$ in [1]. The new achievability result (upper bound) of the R\'enyi common information no longer…

Information Theory · Computer Science 2020-02-18 Lei Yu , Vincent Y. F. Tan

We propose an operational measure of information leakage in a non-stochastic setting to formalize privacy against a brute-force guessing adversary. We use uncertain variables, non-probabilistic counterparts of random variables, to construct…

Information Theory · Computer Science 2021-01-29 Farhad Farokhi , Ni Ding

Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual…

Information Theory · Computer Science 2020-05-21 David McAllester , Karl Stratos

We evaluate the asymptotics of equivocations, their exponents as well as their second-order coding rates under various R\'{e}nyi information measures. Specifically, we consider the effect of applying a hash function on a source and we…

Information Theory · Computer Science 2016-07-06 Masahito Hayashi , Vincent Y. F. Tan

This work addresses private communication with distributed systems in mind. We consider how to best use secret key resources and communication to transmit signals across a system so that an eavesdropper is least capable to act on the…

Cryptography and Security · Computer Science 2015-03-19 Paul Cuff

The rate-privacy function is defined in \cite{Asoodeh} as a tradeoff between privacy and utility in a distributed private data system in which both privacy and utility are measured using mutual information. Here, we use maximal correlation…

Information Theory · Computer Science 2015-10-09 Shahab Asoodeh , Fady Alajaji , Tamás Linder

None of the BROJA information decomposition measures $\mbox{SI}, \mbox{CI}, \mbox{UIy}, \mbox{UIz}$ are convex or concave over the probability simplex. In this paper, we provide formulas for the sub-gradient and super-gradients of any of…

Optimization and Control · Mathematics 2018-02-13 Abdullah Makkeh , Dirk Oliver Theis

We derive uniformly most powerful (UMP) tests for simple and one-sided hypotheses for a population proportion within the framework of Differential Privacy (DP), optimizing finite sample performance. We show that in general, DP hypothesis…

Statistics Theory · Mathematics 2019-04-02 Jordan Awan , Aleksandra Slavkovic