VerfGraph advances zero-knowledge verifiable graph query evaluation
Original title: VerfGraph: Efficient Zero-Knowledge Verifiable Graph Query Evaluation System
VerfGraph cuts prover memory by 4.5x-6.6x and delivers 33.9x-59.7x speedups over ZKGraph on LDBC benchmarks.
VerfGraph is a zero-knowledge system enabling clients to verify graph query results over committed private data without disclosure. It improves on ZKGraph by introducing operator proofs for expansion and shortest-path operations that remove sorting and canonicalization steps. Novel proofs also cover count and weighted shortest-path queries. Evaluations on the LDBC Social Network Benchmark confirm millisecond verification with sub-MB proofs.
- VerfGraph eliminates edge canonicalization for bidirectional expansion
- Correctness proofs extend to count and weighted shortest-path operators
- Peak prover memory drops 4.5x-6.6x versus ZKGraph
- Proof generation speeds reach 33.9x-59.7x on complex IC queries
From the original article
1 min read at arxiv.orgGraph databases are often used to manage relationship-rich data, whose graph structure and attributes may be sensitive. In many applications, a database owner or a service provider evaluates queries over a private graph for a client. Because the graph cannot be fully disclosed and independently re-executing the query may be impractical, the client cannot directly verify the returned result.
By Tianyi Ma · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.