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
中科院分区:
文献类型:
--
作者:
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.