Fetching the paper…
Reading the bibliography…
Randomness extractors, widely used in classical and quantum cryptography and other fields of computer science, e.g., derandomization, are functions which generate almost uniform randomness from weak sources of randomness.
Generating quasi-random sequences from semi-random sources
Miklos Santha and Umesh V Vazirani · 1986
Earlier work this paper cites.
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
Umesh V Vazirani · 1987
Earlier work this paper cites.
Pseudo-random generation from one-way functions
Russell Impagliazzo, Leonid A Levin, and Michael Luby · 1989
Earlier work this paper cites.
Bounds for dispersers, extractors, and depth-two superconcentrators
Jaikumar Radhakrishnan and Amnon Ta-Shma · 2000
Earlier work this paper cites.
Extractors and pseudorandom generators
Luca Trevisan · 2001
Earlier work this paper cites.
Recent developments in explicit constructions of extractors
Ronen Shaltiel · 2002
Earlier work this paper cites.
Improved randomness extraction from two independent sources
Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, and Ran Raz · 2004
Earlier work this paper cites.
Structure of states which satisfy strong subadditivity of quantum entropy with equality
Patrick Hayden, Richard Jozsa, Denes Petz, and Andreas Winter · 2004
Earlier work this paper cites.
“Extrinsic” and “intrinsic” data in quantum measurements: Asymptotic convex decomposition of positive operator valued measures
Andreas Winter · 2004
Earlier work this paper cites.
Extractors with weak random seeds
Ran Raz · 2005
Earlier work this paper cites.
Universally composable privacy amplification against quantum adversaries
Renato Renner and Robert König · 2005
Earlier work this paper 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
Earlier work this paper cites.
The bounded-storage model in the presence of a quantum adversary
Robert T. Konig and Barbara M. Terhal · 2008
Earlier work this paper cites.
Security of quantum key distribution
Renato Renner · 2008
Earlier work this paper cites.
The impossibility of non-signaling privacy amplification
Esther Hänggi, Renato Renner, and Stefan Wolf · 2009
Cited alongside, same era.
Extractors for a constant number of polynomially small min-entropy independent sources
Anup Rao · 2009
Cited alongside, same era.
Two-source extractors secure against quantum adversaries
Roy Kasher and Julia Kempe · 2010
Cited alongside, same era.
Quantum computation and quantum information
Michael A Nielsen and Isaac L Chuang · 2010
Cited alongside, same era.
Duality between smooth min- and max-entropies
Marco Tomamichel, Roger Colbeck, and Renato Renner · 2010
Cited alongside, same era.
Leftover hashing against quantum side information
Marco Tomamichel, Christian Schaffner, Adam Smith, and Renato Renner · 2010
Multi-source randomness extractors against quantum side information, and their applications
Kai-Min Chung, Xin Li, and Xiaodi Wu · 2014
Later among the works it cites.
Physical randomness extractors: Generating random numbers with minimal assumptions
Kai-Min Chung, Yaoyun Shi, and Xiaodi Wu · 2014
Later among the works it cites.
Device-independent randomness amplification with a single device
Martin Plesch and Matej Pivoluska · 2014
Later among the works it cites.
Robust and versatile black-box certification of quantum devices
Tzyh Haur Yang, Tamás Vértesi, Jean-Daniel Bancal, Valerio Scarani, and Miguel Navascués · 2014
Later among the works it cites.
Explicit two-source extractors and resilient functions
Eshan Chattopadhyay and David Zuckerman · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Limits of privacy amplification against nonsignaling memory attacks
Rotem Arnon-Friedman and Amnon Ta-Shma · 2012
Cited alongside, same era.
Trevisan’s extractor in the presence of quantum side information
Anindya De, Christopher Portmann, Thomas Vidick, and Renato Renner · 2012
Cited alongside, same era.
A modular framework for randomness extraction based on trevisan’s construction
Wolfgang Mauerer, Christopher Portmann, and Volkher B. Scholz · 2012
Cited alongside, same era.
Tight finite-key analysis for quantum cryptography
Marco Tomamichel, Charles Ci Wen Lim, Nicolas Gisin, and Renato Renner · 2012
Cited alongside, same era.
Classical command of quantum systems
Ben W Reichardt, Falk Unger, and Umesh Vazirani · 2013
Cited alongside, same era.
The device-independent outlook on quantum physics (lecture notes on the power of Bell’s theorem)
Valerio Scarani · 2013
Cited alongside, same era.
Quantum conditional mutual information and approximate markov chains
Omar Fawzi and Renato Renner · 2015
Closest in time.
More efficient privacy amplification with less random seeds
Masahito Hayashi and Toyohiro Tsurumaru · 2015
Closest in time.
Improved constructions of two-source extractors
Xin Li · 2015
Closest in time.
Personal communication, 2015
Xin Li · 2015
Closest in time.
Three-source extractors for polylogarithmic min-entropy
Xin Li · 2015
Closest in time.
Amplification of arbitrarily weak randomness
Piotr Mironowicz, Rodrigo Gallego, and Marcin Pawlowski · 2015
Closest in time.
Quantum bilinear optimization
Mario Berta, Omar Fawzi, and Volkher B. Scholz · 2016
Closest in time.
Realistic noise-tolerant randomness amplification using finite number of devices
Fernando G. S. L. Brandão, Ravishankar Ramanathan, Andrzej Grudka, Karol Horodecki, Michał Horodecki, Paweł Horodecki, Tomasz Szarek, and Hanna Wojewódka · 2016
Closest in time.