Random numbers are a fundamental resource in science and engineering with important
applications in simulation and cryptography. The inherent randomness at the core of …

A randomness extractor is an algorithm which extracts randomness from a low-quality
random source, using some additional truly random bits. We construct new extractors which …

We give an improved explicit construction of highly unbalanced bipartite expander graphs
with expansion arbitrarily close to the degree (which is polylogarithmic in the number of …

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 …

This progress report covers recent developments in the area of quantum randomness, which
is an extraordinarily interdisciplinary area that belongs not only to physics, but also to …

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 …

A number of works have focused on the setting where an adversary tampers with the shares
of a secret sharing scheme. This includes literature on verifiable secret sharing, algebraic …

Randomness extraction involves the processing of purely classical information and is
therefore usually studied with in the framework of classical probability theory. However, such …

In this work we give the first deterministic extractors from a constant number of weak sources
whose entropy rate is less than 1/2. Specifically, for every δ>0 we give an explicit …

We present the cryptographic implementation of “DEMOS”, a new e-voting system that is end-
to-end verifiable in the standard model, ie, without any additional “setup” assumption or …