R.I.P.
👻
Ghosted
Expander Graphs are Non-Malleable Codes
September 28, 2018 · Declared Dead · 🏛 IACR Cryptology ePrint Archive
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Peter M. R. Rasmussen, Amit Sahai
arXiv ID
1810.00106
Category
cs.CR: Cryptography & Security
Cross-listed
cs.DM
Citations
5
Venue
IACR Cryptology ePrint Archive
Last Checked
4 months ago
Abstract
Any $d$-regular graph on $n$ vertices with spectral expansion $λ$ satisfying $n = Ω(d^3\log(d)/λ)$ yields a $O\left(\frac{λ^{3/2}}{d}\right)$-non-malleable code for single-bit messages in the split-state model.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Cryptography & Security
R.I.P.
👻
Ghosted
The Limitations of Deep Learning in Adversarial Settings
R.I.P.
👻
Ghosted
Distillation as a Defense to Adversarial Perturbations against Deep Neural Networks
R.I.P.
👻
Ghosted
Spectre Attacks: Exploiting Speculative Execution
R.I.P.
👻
Ghosted
How To Backdoor Federated Learning
R.I.P.
👻
Ghosted
Evasion Attacks against Machine Learning at Test Time
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted