Paper 2026/637 Original: eprint.iacr.org/2026/637 ↗
VeriRAG: Efficient Zero-Knowledge Proofs for Verifiable Retrieval-Augmented Generation
Abstract
Retrieval-Augmented Generation (RAG) is widely used to enhance Large Language Models (LLMs), yet the "hallucination" characteristic allows malicious providers to bypass retrieval or claim non-existent data quality. To address these challenges, we present VeriRAG, a framework that leverages Zero-Knowledge Proofs (ZKP) to provide efficient integrity guarantees for RAG systems without compromising dataset privacy. Leveraging the robustness of AI inference, our framework supports Approximate Nearest Neighbor Search (ANNS)-based retrieval to avoid exhaustive searches. For the verification of top-$k$ sorting, we propose an innovative protocol that bypasses the intricate verification of sorting processes. To further enhance performance, we introduce a joint optimization leveraging vector lookup and chunk-merging strategies, which collectively drive down verification overhead while maintaining high generation accuracy. Experimental results demonstrate that VeriRAG scales efficiently to a 37GB dataset, achieving a prover time of 96s and a verifier time of 3s.
Metadata
- Available format(s)
PDF
- Category
- Applications
- Publication info
- Preprint.
- History
- 2026-04-01: last updated
- 2026-04-01: published
- Short URL
- https://ia.cr/2026/637
- License
- https://creativecommons.org/licenses/by-nc-nd/4.0/
BibTeX
@misc{cryptoeprint:2026/637,
author = {Chenqi Lin and Yubo Cui and Zhelei Zhou and Cheng Hong and Yufei Wang and Zhaohui Chen and Meng Li},
title = {VeriRAG: Efficient Zero-Knowledge Proofs for Verifiable Retrieval-Augmented Generation},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/637},
year = {2026},
url = {https://eprint.iacr.org/2026/637}
}