Fetching the paper…
Reading the bibliography…
Randomness extraction is of fundamental importance for information-theoretic cryptography.
New hash functions and their use in authentication and set equality
M. N. Wegman and L. Carter · 1981
Earlier work this paper cites.
Pseudo-random generation from one-way functions
R. Impagliazzo, L. A. Levin, and M. Luby · 1989
Earlier work this paper cites.
Simple constructions of almost k-wise independent random variables
N. Alon, O. Goldreich, J. Håstad, and R. Peralta · 1990
Earlier work this paper cites.
A provably-secure strongly-randomized cipher
U. M. Maurer · 1990
Earlier work this paper cites.
Small-bias probability spaces: efficient constructions and applications
J. Naor and M. Naor · 1990
Earlier work this paper cites.
Universal hashing and authentication codes
D. R. Stinson · 1991
Earlier work this paper cites.
More deterministic simulation in logspace
N. Nisan and D. Zuckerman · 1993
Earlier work this paper cites.
Generalized privacy amplification
C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer · 1995
Earlier work this paper cites.
On extracting randomness from weak random sources
A. Ta-Shma · 1996
Earlier work this paper cites.
A pseudorandom generator from any one-way function
J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby · 1999
Earlier work this paper cites.
Everlasting security in the bounded storage model
Y. Aumann, Y. Z. Ding, and M. O. Rabin · 2002
Cited alongside, same era.
How to fool an unbounded adversary with a short key
A. Russell and H. Wang · 2002
Cited alongside, same era.
Recent developments in explicit constructions of extractors
R. Shaltiel · 2002
Cited alongside, same era.
Small pseudo-random families of matrices: Derandomizing approximate quantum encryption
A. Ambainis and A. Smith · 2004
Cited alongside, same era.
Correcting errors without leaking partial information
Y. Dodis and A. Smith · 2005
Cited alongside, same era.
Entropic security and the encryption of high entropy messages
Y. Dodis and A. Smith · 2005
Cited alongside, same era.
Approximate randomization of quantum states with fewer bits of key
P. A. Dickinson and A. Nayak · 2006
Later among the works it cites.
On the optimality of quantum encryption schemes
I. Kerenidis and D. Nagaj · 2006
Later among the works it cites.
The bounded storage model in the presence of a quantum adversary
R. König and B. M. Terhal · 2006
Later among the works it cites.
A hypercontractive inequality for matrix-valued functions with applications to quantum computing
A. Ben-Aroya, O. Regev, and R. de Wolf · 2007
Closest in time.
Secure identification and QKD in the bounded-quantum-storage model
I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner · 2007
Closest in time.
Entropic security in quantum cryptography
S. P. Desrosiers · 2007
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Security of Quantum Key Distribution
R. Renner · 2005
Cited alongside, same era.
Universally composable privacy amplification against quantum adversaries
R. Renner and R. König · 2005
Cited alongside, same era.
Simple and tight bounds for information reconciliation and privacy amplification
R. Renner and S. Wolf · 2005
Cited alongside, same era.
Oblivious transfer and linear functions
I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner · 2006
Cited alongside, same era.
Closest in time.
Quantum entropic security and approximate quantum encryption
S. P. Desrosiers and F. Dupuis · 2007
Closest in time.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, I. Kerenidis, J. Kempe, R. Raz, and R. de Wolf · 2007
Closest in time.
Sampling of min-entropy relative to quantum knowledge
R. König and R. Renner · 2007
Closest in time.
Private communication
A. Smith, 2007 · 2007
Closest in time.