The necessary and sufficient condition for reliable and secure source encryption with mutual information leakage bounded by δ and error probability by ε is independent of ε and δ, establishing a strong converse theorem along with the existence of universal encryption schemes that work for arbitrary源
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
A secure source coding framework is developed with a strong converse theorem under mutual information leakage bounds, showing conditions independent of error and leakage tolerances, and proving universal schemes exist for arbitrary distributions.
citing papers explorer
-
A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
The necessary and sufficient condition for reliable and secure source encryption with mutual information leakage bounded by δ and error probability by ε is independent of ε and δ, establishing a strong converse theorem along with the existence of universal encryption schemes that work for arbitrary源
-
A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
A secure source coding framework is developed with a strong converse theorem under mutual information leakage bounds, showing conditions independent of error and leakage tolerances, and proving universal schemes exist for arbitrary distributions.