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.
Strong converse for distributed source coding with encryption using correlated keys
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative 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.
citing papers explorer
-
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.
-
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.