Metraipolis › archive › dc_f43c111df19d

Failure-Resilient and Verifiable Distributed Approximate Nearest-Neighbor Retrieval — arXiv:2610.34608

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.34608
License (as archived)
CC0-1.0
Archived
2026-10-27T08:14:26.265Z
SHA-256 of the archived text
ba45791de2f90e100382aaa99d372bb3e4108d5d60b300b71f75fe68eba5698f
Stable URL of this page
https://metraipolis.com/documento/dc_f43c111df19d

How to cite

Failure-Resilient and Verifiable Distributed Approximate Nearest-Neighbor Retrieval — arXiv:2610.34608 — arXiv (en), https://arxiv.org/abs/2610.34608 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f43c111df19d (Metraipolis archive dc_f43c111df19d, sha256 ba45791de2f90e100382aaa99d372bb3e4108d5d60b300b71f75fe68eba5698f)
BibTeX
@misc{dcf43c111df19d,
  title = {Failure-Resilient and Verifiable Distributed Approximate Nearest-Neighbor Retrieval — arXiv:2610.34608},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.34608},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f43c111df19d; sha256 ba45791de2f90e100382aaa99d372bb3e4108d5d60b300b71f75fe68eba5698f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.34608. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Distributed vector databases increasingly support security-sensitive applications, yet existing systems primarily protect index integrity or replica availability rather than the trustworthiness of retrieved results. Consequently, a compromised replica can return a plausible but manipulated result that remains cryptographically valid, while conventional replication and Byzantine defenses do not directly establish whether the retrieved results are trustworthy. We present TrustANN, a middleware layer that provides query-level trust for distributed approximate nearest-neighbor (ANN) retrieval without modifying the underlying ANN algorithm. TrustANN introduces three complementary protocols: TrustBind, which verifies retrieval trust from authenticated, consistent, and failure-domain-independent replica evidence; CoordShift, which asynchronously constructs reusable coordination epochs outside the query critical path; and AvailGuard, which performs bounded recovery when replicas are unavailable, stale, or conflicting while preserving the trust criterion. Queries are marked Trusted only when sufficient independent evidence exists for every relevant shard; otherwise, TrustANN returns Unverified. On an AWS deployment using distributed FAISS HNSW, TrustANN reduces retrieval attack success rate from 1.000 to 0.000 under the tested Byzantine-retrieval attack with two-of-three replica verification. The verification layer increases clean p95 latency by only 9.36%. Under replica crashes, TrustANN maintains trusted retrieval through 33% failures and correctly returns Unverified when sufficient evidence is unavailable.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.34608 — 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-27T07:56:15.144Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).