Fetching the paper…
Reading the bibliography…
Let X_1, ..., X_n be a sequence of n classical random variables and consider a sample of r positions selected at random.
Statistical problems in quantum physics
A. S. Holevo · 1973
Earlier work this paper cites.
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. A. Levin, and M. Luby · 1989
Earlier work this paper cites.
Conditionally-perfect secrecy and a provably-secure randomized cipher
U. Maurer · 1992
Earlier work this paper cites.
Generalized privacy amplification
C. H. Bennett, G. Brassard, C. Crépeau, 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.
A sampler of samplers: A computational perspective on sampling, 1997
O. Goldreich · 1997
Earlier work this paper cites.
Dense quantum coding and a lower bound for 1-way quantum automata
A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani · 1999
Earlier work this paper cites.
Optimal lower bounds for quantum automata and random access codes
A. Nayak · 1999
Earlier work this paper cites.
Coding theorem and strong converse for quantum channels
A. Winter · 1999
Earlier work this paper cites.
Tight security proofs for the bounded-storage model
S. Dziembowski and U. Maurer · 2002
Cited alongside, same era.
Hyper-encryption against space-bounded adversaries from on-line strong extractors
C. Lu · 2002
Cited alongside, same era.
New proof of the channel coding theorem via hypothesis testin g in quantum information theory, 2002
T. Ogawa and H. Nagaoka · 2002
Cited alongside, same era.
Recent developments in explicit constructions of extractors
R. Shaltiel · 2002
Cited alongside, same era.
On constructing locally computable extractors and cryptosystems in the bounded storage model
S. Vadhan · 2003
Cited alongside, same era.
Constant-round oblivious transfer in the bounded storage mode l
Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel · 2004
Cited alongside, same era.
Security of Quantum Key Distribution
R. Renner · 2005
Later among the works it cites.
Universally composable privacy amplification against quantum adversaries
R. Renner and R. König · 2005
Later among the works it cites.
A hypercontractive inequality for matrix-valued functions with applications to quantum computing, 2007
A. Ben-Aroya, O. Regev, and R. de Wolf · 2007
Closest in time.
Randomness extraction via delta-biased masking in the presence of a quantum attacker, 2007
S. Fehr and C. Schaffner · 2007
Closest in time.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and Ronald de Wolf · 2007
Closest in time.
The operational meaning of conditional min-entropy
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal randomizer efficiency in the bounded-storage model
S. Dziembowski and U. Maurer · 2004
Cited alongside, same era.
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
L. Babai and T. P. Hayes · 2005
Cited alongside, same era.
On the power of quantum memory
R. König, U. Maurer, and R. Renner · 2005
Cited alongside, same era.
R. König, C. Schaffner, and R. Renner · 2007
Closest in time.
The bounded storage model in the presence of a quantum adversary
R. König and B. M. Terhal · 2007
Closest in time.
Conditional density operators and the subjectivity of quantum operations
M. S. Leifer · 2007
Closest in time.
Oblivious-transfer amplification
J. Wullschleger · 2007
Closest in time.