Abstract
Any d-regular graph on n vertices with spectral expansion ? satisfying n = ?(d3 log(d)/?) yields a O (?3d/2 ) -non-malleable code for single-bit messages in the split-state model.
Original language | English |
---|---|
Title of host publication | 1st Conference on Information-Theoretic Cryptography, ITC 2020 |
Editors | Yael Tauman Kalai, Adam D. Smith, Daniel Wichs |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publication date | 2020 |
Pages | 1-10 |
Article number | 6 |
ISBN (Electronic) | 9783959771511 |
DOIs | |
Publication status | Published - 2020 |
Event | 1st Conference on Information-Theoretic Cryptography, ITC 2020 - Virtual, Boston, United States Duration: 17 Jun 2020 → 19 Jun 2020 |
Conference
Conference | 1st Conference on Information-Theoretic Cryptography, ITC 2020 |
---|---|
Country/Territory | United States |
City | Virtual, Boston |
Period | 17/06/2020 → 19/06/2020 |
Series | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 163 |
ISSN | 1868-8969 |
Bibliographical note
Publisher Copyright:© Peter Michael Reichstein Rasmussen and Amit Sahai; licensed under Creative Commons License CC-BY
Keywords
- Expander Graph
- Mixing Lemma
- Non-Malleable Code