<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-12-19 22:46:27Information theory Formal sciences Key Entropy Cryptographically secure pseudorandom number generator Randomness extractor Cryptography Randomness Pseudorandom number generators |
Add to Reading List |
Microsoft PowerPoint - dp-slides | Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard UniversityDocID: 1r5sy - View Document |
| Why Simple Hash Functions Work: Exploiting the Entropy in a Data StreamDocID: 1qUBE - View Document |
| Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡DocID: 1qPOU - View Document |
| Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡DocID: 1qB1P - View Document |
| LNCSOur Data, Ourselves: Privacy Via Distributed Noise GenerationDocID: 1pOcL - View Document |