arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.20396quant-ph
收藏

针对设备缺陷鲁棒的安全证明的互信息链式法则

Mutual information chain rules for security proofs robust against device imperfections

Amir Arqand, Tony Metger, Ernest Y. -Z. Tan

AI总结:

本文推导了适用于分析含缺陷设备量子密码学的互信息链式法则,包括改进的光滑熵链式法则、信息界定理及雷尼熵链式法则,可处理随机性生成等协议中的设备缺陷。

摘要:

在本工作中,我们推导了若干互信息相关量的链式法则,适用于分析存在向敌手泄露额外信息的缺陷设备的量子密码学。首先,我们推导了光滑最小熵与光滑最大信息之间的链式法则,该法则改进了此前用于刻画额外条件寄存器导致的一次性信息泄露的链式法则。其次,我们推导了“信息界定理”,该定理以各独立信道输出的雷尼互信息为依据,对由一系列信道产生的状态的雷尼互信息进行界定,类似于熵累积定理。特别地,这为前述链式法则中的光滑最大信息提供了简单的界。第三,我们推导了雷尼熵与雷尼互信息之间的链式法则,可用于修改熵累积定理,以适应协议每一轮中发送给敌手的泄露寄存器。我们表明,这些结果可用于处理多种设备依赖和设备无关协议(如随机性生成和量子密钥分发)中的部分设备缺陷。

英文摘要:

In this work we derive a number of chain rules for mutual information quantities, suitable for analyzing quantum cryptography with imperfect devices that leak additional information to an adversary. First, we derive a chain rule between smooth min-entropy and smooth max-information, which improves over previous chain rules for characterizing one-shot information leakage caused by an additional conditioning register. Second, we derive an ''information bounding theorem'' that bounds the Rényi mutual information of a state produced by a sequence of channels, in terms of the Rényi mutual information of the individual channel outputs, similar to entropy accumulation theorems. In particular, this yields simple bounds on the smooth max-information in the preceding chain rule. Third, we derive chain rules between Rényi entropies and Rényi mutual information, which can be used to modify the entropy accumulation theorem to accommodate leakage registers sent to the adversary in each round of a protocol. We show that these results can be used to handle some device imperfections in a variety of device-dependent and device-independent protocols, such as randomness generation and quantum key distribution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑