We provide formal definitions and efficient secure techniques for turning biometric
information into keys usable for any cryptographic application, and reliably and securely …

We provide formal definitions and efficient secure techniques for turning noisy information
into keys usable for any cryptographic application, and, in particular, reliably and securely …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

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 …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

We obtain randomized algorithms for factoring degree n univariate polynomials over F_q
requiring O(n^1.5+o(1)\rmlog^1+o(1)q+n^1+o(1)\rmlog^2+o(1)q) bit operations. When …

Locally decodable codes are a class of" error-correcting codes." Error-correcting codes help
to ensure reliability when transmitting information over noisy channels. They allow a sender …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a
generalization of MDS codes. An order-ℓ MDS code, denoted by MDS (ℓ), has the property …