Metraipolis › archive › dc_87dd38ccea05
Hopper: Bounded-Memory Collaborative Debiasing for Byzantine-Tolerant Peer Sampling — arXiv:2609.19893
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19893
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T03:48:59.021Z
- SHA-256 of the archived text
4e300557c6fb92f64ee2b6d46c22b015564be79f460da741ed792bfd7c95b2f5- Stable URL of this page
https://metraipolis.com/documento/dc_87dd38ccea05
How to cite
Hopper: Bounded-Memory Collaborative Debiasing for Byzantine-Tolerant Peer Sampling — arXiv:2609.19893 — arXiv (en), https://arxiv.org/abs/2609.19893 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87dd38ccea05 (Metraipolis archive dc_87dd38ccea05, sha256 4e300557c6fb92f64ee2b6d46c22b015564be79f460da741ed792bfd7c95b2f5)
BibTeX
@misc{dc87dd38ccea05,
title = {Hopper: Bounded-Memory Collaborative Debiasing for Byzantine-Tolerant Peer Sampling — arXiv:2609.19893},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19893},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87dd38ccea05; sha256 4e300557c6fb92f64ee2b6d46c22b015564be79f460da741ed792bfd7c95b2f5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19893. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Byzantine-tolerant peer sampling relies on continuously refreshed views, yet an adversary can bias the identifier streams used to construct them. Frequency-aware debiasing downweights overrepresented identifiers, but existing designs rely on cumulative per-identifier counts. We show that even exact, unbounded counters fail under a delayed balanced attack, in which a long benign prefix masks a subsequent adversarial frequency shift. We introduce Hopper, a bounded-memory debiasing protocol for Byzantine-tolerant peer sampling. We identify the stream-estimation properties required for debiasing and select BitMatcher as the estimator that best preserves adversarial frequency structure among the evaluated alternatives. Hopper adds BMDecay, a saturation-triggered decay and reconstruction mechanism that keeps this signal fresh over long executions. Hopper also supports trusted collaboration through authenticated fingerprint-aware reconstruction and role-specific debiasing. Experiments show that Hopper recovers from delayed attacks faster than when relying on BitMatcher, and debiaising as well as non-debiasing baselines under a fixed memory budget. Trusted collaboration reduces post-attack pollution peaks but creates a re-identification trade-off at high trusted-node densities. These results show the importance of occurence freshness, rather than exact counting alone, as a key requirement for practical frequency-aware Byzantine peer sampling. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DC). Categorie arXiv: Cryptography and Security (cs.CR) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.19893 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T03:24:19.937Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).