Zero-Knowledge Range Proofs for Fast Private Query Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems fail to provide robust, real-time verification of computational tasks outsourced to untrustworthy clients without revealing underlying datasets, particularly in verifiable computing applications like database queries.
Innovation Solution
A method and system using a zero-knowledge range proof scheme with logarithmic size and verification time, implemented through a bilinear group with Trusted Inner Pairing Product (TIPP) proof systems, ensuring accurate and privacy-preserving queries for Maximum, Minimum, Median, and k-th item queries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional zero-knowledge proof systems are used to verify computational tasks, then the accuracy and correctness of outsourced computations can be guaranteed, but the proof size and verification time become linear in the witness size, which is inefficient for real-time database queries
Solution Approach 1:
The patent transforms the verification problem from linear to logarithmic complexity by changing the mathematical parameters and structure of the proof system. Specifically, it uses a hierarchical proof structure where the prover generates commitments to intermediate results, and the verifier checks these commitments through a tree-like verification process. This parameter transformation reduces verification time from O(n) to O(log n) while maintaining proof accuracy through cryptographic soundness guarantees.
Solution Approach 2:
The patent segments the computational verification task into multiple independent stages: (1) the prover segments the witness into committed values, (2) intermediate proofs are generated for each segment, and (3) the verifier checks each segment independently before combining results. This segmentation allows parallel verification and reduces the overall verification time while maintaining complete verification accuracy through composability of zero-knowledge proofs.
2Reliability
If detailed computational proofs are provided to guarantee completeness and accuracy, then the verification reliability improves, but the underlying dataset must be revealed or the proof complexity increases significantly
Solution Approach 1:
The patent introduces cryptographic commitments as intermediary objects that bridge the gap between data secrecy and verification reliability. The prover commits to intermediate computational values using Pedersen commitments, which are binding but hiding. These commitments serve as intermediaries that allow the verifier to check computational correctness without seeing the actual underlying data values, thus maintaining data secrecy while ensuring completeness through the binding property of commitments.
Solution Approach 2:
The patent extracts only the essential verification information from the complete computational process. Instead of proving correctness of all intermediate steps with full data exposure, it extracts and proves only the critical path computations that guarantee result accuracy. This extraction approach maintains data secrecy by leaving non-essential computational details hidden while still providing sufficient proof for completeness verification through selective disclosure of committed values.
3Reliability
If linear-size proofs are used to verify database queries, then all computational tasks can be verified, but the proof size becomes prohibitively large for practical applications like Maximum, Minimum, Median and k-th item queries
Solution Approach 1:
The patent transitions from a one-dimensional linear proof structure to a two-dimensional hierarchical structure. Proofs are organized in a tree where leaves represent individual data element commitments and internal nodes represent aggregation operations. This dimensional change allows the proof size to grow logarithmically with the number of data elements rather than linearly, as each level of the tree aggregates multiple proofs into a single parent proof, reducing the total number of proof elements needed.
Solution Approach 2:
The patent merges multiple individual proofs into a single aggregated proof through homomorphic properties of the underlying cryptographic commitments. Instead of providing separate proofs for each data element in Maximum, Minimum, Median or k-th item queries, the system combines them into a single compact proof that verifies all computations simultaneously. This merging reduces proof size from O(n) individual proofs to O(1) aggregated proof while maintaining verification of all computational tasks through the algebraic structure of the commitments.
Data Source
AI summary
A system and a method for providing zero-knowledge range proofs for verifiable privacy-preserving queries are provided. The method comprises: defining a bilinear group; receiving, by a prover, a query from a verifier; determining a range proof for a result of the query implementing a variation of a bulletproof (BP) range proof system; generating a first inner product for the range proof, implementing the variation of the BP range proof system; generating a second inner product for the range proof, implementing a trusted inner pairing product (TIPP) proof system; and providing, by the prover, elements as the proof to the verifier.