The nearest neighbor problem is defined as follows: Given a set P of n points in some metric
space (X, D), build a data structure that, given any point q, returns a point in P that is closest …

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 …

Reed–Solomon codes are a classic family of error-correcting codes consisting of
evaluations of low-degree polynomials over a finite field on some sequence of distinct field …

Motivated by average-case trace reconstruction and coding for portable DNA-based storage
systems, we initiate the study of coded trace reconstruction, the design and analysis of high …

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 …

This paper shows that, with high probability, randomly punctured Reed-Solomon codes over
fields of polynomial size achieve the list decoding capacity. More specifically, we prove that …

Blockchain, a specific distributed database which maintains a list of data records against
tampering and corruption, has aroused wide interests and become a hot topic in the real …

Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …

Cryptographic hash functions are efficiently computable functions that shrink a long input
into a shorter output while achieving some of the useful security properties of a random …

We revisit the alternating moduli paradigm for constructing symmetric key primitives with a
focus on constructing highly efficient protocols to evaluate them using secure multi-party …