AI Chat AI Image Generator AI Video Text to Speech

Expander Graphs are Non-Malleable Codes

09/28/2018

∙

by Peter M. R. Rasmussen, et al.

∙

∙

Any d-regular graph on n nodes with spectral expansion λ satisfying n = Ω(d^3(d)/λ) yields a O(λ^3/2/d)-non-malleable code in the split-state model.

Peter M. R. Rasmussen
6 publications
Amit Sahai
2 publications

page 1

page 2

page 3

page 4

research

∙ 05/31/2022

On the coset graph construction of distance-regular graphs

We show that no more new distance-regular graphs in the tables of the bo...

0 Minjia Shi, et al. ∙

research

∙ 10/20/2022

On completely regular codes with minimum eigenvalue in geometric graphs

We prove that any completely regular code with minimum eigenvalue in any...

0 I. Yu. Mogilnykh, et al. ∙

research

∙ 09/28/2018

A new approach to the Kasami codes of type 2

The dual of the Kasami code of length q^2-1, with q a power of 2, is con...

0 Minjia Shi, et al. ∙

research

∙ 08/26/2019

Breadth-first search on a Ramanujan graph

The behavior of the randomized breadth-first search algorithm is analyze...

0 Janko Boehm, et al. ∙

research

∙ 09/29/2021

On Near Optimal Spectral Expander Graphs of Fixed Size

We present a pair of heuristic algorithms. The first is to generate a ra...

0 Clark Alexander, et al. ∙

research

∙ 04/14/2018

Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More

We present explicit constructions of non-malleable codes with respect to...

0 Eshan Chattopadhyay, et al. ∙

research

∙ 02/20/2020

Iterated Global Models for Complex Networks

We introduce the Iterated Global model as a deterministic graph process ...

0 Anthony Bonato, et al. ∙