Fetching the paper…
Reading the bibliography…
We construct a strong extractor against quantum storage that works for every min-entropy $k$, has logarithmic seed length, and outputs $\Omega(k)$ bits, provided that the quantum adversary has at most $\beta k$ qubits of memory, for any $\beta < \half$.
Privacy amplification by public discussion
C.H. Bennett, G. Brassard, and J.M. Robert · 1988
Earlier work this paper cites.
Pseudo-random generation from one-way functions
R. Impagliazzo, L. Levin, and M. Luby · 1989
Earlier work this paper cites.
Generalized privacy amplification
C.H. Bennett, G. Brassard, C. Crepeau, and U. Maurer · 1995
Earlier work this paper cites.
Randomness is linear in space
N. Nisan and D. Zuckerman · 1996
Earlier work this paper cites.
Tiny families of functions with random properties: a quality-size trade-off for hashing
O. Goldreich and A. Wigderson · 1997
Earlier work this paper cites.
Computing with very weak random sources
A. Srinivasan and D. Zuckerman · 1999
Earlier work this paper cites.
Bounds for dispersers, extractors, and depth-two superconcentrators
J. Radhakrishnan and A. Ta-Shma · 2000
Earlier work this paper cites.
Loss-less condensers, unbalanced expanders, and extractors
A. Ta-Shma, C. Umans, and D. Zuckerman · 2001
Earlier work this paper cites.
Extractors and pseudorandom generators
L. Trevisan · 2001
Earlier work this paper cites.
Randomness conductors and constant-degree expansion beyond the degree/2 barrier
M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson · 2002
Cited alongside, same era.
A Generic Security Proof for Quantum Key Distribution, 2004
M. Christandl, R. Renner, and A. Ekert · 2004
Cited alongside, same era.
Correcting errors without leaking partial information
Y. Dodis and A. Smith · 2005
Cited alongside, same era.
On the power of quantum memory
R. König, U. Maurer, and R. Renner · 2005
Cited alongside, same era.
Security of Quantum Key Distribution
R. Renner · 2005
Cited alongside, same era.
Sampling of min-entropy relative to quantum knowledge, 2007
R. König and R. Renner · 2007
Cited alongside, same era.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf · 2008
Later among the works it cites.
The bounded-storage model in the presence of a quantum adversary
R. König and B. Terhal · 2008
Later among the works it cites.
Trevisan’s extractor in the presence of quantum side information, 2009
A. De, C. Portmann, T. Vidick, and R. Renner · 2009
Later among the works it cites.
Extensions to the method of multiplicities, with applications to kakeya sets and mergers
Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan · 2009
Later among the works it cites.
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
V. Guruswami, C. Umans, and S. Vadhan · 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…
Lossless condensers, unbalanced expanders, and extractors
A. Ta-Shma, C. Umans, and D. Zuckerman · 2007
Cited alongside, same era.
Kakeya sets, new mergers and old extractors
Z. Dvir and A. Wigderson · 2008
Cited alongside, same era.
Randomness extraction via δ \delta -biased masking in the presence of a quantum attacker
S. Fehr and C. Schaffner · 2008
Cited alongside, same era.
The operational meaning of min-and max-entropy
R. Konig, R. Renner, and C. Schaffner · 2009
Later among the works it cites.
Near-optimal extractors against quantum storage
A. De and T. Vidick · 2010
Closest in time.
Leftover hashing against quantum side information, 2010
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner · 2010
Closest in time.