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.
Available: https://www.mdpi.com/1099-4 300/21/5/469 A/p.pc/p.pc/e.pc/n.pc/d.pc/i.pc/x.pc A
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.