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 …

We consider two fundamental tasks in quantum information theory, data compression with
quantum side information, as well as randomness extraction against quantum side …

This paper investigates the maximal secret communication rate over a wiretap channel
subject to reliability and secrecy constraints at a given blocklength. New achievability and …

We explicitly construct random hash functions for privacy amplification (extractors) that
require smaller random seed lengths than the previous literature, and still allow efficient …

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability
and secrecy constraints at a given blocklength. New achievability and converse bounds are …

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

We study quantum soft covering and privacy amplification against quantum side information.
The former task aims to approximate a quantum state by sampling from a prior distribution …

Motivated by the desirability of universal composability, we analyze in terms of L1
distinguishability the task of secret key generation from a joint random variable. Under this …

We consider privacy amplification against quantum side information by using regular
random binning as an effective extractor. For constant-type sources, we obtain error …

Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information
theory and cryptography. In typical bi-and multi-partite problems, however, some of the sub …