{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:46:54Z","timestamp":1794592014355,"version":"4.9.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF","doi-asserted-by":"publisher","award":["CNS1815212 and SaTC-2245372"],"award-info":[{"award-number":["CNS1815212 and SaTC-2245372"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>In database applications involving sensitive data, the dual imperatives of data confidentiality and provable (verifiable) query processing are important. This paper introduces PoneglyphDB, a database system that leverages non-interactive zero-knowledge proofs (ZKP) to support both confidentiality and provability. Unlike traditional databases, PoneglyphDB enhances confidentiality by ensuring that raw data remains exclusively with the host, while also enabling verifying the correctness of query responses by providing proofs to clients.<\/jats:p>\n                  <jats:p>The main innovation in this paper is proposing efficient ZKP designs (called circuits) for basic operations in SQL query processing. These basic operation circuits are then combined to form ZKP circuits for larger, more complex queries. PoneglyphDB's circuits are carefully designed to be efficient by utilizing advances in cryptography such as PLONKish-based circuits, recursive proof composition techniques, and designing with low-order polynomial constraints. We demonstrate the performance of PoneglyphDB with the standard TPC-H benchmark. Our experimental results show that PoneglyphDB can efficiently achieve both confidentiality and provability, outperforming existing state-of-the-art ZKP methods.<\/jats:p>","DOI":"10.1145\/3709713","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-27","source":"Crossref","is-referenced-by-count":10,"title":["PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4452-0038","authenticated-orcid":false,"given":"Binbin","family":"Gu","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6901-8235","authenticated-orcid":false,"given":"Juncheng","family":"Fang","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2264-4600","authenticated-orcid":false,"given":"Faisal","family":"Nawab","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50021-4"},{"key":"e_1_2_1_2_1","volume-title":"SGX-MR-Prot: Efficient and Developer-Friendly Access-Pattern Protection in Trusted Execution Environments. In 2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)","author":"Mubashwir Alam AKM","unstructured":"AKM Mubashwir Alam, Justin Boyce, and Keke Chen. 2023. SGX-MR-Prot: Efficient and Developer-Friendly Access-Pattern Protection in Trusted Execution Environments. In 2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS). IEEE, 1029--1032."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064030"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536353"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings, Part III 39","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2019. Scalable zero knowledge with no trusted setup. In Advances in Cryptology--CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18--22, 2019, Proceedings, Part III 39. Springer, 701--732."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0221-0"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_2_1_9_1","volume-title":"Recursive proof composition without a trusted setup. Cryptology ePrint Archive","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Recursive proof composition without a trusted setup. Cryptology ePrint Archive (2019)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0023-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa Yuncong Hu Mary Maller Pratyush Mishra Noah Vesely and Nicholas Ward. 2020. Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In Advances in Cryptology--EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques Zagreb Croatia May 10--14 2020 Proceedings Part I 39. Springer 738--768.","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3595647.3595648"},{"key":"e_1_2_1_15_1","volume-title":"International colloquium on automata, languages, and programming","author":"Dwork Cynthia","unstructured":"Cynthia Dwork. 2006. Differential privacy. In International colloquium on automata, languages, and programming. Springer, 1--12."},{"key":"e_1_2_1_16_1","volume-title":"Conference on the theory and application of cryptographic techniques. Springer, 186--194","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir. 1986. How to prove yourself: Practical solutions to identification and signature problems. In Conference on the theory and application of cryptographic techniques. Springer, 186--194."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28419"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings, Part II 38","author":"Fuchsbauer Georg","year":"2018","unstructured":"Georg Fuchsbauer, Eike Kiltz, and Julian Loss. 2018. The algebraic group model and its applications. In Advances in Cryptology--CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018, Proceedings, Part II 38. Springer, 33--62."},{"key":"e_1_2_1_19_1","volume-title":"plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive","author":"Gabizon Ariel","year":"2020","unstructured":"Ariel Gabizon and Zachary J Williamson. 2020. plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive (2020)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6--8","author":"Goldwasser S.","year":"1985","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6--8, 1985, Providence, Rhode Island, USA."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12137"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.14"},{"key":"e_1_2_1_24_1","volume-title":"zk-oracle: Trusted off-chain compute and storage for decentralized applications. Distributed and Parallel Databases","author":"Gu Binbin","year":"2024","unstructured":"Binbin Gu and Faisal Nawab. 2024. zk-oracle: Trusted off-chain compute and storage for decentralized applications. Distributed and Parallel Databases (2024), 1--24."},{"key":"e_1_2_1_25_1","volume-title":"ML on Chain: The Case and Taxonomy of Machine Learning on Blockchain. In 2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC). IEEE, 1--18","author":"Gu Binbin","year":"2023","unstructured":"Binbin Gu, Abhishek Singh, Yinan Zhou, Juncheng Fang, and Faisal Nawab. 2023. ML on Chain: The Case and Taxonomy of Machine Learning on Blockchain. In 2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC). IEEE, 1--18."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3177733"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC '20). USENIX Association.","author":"Keahey Kate","year":"2020","unstructured":"Kate Keahey, Jason Anderson, Zhuo Zhen, Pierre Riteau, Paul Ruth, Dan Stanzione, Mert Cevik, Jacob Colleran, Haryadi S. Gunawi, Cody Hammock, Joe Mambretti, Alexander Barnes, Fran\u00e7ois Halbach, Alex Rocha, and Joe Stubbs. 2020. Lessons Learned from the Chameleon Testbed. In Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC '20). USENIX Association."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0039"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594513"},{"key":"e_1_2_1_31_1","volume-title":"RollStore: Hybrid Onchain-Offchain Data Indexing for Blockchain Applications","author":"Lin Qi","year":"2024","unstructured":"Qi Lin, Binbin Gu, and Faisal Nawab. 2024. RollStore: Hybrid Onchain-Offchain Data Indexing for Blockchain Applications. IEEE Transactions on Knowledge and Data Engineering (2024)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1980.10006"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660373"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752944"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.357"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"e_1_2_1_37_1","volume-title":"Veritasdb: High throughput key-value store with integrity. Cryptology ePrint Archive","author":"Sinha Rohit","year":"2018","unstructured":"Rohit Sinha and Mihai Christodorescu. 2018. Veritasdb: High throughput key-value store with integrity. Cryptology ePrint Archive (2018)."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings 11","author":"Tamassia Roberto","year":"2003","unstructured":"Roberto Tamassia. 2003. Authenticated data structures. In Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16--19, 2003. Proceedings 11. Springer, 2--5."},{"key":"e_1_2_1_39_1","unstructured":"Transaction Processing Council. 2023. TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/. Accessed: 2023-xx-xx."},{"key":"e_1_2_1_40_1","volume-title":"Libra: Succinct zero-knowledge proofs with optimal prover computation. In Advances in Cryptology--CRYPTO 2019: 39th Annual International Cryptology Conference","author":"Xie Tiacheng","year":"2019","unstructured":"Tiacheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct zero-knowledge proofs with optimal prover computation. In Advances in Cryptology--CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18--22, 2019, Proceedings, Part III 39. Springer, 733--764."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559849"},{"key":"e_1_2_1_42_1","volume-title":"Zhongle Xie, Meihui Zhang, Gang Chen, Beng Chin Ooi, and Xiaokui Xiao.","author":"Yue Cong","year":"2022","unstructured":"Cong Yue, Tien Tuan Anh Dinh, Zhongle Xie, Meihui Zhang, Gang Chen, Beng Chin Ooi, and Xiaokui Xiao. 2022. GlassDB: An efficient verifiable ledger database system through transparency. arXiv preprint arXiv:2207.00944 (2022)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598588"},{"key":"e_1_2_1_44_1","unstructured":"Zcash. [n. d.]. halo2. https:\/\/github.com\/zcash\/halo2"},{"key":"e_1_2_1_45_1","unstructured":"Zcash. 2021a. Halo2 Protocol. https:\/\/zcash.github.io\/halo2\/design\/protocol.html"},{"key":"e_1_2_1_46_1","unstructured":"Zcash. 2021b. PLONKish Arithmetization. https:\/\/zcash.github.io\/halo2\/concepts\/arithmetization.html"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"},{"key":"e_1_2_1_48_1","volume-title":"A zero-knowledge version of vSQL. Cryptology ePrint Archive","author":"Zhang Yupeng","year":"2017","unstructured":"Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2017b. A zero-knowledge version of vSQL. Cryptology ePrint Archive (2017)."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813711"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2381913.2381927"},{"key":"e_1_2_1_51_1","volume-title":"14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17)","author":"Zheng Wenting","year":"2017","unstructured":"Wenting Zheng, Ankur Dave, Jethro G Beekman, Raluca Ada Popa, Joseph E Gonzalez, and Ion Stoica. 2017. Opaque: An oblivious and encrypted distributed analytics platform. In 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17). 283--298."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457308"},{"key":"e_1_2_1_53_1","volume-title":"Beng Chin Ooi, and Xiaokui Xiao","author":"Zhu Yizheng","year":"2023","unstructured":"Yizheng Zhu, Yuncheng Wu, Zhaojing Luo, Beng Chin Ooi, and Xiaokui Xiao. 2023. Secure and verifiable data collaboration with low-cost zero-knowledge proofs. arXiv preprint arXiv:2311.15310 (2023)."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709713","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:21:05Z","timestamp":1774981265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709713"],"URL":"https:\/\/doi.org\/10.1145\/3709713","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}