Standard
Expander graphs are non-malleable codes. / Rasmussen, Peter Michael Reichstein; Sahai, Amit.
1st Conference on Information-Theoretic Cryptography, ITC 2020. ed. / Yael Tauman Kalai; Adam D. Smith; Daniel Wichs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. p. 1-10 6 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Rasmussen, PMR & Sahai, A 2020,
Expander graphs are non-malleable codes. in YT Kalai, AD Smith & D Wichs (eds),
1st Conference on Information-Theoretic Cryptography, ITC 2020., 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, LIPIcs, vol. 163, pp. 1-10, 1st Conference on Information-Theoretic Cryptography, ITC 2020, Virtual, Boston, United States,
17/06/2020.
https://doi.org/10.4230/LIPIcs.ITC.2020.6
APA
Rasmussen, P. M. R., & Sahai, A. (2020).
Expander graphs are non-malleable codes. In Y. T. Kalai, A. D. Smith, & D. Wichs (Eds.),
1st Conference on Information-Theoretic Cryptography, ITC 2020 (pp. 1-10). [6] Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics, LIPIcs Vol. 163
https://doi.org/10.4230/LIPIcs.ITC.2020.6
Vancouver
Rasmussen PMR, Sahai A.
Expander graphs are non-malleable codes. In Kalai YT, Smith AD, Wichs D, editors, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2020. p. 1-10. 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).
https://doi.org/10.4230/LIPIcs.ITC.2020.6
Author
Rasmussen, Peter Michael Reichstein ; Sahai, Amit. / Expander graphs are non-malleable codes. 1st Conference on Information-Theoretic Cryptography, ITC 2020. editor / Yael Tauman Kalai ; Adam D. Smith ; Daniel Wichs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. pp. 1-10 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).
Bibtex
@inproceedings{61e286bcef3d4c8f9af36689c8280ca3,
title = "Expander graphs are non-malleable codes",
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.",
keywords = "Expander Graph, Mixing Lemma, Non-Malleable Code",
author = "Rasmussen, {Peter Michael Reichstein} and Amit Sahai",
note = "Publisher Copyright: {\textcopyright} Peter Michael Reichstein Rasmussen and Amit Sahai; licensed under Creative Commons License CC-BY; 1st Conference on Information-Theoretic Cryptography, ITC 2020 ; Conference date: 17-06-2020 Through 19-06-2020",
year = "2020",
doi = "10.4230/LIPIcs.ITC.2020.6",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "1--10",
editor = "Kalai, {Yael Tauman} and Smith, {Adam D.} and Daniel Wichs",
booktitle = "1st Conference on Information-Theoretic Cryptography, ITC 2020",
}
RIS
TY - GEN
T1 - Expander graphs are non-malleable codes
AU - Rasmussen, Peter Michael Reichstein
AU - Sahai, Amit
N1 - Publisher Copyright:
© Peter Michael Reichstein Rasmussen and Amit Sahai; licensed under Creative Commons License CC-BY
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
KW - Expander Graph
KW - Mixing Lemma
KW - Non-Malleable Code
UR - http://www.scopus.com/inward/record.url?scp=85092780347&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.ITC.2020.6
DO - 10.4230/LIPIcs.ITC.2020.6
M3 - Article in proceedings
AN - SCOPUS:85092780347
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 1
EP - 10
BT - 1st Conference on Information-Theoretic Cryptography, ITC 2020
A2 - Kalai, Yael Tauman
A2 - Smith, Adam D.
A2 - Wichs, Daniel
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
T2 - 1st Conference on Information-Theoretic Cryptography, ITC 2020
Y2 - 17 June 2020 through 19 June 2020
ER -
