Near-optimal extractors against quantum storage

Information-theoretic aspects of quantum measurement

Alexander Holevo · 1973

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.

Quantum entanglement and the communication complexity of the inner product function

Richard Cleve, Wim van Dam, Michael Nielsen, and Alain Tapp · 1998

Earlier work this paper cites.

Extracting all the randomness and reducing the error in Trevisan’s extractors

R. Raz, O. Reingold, and S. Vadhan · 1999

Earlier work this paper cites.

Pseudorandom generators without the XOR lemma

Madhu Sudan, Luca Trevisan, and Salil Vadhan · 2001

Earlier work this paper cites.

Extractors and pseudorandom generators

Luca Trevisan · 2001

Earlier work this paper cites.

Dense quantum coding and quantum finite automata

Andris Ambainis, Ashwin Nayak, Amnon Ta-shma, and Umesh V. Vazirani · 2002

Earlier work this paper cites.

Combinatorial bounds for list decoding

Venkatesan Guruswami, Johan Håstad, Madhu Sudan, and David Zuckerman · 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.

Optimal randomizer efficiency in the bounded-storage model

Stefan Dziembowski and Ueli Maurer · 2004

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.

The complexity of constructing pseudorandom generators from hard functions

Original

Limits on the ability of quantum states to convey classical messages

Ashwin Nayak and Julia Salzman · 2006

Later among the works it cites.

Exponential separations for one-way quantum communication complexity with applications to cryptography

Dmitri Gavinsky, Julia Kempe, Iordanis Kerendis, Ran Raz, and Ronald de Wolf · 2007

Later among the works it cites.

A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs

Original

Avraham Ben-Aroya, Oded Regev, and Ronald de Wolf · 2008

Later among the works it cites.

Randomness extraction via delta

Serge Fehr and Christian Schaffner · 2008

Later among the works it cites.

The bounded storage model in presence of a quantum adversary

Robert König and Barbara Terhal · 2008

Later among the works it cites.

Trevisan’s extractor in the presence of quantum side information