Fetching the paper…
Reading the bibliography…
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.
O. Klein, “Zur quantenmechanischen Begründung des zweiten Hauptsatzes der Wärmelehre,” Z. Phys , vol. 72, no. 11-12, pp. 767–775, November 1931
1931
Earlier work this paper cites.
J. L. Carter and M. N. Wegman, “Universal Classes of Hash Functions,” Journal of Computer and System Sciences , vol. 18, no. 2, pp. 143–154, 1979
1979
Earlier work this paper cites.
A. Uhlmann, “The Transition Probability for States of Star-Algebras,” Annalen der Physik , vol. 497, no. 4, pp. 524–532, 1985
1985
Earlier work this paper cites.
C. H. Bennett, G. Brassard, and J.-M. Robert, “Privacy Amplification by Public Discussion,” SIAM J. Comput. , vol. 17, no. 2, p. 210, 1988
1988
Earlier work this paper cites.
R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudo-Random Generation from one-way Functions,” in Proc. 21st Annual ACM Symposium on Theory of Computing , 1989, pp. 12–24
1989
Earlier work this paper cites.
R. Impagliazzo and D. Zuckerman, “How to Recycle Random Bits,” in Proc. 30th Annual IEEE Symposium on Foundations of Computer Science , 1989, pp. 248–253
1989
Earlier work this paper cites.
D. R. Stinson, “Universal Hashing and Authentication Codes,” Designs, Codes and Cryptography , vol. 4, no. 3, pp. 369–380, July 1994
1994
Earlier work this paper cites.
1994
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, “Generalized Privacy Amplification,” IEEE Trans. on Inf. Theory , vol. 41, no. 6, pp. 1915–1923, 1995
1995
Earlier work this paper cites.
R. Bhatia, Matrix Analysis , ser. Graduate Texts in Mathematics. Springer, 1997
1997
Earlier work this paper cites.
J. Hå stad, R. Impagliazzo, L. A. Levin, and M. Luby, “A Pseudorandom Generator from any one-way Function,” SIAM J. Comput. , vol. 28, no. 4, pp. 1364–1396, 1999
1999
Earlier work this paper cites.
A. Srinivasan and D. Zuckerman, “Computing with Very Weak Random Sources,” SIAM J. Comput. , vol. 28, no. 4, pp. 1433–1459, 1999
1999
Earlier work this paper cites.
M. A. Nielsen, I. Chuang, and L. Grover, Quantum Computation and Quantum Information . Cambridge University Press, 2000
2000
Cited alongside, same era.
L. Trevisan, “Extractors and Pseudorandom Generators,” Journal of the ACM , vol. 48, no. 4, pp. 860–879, July 2001
2001
Cited alongside, same era.
D. R. Stinson, “Universal Hash Families and the Leftover Hash Lemma, and Applications to Cryptography and Computing,” Journal of Combinatorial Mathematics and Combinatorial Computing , vol. 42, pp. 3–31, 2002
2002
Cited alongside, same era.
R. König, U. M. Maurer, and R. Renner, “On the Power of Quantum Memory,” IEEE Trans. on Inf. Theory , vol. 51, no. 7, pp. 2391–2401, 2005
2005
Cited alongside, same era.
R. Renner, “Security of Quantum Key Distribution,” PhD Thesis, ETH Zürich, 2005. [Online]. Available: http://arxiv.org/abs/quant-ph/0512258
2005
2007
Later among the works it cites.
S. Fehr and C. Schaffner, “Randomness Extraction Via Delta-Biased Masking in the Presence of a Quantum Attacker,” in Theory of Cryptography Conference ’08 . Springer, 2008, pp. 465–481
2008
Later among the works it cites.
M. Berta, “Single-Shot Quantum State Merging,” Master’s Thesis, ETH Zürich, 2008
2008
Later among the works it cites.
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
R. Renner and R. König, “Universally Composable Privacy Amplification Against Quantum Adversaries,” in Second Theory of Cryptography Conference, TCC 2005 , ser. LNCS, vol. 3378. Springer, 2005, pp. 407–425
2005
Cited alongside, same era.
Y. Dodis and A. Smith, “Correcting Errors without Leaking Partial Information,” in 37th Annual ACM Symposium on Theory of Computing (STOC) , 2005, pp. 654–663
2005
Cited alongside, same era.
G. Van Assche, Quantum Cryptography and Secret-Key Distillation . Cambridge University Press, 2006
2006
Cited alongside, same era.
D. Gavinsky, J. Kempe, W. J. Kempe, I. Kerenidis, C. W. I. Amsterdam, R. Raz, R. de Wolf, and O. R. Raz, “Exponential Separation for one-way Quantum Communication Complexity, with Applications to Cryptography,” in Proc. 39th Annual ACM Symposium on Theory of Computing . San Diego: ACM, 2007, pp. 516–525
2007
Cited alongside, same era.
2007
Cited alongside, same era.
J. Lodewyck, M. Bloch, R. García-Patrón, S. Fossier, E. Karpov, E. Diamanti, T. Debuisschert, N. Cerf, R. Tualle-Brouri, S. McLaughlin, and P. Grangier, “Quantum Key Distribution over 25km with an All-Fiber Continuous-Variable System,” Phys. Rev. A , vol. 76, no. 4, 2007
2007
Cited alongside, same era.
2009
Later among the works it cites.
2009
Later among the works it cites.
M. Tomamichel, R. Colbeck, and R. Renner, “A Fully Quantum Asymptotic Equipartition Property,” IEEE Trans. on Inf. Theory , vol. 55, no. 12, pp. 5840–5847, 2009
2009
Later among the works it cites.
2009
Later among the works it cites.
N. Datta, “Min- and Max- Relative Entropies and a New Entanglement Monotone,” IEEE Trans. on Inf. Theory , vol. 55, no. 6, pp. 2816–2826, 2009
2009
Later among the works it cites.
M. Mosony and N. Datta, “Generalized Relative Entropies and the Capacity of Classical-Quantum Channels,” J. Math. Phys. , vol. 50, no. 7, 2009
2009
Later among the works it cites.