Diagonal EP under variance-profile Gaussian matrices produces Gaussian-process dynamics with profile-dependent memory instead of conventional scalar state evolution.
A framework for Shannon cipher s under side-channel attacks: A strong converse and more
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
Establishes necessary and sufficient conditions for secure variable-length source coding under mutual information leakage bounded by δ, proving independence from δ (strong converse) and existence of universal schemes for discrete memoryless sources.
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.
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
-
Gaussian-Process Dynamics of Diagonal Expectation Propagation under Variance-Profile Gaussian Measurements
Diagonal EP under variance-profile Gaussian matrices produces Gaussian-process dynamics with profile-dependent memory instead of conventional scalar state evolution.
-
A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
Establishes necessary and sufficient conditions for secure variable-length source coding under mutual information leakage bounded by δ, proving independence from δ (strong converse) and existence of universal schemes for discrete memoryless sources.
-
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).