We explicitly construct an extractor for two independent sources on n bits, each with
polylogarithmic min-entropy. Our extractor outputs one bit and has polynomially small error …

A long line of work in the past two decades or so established close connections between
several different pseudorandom objects and applications, including seeded or seedless non …

In this paper we give improved constructions of several central objects in the literature of
randomness extraction and tamper-resilient cryptography. Our main results are:(1) An …

Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …

The recent line of study on randomness extractors has been a great success, resulting in
exciting new techniques, new connections, and breakthroughs to long standing open …

In a recent breakthrough [1], Chattopadhyay and Zuckerman gave an explicit two-source
extractor for min-entropy k≥ log C n for some large enough constant C, where n is the …

We give an explicit construction of an affine extractor (over F_2) that works for affine sources
on n bits with min-entropy k≧\logn⋅(\log\logn)^1+o(1). This improves prior work of Li …

We continue the study of constructing explicit extractors for independent general weak
random sources. The ultimate goal is to give a construction that matches what is given by the …

In his influential 1947 paper that inaugurated the probabilistic method, Erdős proved the
existence of 2log n-Ramsey graphs on n vertices. Matching Erdős' result with a constructive …

We consider the problem of extracting randomness from sumset sources, a general class of
weak sources introduced by Chattopadhyay and Li (STOC, 2016). An (n, k, C)-sumset …