Why simple hash functions work: Exploiting the entropy in a data stream (2008)

by Michael Mitzenmacher , Salil Vadhan
Venue:In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms
Citations:36 - 6 self

Active Bibliography

21 Deterministic Extractors For Small-Space Sources – - 2006
Hash-Based Data Structures for Extreme Conditions – - 2008
22 On the (Non)Universality of the One-Time Pad – - 2002
79 Unbalanced expanders and randomness extractors from parvaresh-vardy codes – - 2007
293 Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004 – - 2004
9 Hash-Based Techniques for High-Speed Packet Processing
5 Simple Affine Extractors using Dimension Expansion – - 2009
23 Improved Randomness Extraction from Two Independent Sources – - 2004
18 How to get more mileage from randomness extractors – - 2007
The Computational Complexity Column
125 Entropy waves, the zig-zag graph product, and new constant-degree expanders – - 2002
52 Extractors: Optimal up to Constant Factors – - 2003
21 Randomness-Optimal Oblivious Sampling – - 1997
Electronic Colloquium on Computational Complexity, Report No. 135 (2005) On the Power of the Randomized Iterate – - 2005
39 Extractors for a constant number of polynomially small min-entropy independent sources – - 2006
20 On extracting private randomness over a public channel – - 2003
Improved Constructions for Extracting Quasi- . . . – - 2003
3 Weak derandomization of weak algorithms: explicit versions of Yao’s lemma
24 DETERMINISTIC EXTRACTORS FOR BIT-FIXING SOURCES BY OBTAINING AN INDEPENDENT SEED – - 2005