A grid-of-cliques protocol is proven to realize robust distributed arrays: constant-latency store and get with per-node storage of a 1/k2 slice, secure against an unbounded number of malicious nodes.
Robust random number generation for peer-to-peer systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
A grid-of-cliques protocol is proven to realize robust distributed arrays: constant-latency store and get with per-node storage of a 1/k2 slice, secure against an unbounded number of malicious nodes.