Paper 2025/190

Binary Codes for Error Detection and Correction in a Computationally Bounded World

Abstract

We study error detection and correction in a computationally bounded world, where errors are introduced by an arbitrary $\mathit{\text{polynomial-time}}$ adversarial channel. Our focus is on $\mathit{\text{seeded}}$ codes, where the encoding and decoding procedures can share a public random seed, but are otherwise deterministic. We can ask for either $\mathit{\text{selective}}$ or $\mathit{\text{adaptive}}$ security, depending on whether the adversary can choose the message being encoded before or after seeing the seed. For large alphabets, a recent construction achieves essentially optimal rate versus error tolerance trade-offs under minimal assumptions, surpassing information-theoretic limits. However, for the binary alphabet, the only prior improvement over information theoretic codes relies on non-standard assumptions justified via the random oracle model. We show the following: $$ Under the learning with errors (LWE) assumption, we construct selectively secure codes over the binary alphabet. For error detection, our codes achieve essentially optimal rate $$ and relative error tolerance $$. For error correction, they can uniquely correct $$ relative errors with a rate $$ that essentially matches that of the best list-decodable codes with error tolerance $$. Both cases provide significant improvements over information-theoretic counterparts. The construction relies on a novel form of 2-input correlation intractable hash functions that we construct from LWE. $$ Assuming the exponential security of a natural collision-resistant hash function candidate based on the ``crypto dark matter'' approach of mixing linear functions over different moduli, we construct adaptively secure codes over the binary alphabet, for both error detection and correction. They achieve essentially the same trade-offs between error tolerance $$ and rate $$ as above, with the caveat that for error-correction they only do so for sufficiently small values of $$.