First Page | Document Content | |
---|---|---|
![]() Date: 2011-07-16 03:04:49Cryptography Randomness Computational complexity theory Statistical theory Randomness extractor Leftover hash lemma Min-entropy Entropy Universal hashing Theoretical computer science Information theory Applied mathematics | Source URL: www.cs.bu.eduDownload Document from Source WebsiteFile Size: 171,97 KBShare Document on Facebook |
![]() | 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 |