Pith. sign in

REVIEW 4 cited by

FRAG: Toward Federated Vector Database Management for Collaborative and Secure Retrieval-Augmented Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.13272 v1 pith:FCQGKJ5U submitted 2024-10-17 cs.CR cs.DB

FRAG: Toward Federated Vector Database Management for Collaborative and Secure Retrieval-Augmented Generation

classification cs.CR cs.DB
keywords fragfederatedgenerationmanagementpartiesretrieval-augmentedassumptionschallenges
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper introduces \textit{Federated Retrieval-Augmented Generation (FRAG)}, a novel database management paradigm tailored for the growing needs of retrieval-augmented generation (RAG) systems, which are increasingly powered by large-language models (LLMs). FRAG enables mutually-distrusted parties to collaboratively perform Approximate $k$-Nearest Neighbor (ANN) searches on encrypted query vectors and encrypted data stored in distributed vector databases, all while ensuring that no party can gain any knowledge about the queries or data of others. Achieving this paradigm presents two key challenges: (i) ensuring strong security guarantees, such as Indistinguishability under Chosen-Plaintext Attack (IND-CPA), under practical assumptions (e.g., we avoid overly optimistic assumptions like non-collusion among parties); and (ii) maintaining performance overheads comparable to traditional, non-federated RAG systems. To address these challenges, FRAG employs a single-key homomorphic encryption protocol that simplifies key management across mutually-distrusted parties. Additionally, FRAG introduces a \textit{multiplicative caching} technique to efficiently encrypt floating-point numbers, significantly improving computational performance in large-scale federated environments. We provide a rigorous security proof using standard cryptographic reductions and demonstrate the practical scalability and efficiency of FRAG through extensive experiments on both benchmark and real-world datasets.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. PRAG: End-to-End Privacy-Preserving Retrieval-Augmented Generation

    cs.CR 2026-04 unverdicted novelty 6.0

    PRAG delivers end-to-end private RAG with 72-74% recall via non-interactive homomorphic approximations, interactive client assistance, and operation-error estimation to preserve ranking quality.

  2. FedMosaic: Federated Retrieval-Augmented Generation via Parametric Adapters

    cs.CL 2026-02 conditional novelty 6.0

    FedMosaic is a federated RAG system that encodes local documents as mask-gated LoRA adapters, clusters related documents into shared adapters, and selectively merges only relevant, low-conflict adapters at the server.

  3. Efficient Federated Search for Retrieval-Augmented Generation using Lightweight Routing

    cs.LG 2025-02 unverdicted novelty 6.0

    RAGRoute introduces a neural router for federated RAG that dynamically selects relevant sources, reducing communication by up to 80.65% and latency by 52.50% while preserving accuracy on three benchmarks.

  4. A Survey on Foundation Models for Personalized Federated Intelligence

    cs.AI 2025-05 unverdicted novelty 3.0

    The survey introduces personalized federated intelligence (PFI) as a framework integrating federated learning and foundation models to support privacy-aware personalization of AI models.