Fetching the paper…
Reading the bibliography…
Randomness extraction involves the processing of purely classical information and is therefore usually studied in the framework of classical probability theory.
Theory and applications of trapdoor functions (extended abstract)
Andrew Chi-Chih Yao · 1982
Earlier work this paper cites.
Privacy amplification by public discussion
Charles H. Bennett, Gilles Brassard, and Jean-Marc Robert · 1988
Earlier work this paper cites.
How to recycle random bits
Russell Impagliazzo and David Zuckerman · 1989
Earlier work this paper cites.
David Zuckerman · 1990
Earlier work this paper cites.
Conditionally-perfect secrecy and a provably-secure randomized cipher
Ueli M. Maurer · 1992
Earlier work this paper cites.
Hardness vs randomness
Noam Nisan and Avi Wigderson · 1994
Earlier work this paper cites.
Short seed extractors against quantum storage
Amnon Ta-Shma · 1994
Earlier work this paper cites.
Generalized privacy amplification
Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer · 1995
Earlier work this paper cites.
Randomness is linear in space
Noam Nisan and David Zuckerman · 1996
Earlier work this paper cites.
Dense quantum coding and a lower bound for 1-way quantum automata
Andris Ambainis, Ashwin Nayak, Ammon Ta-Shma, and Umesh Vazirani · 1999
Earlier work this paper cites.
Computing with very weak random sources
Aravind Srinivasan and David Zuckerman · 1999
Earlier work this paper cites.
Expanders that beat the eigenvalue bound: Explicit construction and applications
Avi Wigderson and David Zuckerman · 1999
Earlier work this paper cites.
Extractors and pseudo-random generators with optimal seed length
Russell Impagliazzo, Ronen Shaltiel, and Avi Wigderson · 2000
Earlier work this paper cites.
Bounds for dispersers, extractors, and depth-two superconcentrators
Jaikumar Radhakrishnan and Amnon Ta-Shma · 2000
Cited alongside, same era.
List decoding: algorithms and applications
Madhu Sudan · 2000
Cited alongside, same era.
Extractors and pseudorandom generators
Luca Trevisan · 2001
Cited alongside, same era.
Loss-less condensers, unbalanced expanders, and extractors
Amnon Ta-Shma, Christopher Umans, and David Zuckerman · 2001
Cited alongside, same era.
Combinatorial bounds for list decoding
Venkatesan Guruswami, Johan Håstad, Madhu Sudan, and David Zuckerman · 2002
Cited alongside, same era.
Extracting all the randomness and reducing the error in Trevisan’s extractors
Ran Raz, Omer Reingold, and Salil Vadhan · 2002
Cited alongside, same era.
Extractors from reed-muller codes
Amnon Ta-Shma, David Zuckerman, and Shmuel Safra · 2005
Later among the works it cites.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf · 2007
Later among the works it cites.
The bounded-storage model in the presence of a quantum adversary
Robert König and Barbara M. Terhal · 2007
Later among the works it cites.
The operational meaning of min- and max-entropy
Robert König, Renato Renner, and Christian Schaffner · 2009
Closest in time.
Near-optimal extractors against quantum storage
Anindya De and Thomas Vidick · 2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Recent developments in explicit constructions of extractors
Ronen Shaltiel · 2002
Cited alongside, same era.
On the distribution of the number of roots of polynomials and explicit weak designs
Tzvika Hartman and Ran Raz · 2003
Cited alongside, same era.
Encryption against storage-bounded adversaries from on-line strong extractors
Chi-Jen Lu · 2004
Cited alongside, same era.
Constructing locally computable extractors and cryptosystems in the bounded-storage model
Salil P. Vadhan · 2004
Cited alongside, same era.
Extractors with weak random seeds
Ran Raz · 2005
Cited alongside, same era.
Security of Quantum Key Distribution
Renato Renner · 2005
Cited alongside, same era.
Roy Kasher and Julia Kempe · 2010
Closest in time.
Efficient simulation of random quantum states and operators
Raffaele Solcà · 2010
Closest in time.
Duality between smooth min- and max-entropies
Marco Tomamichel, Roger Colbeck, and Renato Renner · 2010
Closest in time.
Leftover hashing against quantum side information
Marco Tomamichel, Christian Schaffner, Adam Smith, and Renato Renner · 2010
Closest in time.
Better short-seed quantum-proof extractors
Avraham Ben-Aroya and Amnon Ta-Shma · 2011
Closest in time.
Sampling of min-entropy relative to quantum knowledge
Robert König and Renato Renner · 2011
Closest in time.
An ultrafast quantum random number generator based on quantum phase fluctuations
Feihu Xu, Bing Qi, Xiongfeng Ma, He Xu, Haoxuan Zheng, and Hoi-Kwong Lo · 2011
Closest in time.