Leftover Hashing Against Quantum Side Information

Leftover Hashing Against Quantum Side Information
复制标题

DOI:
10.1109/tit.2011.2158473
复制
发表时间:
2011-08-01
影响因子:
2.5
通讯作者:
Renner, Renato
Renner, Renato
中科院分区:
计算机科学2区
文献类型:
--
作者:
Tomamichel, Marco;Schaffner, Christian;Renner, Renato

文献摘要

被引文献

相似文献

剩余哈希引理指出,将一个双通用哈希函数应用于一个具有足够高熵的输入,其输出几乎是均匀随机的。在其标准表述中,引理指的是(通常隐式地)根据经典侧信息定义的随机性概念。这里,一个严格的更一般版本的剩余哈希引理是有效的,即使侧信息是由量子系统的状态表示。我们的结果适用于几乎两个泛族的哈希函数。广义剩余哈希引理在密码学中有应用,例如,在不限于经典信息处理的对手存在的情况下进行密钥协议。
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, 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 is shown. Our result applies to 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.