针对量子边信息的剩余散列
Leftover Hashing Against Quantum Side Information
摘要：
剩余哈希引理指出，应用于具有足够高熵的输入的双通用哈希函数的输出几乎是一致随机的。在其标准表述中，引理指的是随机性的概念，它（通常是隐式地）相对于经典边信息定义。在这里，我们证明了一个（严格）更一般的版本的剩余哈希引理是有效的，即使边信息表示的量子系统的状态。此外，我们的结果适用于任意delta几乎两个泛散列函数族。广义剩余散列引理在密码学中有应用，例如，用于在不限于经典信息处理的对手存在的情况下的密钥协商。
英文摘要：
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, we prove a (strictly) more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system. Furthermore, our result applies to arbitrary delta-almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
