Transparent error correcting in a computationally bounded world

Ofer Grossman; Justin Holmgren; Eylon Yogev

doi:10.1007/978-3-030-64381-2_19

Transparent error correcting in a computationally bounded world

Ofer Grossman, Justin Holmgren, Eylon Yogev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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	https://doi.org/10.1007/978-3-030-64381-2_19
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

Publisher Copyright:
© International Association for Cryptologic Research 2020.

Funding

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.

Funders	Funder number
Blavatnik Foundation
Israel Science Foundation	1789/19, 484/18
Tel Aviv University

Access to Document

10.1007/978-3-030-64381-2_19

Cite this

Grossman, O., Holmgren, J., & Yogev, E. (2020). Transparent error correcting in a computationally bounded world. In R. Pass, & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 530-549). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12552 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-64381-2_19

Grossman, Ofer ; Holmgren, Justin ; Yogev, Eylon. / Transparent error correcting in a computationally bounded world. Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. editor / Rafael Pass ; Krzysztof Pietrzak. Springer Science and Business Media Deutschland GmbH, 2020. pp. 530-549 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bcd0bca629104ee79fb83467f0d525b3,

title = "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.",

author = "Ofer Grossman and Justin Holmgren and Eylon Yogev",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2020.; 18th International Conference on Theory of Cryptography, TCCC 2020 ; Conference date: 16-11-2020 Through 19-11-2020",

year = "2020",

doi = "10.1007/978-3-030-64381-2_19",

language = "אנגלית",

isbn = "9783030643805",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "530--549",

editor = "Rafael Pass and Krzysztof Pietrzak",

booktitle = "Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings",

address = "גרמניה",

}

Grossman, O, Holmgren, J & Yogev, E 2020, Transparent error correcting in a computationally bounded world. in R Pass & K Pietrzak (eds), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12552 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 530-549, 18th International Conference on Theory of Cryptography, TCCC 2020, Durham, United States, 16/11/20. https://doi.org/10.1007/978-3-030-64381-2_19

Transparent error correcting in a computationally bounded world. / Grossman, Ofer; Holmgren, Justin; Yogev, Eylon.
Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. ed. / Rafael Pass; Krzysztof Pietrzak. Springer Science and Business Media Deutschland GmbH, 2020. p. 530-549 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12552 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Transparent error correcting in a computationally bounded world

AU - Grossman, Ofer

AU - Holmgren, Justin

AU - Yogev, Eylon

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85098267590&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-64381-2_19

DO - 10.1007/978-3-030-64381-2_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85098267590

SN - 9783030643805

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 530

EP - 549

BT - Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings

A2 - Pass, Rafael

A2 - Pietrzak, Krzysztof

PB - Springer Science and Business Media Deutschland GmbH

T2 - 18th International Conference on Theory of Cryptography, TCCC 2020

Y2 - 16 November 2020 through 19 November 2020

ER -

Grossman O, Holmgren J, Yogev E. Transparent error correcting in a computationally bounded world. In Pass R, Pietrzak K, editors, Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 530-549. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-64381-2_19

Transparent error correcting in a computationally bounded world

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this