After being introduced by Shannon as a measure of disorder and unavailable information,
the notion of entropy has found its applications in a broad range of scientific disciplines. In …

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 …

We construct an efficient information-theoretically non-malleable code in the split-state
model for one-bit messages. Non-malleable codes were introduced recently by …

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 …

Non-malleable coding, introduced by Dziembowski et al.(ICS 2010), aims for protecting the
integrity of information against tampering attacks in situations where error detection is …

Increasingly severe I/O bottlenecks on High-End Computing machines are prompting
scientists to process simulation output data online while simulations are running and before …

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 …

Recently, there has been renewed interest in basing cryptographic primitives on weak
secrets, where the only information about the secret is some non-trivial amount of (min-) …