## CryptoDB

### Paper: Transparent Error Correcting in a Computationally Bounded World

Authors: Ofer Grossman Justin Holmgren Eylon Yogev Search ePrint Search Google 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.
##### BibTeX
@article{tcc-2020-30620,
title={Transparent Error Correcting in a Computationally Bounded World},
booktitle={Theory of Cryptography},
publisher={Springer},
author={Ofer Grossman and Justin Holmgren and Eylon Yogev},
year=2020
}