In a recent work, Kumar, Meka, and Sahai (FOCS 2019) introduced the notion of bounded
collusion protocols (BCPs). BCPs are multiparty communication protocols in which N parties …

The area of randomness extraction has seen interesting advances in recent years, with rapid
progress on many longstanding open problems, along with the introduction of many new …

We introduce a natural generalization of two-source non-malleable extractors (Cheragachi
and Guruswami, TCC 2014) called as multi-source non-malleable extractors. Multi-source …

For more than 30 years, cryptographers have been looking for public sources of uniform
randomness in order to use them as a set-up to run appealing cryptographic protocols …

We continue a line of work on extracting random bits from weak sources that are generated
by simple processes. We focus on the model of locally samplable sources, where each bit in …

We study the problem of extracting random bits from weak sources that are sampled by
algorithms with limited memory. This model of small-space sources was introduced by …

We initiate a comprehensive study of the question of randomness extractions from two
somewhat dependent sources of defective randomness. Specifically, we present three …

We study the problem of extracting randomness from somewhere-random sources, and
related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A …

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

Randomness is a powerful tool, exploited almost everywhere in computer science–from
cryptography, to distributed computing, to algorithm design and more. Unfortunately, most of …