A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
University of Electro-Communications（电波大学）
Yasutada Oohama, Bagus Santoso
备注：
7 pages, 5 figures. This is an extended version of the paper submitted for presentation in ISITA 2026, which will be held at Okinawa, Japan form November 1 to 4 in 2026. The submitted paper has several errors. We correct those errors in this arXiv paper. arXiv admin note: substantial text overlap with arXiv:2605.04720
In this paper we consider the variable-length lossless source coding for discrete memoryless sources. We proposes a new encryption framework for securely transmitting codewords over a noiseless channel. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant $δ\in (0,\infty)$, thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant $δ\in (0,\infty)$, demonstrating that we have the strong converse coding theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.
Strong Converse Theorem for Source Encryption under Side-Channel Attacks
我们感兴趣的是研究在侧信道攻击下使用对称密钥的源加密的安全性。本文提出了一种基于对称密钥的信源加密的一般框架，该框架适用于基于对称密钥的\emph{any}信源加密和针对秘密密钥的\emph{any}类侧信道攻击。我们还提出了一个新的安全标准下的强保密侧信道攻击，这是一个自然的扩展互信息，即，\emph{the maximum conditional mutual information between the plaintext and the ciphertext given the adversarial key leakage, where the maximum is taken over all possible plaintext distribution}。在这个新的标准下，我们成功地制定了速率区域，这是必要和充分条件，即使在侧信道攻击有安全的传输。此外，我们还证明了另一个理论结果，我们的新的安全标准，这可能是有趣的，在其本身的权利：在离散的无记忆源的情况下，没有完美的秘密下的侧信道攻击的标准安全标准，即，普通的互信息在这个新的安全标准中是可实现的，而不需要实现完全保密，尽管我们的新的安全标准比标准安全标准更严格。
On the Strong Converse Exponent and Error Exponent of the Classical Soft Covering
University of Michigan（密歇根大学）；Universität zu Köln（科隆大学）；Universitat Autònoma de Barcelona（巴塞罗那自治大学）；Institute for Advanced Study, Technische Universität München（慕尼黑工业大学高等研究院）
CRYPTO-MINE: Cryptanalysis via Mutual Information Neural Estimation
University of Illinois Urbana-Champaign（伊利诺伊大学厄巴纳-香槟分校）；Massachusetts Institute of Technology（麻省理工学院）；Technion（以色列理工学院）；Clemson University（克莱姆森大学）；MIT Lincoln Laboratory（麻省理工学院林肯实验室）
Two-Parameter Rényi Information Quantities with Applications to Privacy Amplification and Soft Covering
Institute for Advanced Study in Mathematics, School of Mathematics, Harbin Institute of Technology（哈尔滨工业大学数学学院高等研究院）；Harbin Institute of Technology（哈尔滨工业大学）；School of Statistics and Data Science, LPMC, KLMDASR, and LEBPS, Nankai University（南开大学统计与数据科学学院）
Intelligent Wiretap Code Design: Exploiting Wireless Endogenous Security via Information Theory and Deep Learning Integration
Xidian University（西安电子科技大学）；Information Engineering University（信息工程大学）；Peng Cheng Laboratory（鹏城实验室）；National Mobile Communications Research Laboratory, Southeast University（东南大学移动通信国家重点实验室）；James Watt School of Engineering, University of Glasgow（格拉斯哥大学詹姆斯·瓦特工程学院）；China Industrial Control Systems Cyber Emergency Response Team（中国工业控制系统网络安全应急响应中心）；School of Electrical Engineering and Telecommunications, University of New South Wales（新南威尔士大学电气与电信工程学院）；Faculty of Electrical Engineering and Computer Science at the Technical University of Berlin（柏林工业大学电气与计算机科学学院）
