[Resource Topic] 2018/929: Expander Graphs are Non-Malleable Codes

Welcome to the resource topic for 2018/929

Title:
Expander Graphs are Non-Malleable Codes

Authors: Peter M. R. Rasmussen, Amit Sahai

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.

ePrint: https://eprint.iacr.org/2018/929

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .