Paradigms for unconditional pseudorandom generators
This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short,
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …
Locally decodable/correctable codes for insertions and deletions
Recent efforts in coding theory have focused on building codes for insertions and deletions,
called insdel codes, with optimal trade-offs between their redundancy and their error …
called insdel codes, with optimal trade-offs between their redundancy and their error …
Exponential lower bounds for locally decodable and correctable codes for insertions and deletions
Locally Decodable Codes (LDCs) are error-correcting codes for which individual message
symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors …
symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors …
Private and resource-bounded locally decodable codes for insertions and deletions
We construct locally decodable codes (LDCs) to correct insertion-deletion errors in the
setting where the sender and receiver share a secret key or where the channel is resource …
setting where the sender and receiver share a secret key or where the channel is resource …
Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
N Harvey, A Sahami - Proceedings of the 56th Annual ACM Symposium …, 2024 - dl.acm.org
Orthogonal arrays are a type of combinatorial design that emerged in the 1940s in the
design of statistical experiments. In 1947, Rao proved a lower bound on the size of any …
design of statistical experiments. In 1947, Rao proved a lower bound on the size of any …
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
Locally Decodable Codes (LDCs) are error-correcting codes $ C:\Sigma^
n\rightarrow\Sigma^ m $ with super-fast decoding algorithms. They are important …
n\rightarrow\Sigma^ m $ with super-fast decoding algorithms. They are important …
An improved sketching algorithm for edit distance
We provide improved upper bounds for the simultaneous sketching complexity of edit
distance. Consider two parties, Alice with input $ x\in\Sigma^ n $ and Bob with input …
distance. Consider two parties, Alice with input $ x\in\Sigma^ n $ and Bob with input …
Computationally relaxed locally decodable codes, revisited
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 …
Theory'21) and give two new constructions. Our first construction is a Hamming crLDC that is …
Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
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 …
parameter t, a cryptographic puzzle is memory-hard if any parallel random access machine …
Exploring the Composition of Coding Theory and Cryptography Through Secure Computation, Succinct Arguments, and Local Codes
AR Block - 2022 - search.proquest.com
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 …
together, and show that the composition of these two fields yield new constructions in the …