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.
Us- ing /u1D711( /u1D45B ), Ψ ( /u1D45B )first encodes /u1D472into ˜/u1D43E /u1D45A = /u1D711( /u1D45B )( /u1D472)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.