Blocki, Jeremiah
[Author];
Gandikota, Venkata
[Author];
Grigorescu, Elena
[Author];
Zhou, Samson
[Author]
;
Jeremiah Blocki and Venkata Gandikota and Elena Grigorescu and Samson Zhou
[Contributor]
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
We study variants of locally decodable and locally correctable codes in computationally bounded, adversarial channels, under the assumption that collision-resistant hash functions exist, and with no public-key or private-key cryptographic setup. Specifically, we provide constructions of relaxed locally correctable and relaxed locally decodable codes over the binary alphabet, with constant information rate, and poly-logarithmic locality. Our constructions compare favorably with existing schemes built under much stronger cryptographic assumptions, and with their classical analogues in the computationally unbounded, Hamming channel. Our constructions crucially employ collision-resistant hash functions and local expander graphs, extending ideas from recent cryptographic constructions of memory-hard functions.