[论文解读] The Inevitability of Side-Channel Leakage in Encrypted Traffic

Guangjie Liu, Guang Chen+1 more|arXiv (Cornell University)|Feb 15, 2026

Internet Traffic Analysis and Secure E-voting被引用 0

一句话总结

本论文构建一个信息论框架，证明在效率约束下加密流量中的旁通信道泄露是不可避免的，并推导出观察特征与语义变量之间互信息的下界。它在一个效率优先设置中建立了可区分语义的旁通信道存在定理。

ABSTRACT

The widespread adoption of TLS 1.3 and QUIC has rendered payload content invisible, shifting traffic analysis toward side-channel features. However, rigorous justification for why side-channel leakage is inevitable in encrypted communications has been lacking. This paper establishes a strict foundation from information theory by constructing a formal model \(Σ=(Γ,Ω)\), where \(Γ=(A,Π,Φ,N)\) describes the causal chain of application generation, protocol encapsulation, encryption transformation, and network transmission, while \(Ω\) characterizes observation capabilities. Based on composite channel structure, data processing inequality, and Lipschitz statistics propagation, we propose and prove the Side-Channel Existence Theorem: for distinguishable semantic pairs, under conditions including mapping non-degeneracy (\(\mathbb{E}[d(z_P,z_N)\mid X]\le C\)), protocol-layer distinguishability (expectation difference \(\ge\barΔ\)), Lipschitz continuity, observation non-degeneracy (\(ρ>0\)), and propagation condition (\(C<\barΔ/2L_φ\)), the mutual information \(I(X;Y)\) is strictly positive with explicit lower bound. The corollary shows that in efficiency-prioritized systems, leakage is inevitable when at least one application pair is distinguishable. Three factors determine the boundary: non-degeneracy constant \(C\) constrained by efficiency, distinguishability \(\barΔ\) from application diversity, and \(ρ\) from analyst capabilities. This establishes the first rigorous information-theoretic foundation for encrypted traffic side channels, providing verifiable predictions for attack feasibility, quantifiable benchmarks for defenses, and mathematical basis for efficiency-privacy tradeoffs.

研究动机与目标

• 激发并形式化地解释在尽管存在强密码学保障的情况下，旁道泄露仍然不可避免。
• 发展一个因果的多层模型，涵盖生成–封装–加密–传输–观测。
• 证明一个旁道存在定理，确立非零互信息下界。
• 识别效率约束、语义可区分性和观测者能力如何约束泄露。

提出的方法

• 构造形式化模型 Sigma = (Gamma, Omega)，其中加密通信 Gamma = (A, Pi, Phi, N) 及观测模型 Omega。
• 定义因果链 X -> Xi_A -> Xi_P -> Xi_C -> Xi_N -> Y，并通过随机核与条件分布证明泄露通道的存在。
• 引入映射非退化性（有界度量偏差 C）、协议层可区分性（ar{Δ}）、李氏统计、观测非退化性（ρ>0）。
• 证明旁道存在定理：若 C < ar{Δ}/(2L_phi)，则 I(X;Y) 具有一个显式的正下界。
• 给出推论，表明当至少有一个应用对在统计上可以区分时，泄露是不可避免的。
• 讨论效率-隐私权衡与防御设计的含义。

实验结果

研究问题

• RQ1 为何在面向效率设计的加密流量中旁道仍然不可避免？
• RQ2 哪些形式条件保证语义变量与观测特征之间存在非零泄露下界？
• RQ3 映射非退化性、协议可区分性、李氏连续性与观测非退化性如何共同约束泄露？
• RQ4 理论下界是否可以转化为对攻击可行性与防御性能的实际预测？

主要发现

• 在特定非退化性与可区分性条件下建立了旁道存在定理。
• 语义变量与观测特征之间的互信息 I(X;Y) 严格为正，具有明确的下界。
• 泄漏取决于三个因素：映射非退化常数 C、语义可区分性 1、观测非退化性 2，且满足 C < 1/(2L_phi)。
• 推论表明，在效率优先的系统中，只要至少有一对应用在统计上可区分，泄露就是不可避免的。