Database Query Verification Using Commitments and Proof Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for verifying database query results in outsourced databases, particularly those hosted by untrusted third parties, are inefficient and add significant computation overhead, limiting scalability and trustworthiness.
Innovation Solution
A verifier device generates commitments from received data and uses these commitments to verify query results through partial and overall proofs, leveraging GPUs for parallel processing to enhance scalability and trust in decentralized databases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If current verification methods are used to verify database query results, then trustworthiness of query results is improved, but computation overhead increases significantly
Solution Approach 1:
The verification process is segmented into two distinct roles: a prover device that generates proofs and a verifier device that validates them. This segmentation allows the heavy computational burden of proof generation to be separated from the lightweight verification process, reducing overall system complexity while maintaining trustworthiness.
Solution Approach 2:
A commitment object serves as an intermediary between the database and the verifier. The commitment object binds the database state to a verifiable representation without requiring the verifier to directly access or process the entire database, thereby reducing computation overhead while ensuring result trustworthiness.
2Reliability
If verification mechanisms are added to database queries, then trust in untrusted database hosts is improved, but scalability is limited
Solution Approach 1:
The verification logic is extracted from the core database query execution path and implemented as a separate proof generation and validation mechanism. This allows the database to scale independently while the verification system operates in parallel, maintaining trust without limiting scalability.
Solution Approach 2:
Instead of requiring the verifier to access the actual database data, a cryptographic copy (commitment) of the database state is used. This commitment copy enables verification of query results without the computational overhead of accessing and processing the full database, thus preserving scalability.
3Measurement precision
If direct verification of query results is implemented, then accuracy is improved, but computation time increases
Solution Approach 1:
The database state is pre-bound to a commitment object that serves as a cryptographic fingerprint. This preliminary action allows for rapid verification of query results by comparing against the pre-computed commitment, ensuring accuracy without requiring time-consuming direct verification of the entire database state.
Data Source
AI summary
Methods, non-transitory computer readable media, and verifier and/or prover devices or query verification apparatuses are disclosed that generate a first commitment from received data and send the received data to a prover device for insertion into a table of a database. A query result and an overall proof are received from the prover device in response to a received query forwarded to the prover device and associated with the database table. The overall proof is generated from one or more partial proofs comprising one or more commitments generated from one or more intermediate values. The query result and an indication the query result was verified are returned in response to the received query after verifying the query result based on a second commitment to the query result generated using the first commitment and the overall proof.