Paper 2020/1411 Original: eprint.iacr.org/2020/1411 ↗
Transparent Error Correcting in a Computationally Bounded World
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2020-11-17: last updated
- 2020-11-15: published
- Short URL
- https://ia.cr/2020/1411
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/1411,
author = {Ofer Grossman and Justin Holmgren and Eylon Yogev},
title = {Transparent Error Correcting in a Computationally Bounded World},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/1411},
year = {2020},
url = {https://eprint.iacr.org/2020/1411}
}