5 citations · 13 across the 9 of their papers we have counts for
4 papers · 2 filters
Rényi divergence-based uniformity guarantees for -universal hash functions
Madhura Pathegama, Alexander Barg
Universal hash functions map the output of a source to random strings over a finite alphabet, aiming to approximate the uniform distribution on the set of strings. A classic result…
Limitations of the decoding-to-LPN reduction via code smoothing
Madhura Pathegama, Alexander Barg
The Learning Parity with Noise (LPN) problem underlines several classic cryptographic primitives. Researchers have attempted to demonstrate the algorithmic hardness of this problem…
Generalized regenerating codes and node repair on graphs
Adway Patra, Alexander Barg
We consider regenerating codes in distributed storage systems where connections between the nodes are constrained by a graph. In this problem, the failed node downloads the informa…
Rényi divergence guarantees for hashing with linear codes
Madhura Pathegama, Alexander Barg
We consider the problem of distilling uniform random bits from an unknown source with a given -entropy using linear hashing. As our main result, we estimate the expected -div…