We prove that a binary linear code of block length n that is locally correctable with 3 queries
against a fraction δ>0 of adversarial errors must have dimension at most o_δ(>\log^2n. log …

Locally Decodable Codes (LDCs) are error-correcting codes $ C:\Sigma^
n\rightarrow\Sigma^ m $ with super-fast decoding algorithms. They are important …

We formally introduce, define, and construct memory-hard puzzles. Intuitively, for a difficulty
parameter t, a cryptographic puzzle is memory-hard if any parallel random access machine …

Locally decodable codes (LDC's) are error-correcting codes that allow recovery of individual
message indices by accessing only a constant number of codeword indices. For substitution …

We revisit computationally relaxed locally decodable codes (crLDCs)(Blocki et al., Trans. Inf.
Theory'21) and give two new constructions. Our first construction is a Hamming crLDC that is …

In this thesis we study the complexity of data recovery from synchronization errors, namely
insertion and deletion (insdel) errors. Insdel Locally Decodable Codes (Insdel LDCs) are …

We examine new ways in which coding theory and cryptography continue to be composed
together, and show that the composition of these two fields yield new constructions in the …

We formally introduce, define, and construct memory-hard puzzles. Intuitively, for a difficulty
parameter t, a cryptographic puzzle is memory-hard if any parallel random access machine …