Randomness extractor

Results: 67



#Item
1Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2007-11-16 13:42:30
2Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:16
3Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans†  David Zuckerman‡

Lossless Condensers, Unbalanced Expanders, and Extractors Amnon Ta-Shma∗ Christopher Umans† David Zuckerman‡

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2007-05-07 14:18:08
4Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡

Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2004-12-08 14:14:59
5LNCSOur Data, Ourselves: Privacy Via Distributed Noise Generation

LNCSOur Data, Ourselves: Privacy Via Distributed Noise Generation

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2008-09-15 04:56:28
6Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2008-07-02 16:14:32
7Games for Extracting Randomness∗ Ran Halprin and Moni Naor† Department of Computer Science and Applied Mathematics Weizmann Institute of Science {ran.halprin, moni.naor}@weizmann.ac.il

Games for Extracting Randomness∗ Ran Halprin and Moni Naor† Department of Computer Science and Applied Mathematics Weizmann Institute of Science {ran.halprin, moni.naor}@weizmann.ac.il

Add to Reading List

Source URL: cups.cs.cmu.edu

Language: English - Date: 2009-06-18 19:46:36
8Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125.

Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125.

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-05-08 17:50:59
9From Data Fusion to Knowledge Fusion Xin Luna Dong, Evgeniy Gabrilovich, Geremy Heitz, Wiko Horn, Kevin Murphy, Shaohua Sun, Wei Zhang Google Inc. {lunadong|gabr|geremy|wilko|kpmurphy|sunsh|weizh}@google.com

From Data Fusion to Knowledge Fusion Xin Luna Dong, Evgeniy Gabrilovich, Geremy Heitz, Wiko Horn, Kevin Murphy, Shaohua Sun, Wei Zhang Google Inc. {lunadong|gabr|geremy|wilko|kpmurphy|sunsh|weizh}@google.com

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2016-01-27 19:36:23
10The Exact PRF-Security of NMAC and HMAC? Peter Gaˇzi, Krzysztof Pietrzak, and Michal Ryb´ar IST Austria JulyAbstract. NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a

The Exact PRF-Security of NMAC and HMAC? Peter Gaˇzi, Krzysztof Pietrzak, and Michal Ryb´ar IST Austria JulyAbstract. NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a

Add to Reading List

Source URL: pub.ist.ac.at

Language: English - Date: 2014-07-24 05:23:52