Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Computing with Very Weak Random Sources
SIAM Journal on Computing
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Correcting errors without leaking partial information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Kakeya Sets, New Mergers and Old Extractors
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
SIAM Journal on Computing
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
On the power of quantum memory
IEEE Transactions on Information Theory
The Bounded-Storage Model in the Presence of a Quantum Adversary
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs @W(k) bits, provided that the quantum adversary has at most @bk qubits of memory, for any @b