2026-07-25T09:49:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12111 2024-03-06T10:49:33Z ddc:004 open_access

Expander Graphs Are Non-Malleable Codes Rasmussen, Peter Michael Reichstein Sahai, Amit Non-Malleable Code Expander Graph Mixing Lemma Any d-regular graph on n vertices with spectral expansion λ satisfying n = Ω(d³log(d)/λ) yields a O((λ^{3/2})/d)-non-malleable code for single-bit messages in the split-state model. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Peter Michael Reichstein Rasmussen and Amit Sahai 2020 Is Part Of LIPIcs, Volume 163, 1st Conference on Information-Theoretic Cryptography (ITC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITC.2020.6 urn:nbn:de:0030-drops-121114 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2020.6 eng https://creativecommons.org/licenses/by/3.0/legalcode