Welcome to the resource topic for 2020/1411
Title:
Transparent Error Correcting in a Computationally Bounded World
Authors: Ofer Grossman, Justin Holmgren, Eylon Yogev
Abstract:We construct uniquely decodable codes against channels which are computationally bounded. Our construction requires only a public-coin (transparent) setup. All prior work for such channels either required a setup with secret keys and states, could not achieve unique decoding, or got worse rates (for a given bound on codeword corruptions). On the other hand, our construction relies on a strong cryptographic hash function with security properties that we only instantiate in the random oracle model.
ePrint: https://eprint.iacr.org/2020/1411
Talk: https://www.youtube.com/watch?v=4dOZMS4Vyss
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .