This tutorial reviews fundamental contributions to information security. An integrative
viewpoint is taken that explains the security metrics, including secrecy, privacy, and others …

Abstract We study the Unadjusted Langevin Algorithm (ULA) for sampling from a probability
distribution $\nu= e^{-f} $ on $\R^ n $. We prove a convergence guarantee in Kullback …

After being introduced by Shannon as a measure of disorder and unavailable information,
the notion of entropy has found its applications in a broad range of scientific disciplines. In …

Given two random variables X and Y, an operational approach is undertaken to quantify the
“leakage” of information from X to Y. The resulting measure L (X→ Y) is called maximal …

The Rényi entropy of general order unifies the well-known Shannon entropy with several
other entropy notions, like the min-entropy or collision entropy. In contrast to the Shannon …

Common information is ubiquitous in information theory and related areas such as
theoretical computer science and discrete probability. However, because there are multiple …

This paper gives upper and lower bounds on the minimum error probability of Bayesian M-
ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order …

Recently a new quantum generalization of the Rényi divergence and the corresponding
conditional Rényi entropies was proposed. Here, we report on a surprising relation between …

We establish a general connection between entropic uncertainty relations, Einstein-
Podolsky-Rosen steering, and joint measurability. Specifically, we construct steering …

We consider information theoretic secret key (SK) agreement and secure function
computation by multiple parties observing correlated data, with access to an interactive …