Proves additivity of doubly minimized Petz Renyi mutual information for alpha in [1/2,2] and a novel duality plus additivity for the sandwiched version for alpha in [2/3, infinity] via Sion's minimax theorem.
A framework for Shannon cipher s under side-channel attacks: A strong converse and more
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Establishes necessary and sufficient conditions for reliable secure source coding under mutual information leakage bounds, proving a strong converse independent of those bounds and the existence of universal encryption schemes.
The direct exponent in binary quantum state discrimination for correlation detection equals the doubly minimized Petz Renyi mutual information for alpha in (1/2,1), while the strong converse exponent equals the doubly minimized sandwiched version for alpha in (1,infty).
citing papers explorer
-
Doubly minimized Petz and sandwiched Renyi mutual information: Properties
Proves additivity of doubly minimized Petz Renyi mutual information for alpha in [1/2,2] and a novel duality plus additivity for the sandwiched version for alpha in [2/3, infinity] via Sion's minimax theorem.
-
A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
Establishes necessary and sufficient conditions for reliable secure source coding under mutual information leakage bounds, proving a strong converse independent of those bounds and the existence of universal encryption schemes.
-
Doubly minimized Petz and sandwiched Renyi mutual information: Operational interpretation from binary quantum state discrimination
The direct exponent in binary quantum state discrimination for correlation detection equals the doubly minimized Petz Renyi mutual information for alpha in (1/2,1), while the strong converse exponent equals the doubly minimized sandwiched version for alpha in (1,infty).
- A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem