arXiv · 1810.00106
Expander Graphs are Non-Malleable Codes
Abstract
Any $d$-regular graph on $n$ vertices with spectral expansion $\lambda$ satisfying $n = \Omega(d^3\log(d)/\lambda)$ yields a $O\left(\frac{\lambda^{3/2}}{d}\right)$-non-malleable code for single-bit messages in the split-state model.
Explore related subjects
Keep this discovery
Peter M. R. Rasmussen, Amit Sahai. 2018-09-28. Expander Graphs are Non-Malleable Codes. https://arxiv.org/abs/1810.00106
Cite the original work for its findings. Save a collection to share your selection of sources.