DBScholar

Back to papers

PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification

Summary: PoneglyphDB provides confidential data handling with verifiable SQL results via non-interactive zero-knowledge proofs. It engineers efficient SQL circuits (PLONKish, recursive proofs, low-degree constraints) and composes them for complex queries, demonstrated on TPC-H with improved ZKP performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7118
Venue
SIGMOD
Year
2025
Pagerank
5.2209769e-05
Overall Rank
9,770 | 32.97%
DOI
10.1145/3709713

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gu_sigmod25,
        title = {{PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification}},
        author = {Gu, Binbin and Fang, Juncheng and Nawab, Faisal},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709713},
        url = {https://dl.acm.org/doi/10.1145/3709713},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,391 Privacy-preserving and Verifiable Causal Prescriptive Analytics 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers