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.
| Original language | English |
|---|---|
| Title of host publication | Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings |
| Editors | Rafael Pass, Krzysztof Pietrzak |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 530-549 |
| Number of pages | 20 |
| ISBN (Print) | 9783030643805 |
| DOIs | |
| State | Published - 2020 |
| Externally published | Yes |
| Event | 18th International Conference on Theory of Cryptography, TCCC 2020 - Durham, United States Duration: 16 Nov 2020 → 19 Nov 2020 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 12552 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 18th International Conference on Theory of Cryptography, TCCC 2020 |
|---|---|
| Country/Territory | United States |
| City | Durham |
| Period | 16/11/20 → 19/11/20 |
Bibliographical note
Funding Information:Acknowledgments. This work was done (in part) while the authors were visiting the Simons Institute for the Theory of Computing. Eylon Yogev is funded by the ISF grants 484/18, 1789/19, Len Blavatnik and the Blavatnik Foundation, and The Blavatnik Interdisciplinary Cyber Research Center at Tel Aviv University.
Publisher Copyright:
© International Association for Cryptologic Research 2020.