Verifier-Generated Common Reference String for Zero-Knowledge Proofs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing zero-knowledge proof systems require significant computational resources and may involve trusted third-party generated common reference strings (CRS), which can be computationally expensive and vulnerable to cheating by the verifier.
Innovation Solution
The system allows a verifier node to generate a CRS using a random value, which is then transmitted to a prover node for use in executing a zero-knowledge proof. The prover node verifies the CRS using the random value and commits the output of the proof, ensuring that the verifier cannot cheat by obtaining secret information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a trusted third party generates the CRS, then the zero-knowledge proof can be verified, but the computational resources required increase and the system becomes vulnerable to cheating by the verifier
Solution Approach 1:
The patent inverts the traditional CRS generation model by switching from third-party generation to verifier-generated CRS. The verifier generates the CRS using a random value and transmits it to the prover, who then verifies it. This inversion eliminates the trusted third party and prevents verifier cheating while maintaining proof validity.
Solution Approach 2:
The verifier performs self-service by generating its own CRS independently without relying on a trusted third party. The verifier generates a random value, derives the CRS from it, and transmits it to the prover. This self-service approach ensures the verifier cannot cheat while reducing dependency on external trusted entities.
2Reliability
If a trusted third party generates the CRS, then the zero-knowledge proof can be verified, but the system complexity increases
Solution Approach 1:
The patent extracts and removes the trusted third party from the system architecture. By eliminating this complex component, the system achieves simpler structure while maintaining verification capability through the verifier-generated CRS approach.
Solution Approach 2:
The inversion of CRS generation from third-party to verifier-based model simplifies the system by removing the need for trusted third parties and their associated complexity, while still enabling reliable verification through cryptographic proofs.
3Use of energy by moving object
If the verifier generates the CRS using a random value, then the computational resources are reduced, but the verifier must ensure the CRS is generated correctly
Solution Approach 1:
The patent implements feedback mechanism where the prover receives the CRS from the verifier, verifies it using the random value, and provides feedback through the zero-knowledge proof process. This feedback loop ensures CRS accuracy without requiring additional computational resources for verification.
Solution Approach 2:
The verifier performs self-service CRS generation using its own random value without requiring external verification. The verifier independently generates the CRS and transmits it to the prover, who then verifies it, ensuring accuracy while minimizing computational overhead.
Data Source
AI summary
Methods, systems, and devices for data management are described. A verifier node may generate a common reference string (CRS) using a random value. The verifier node may transmit a message including the CRS to a prover node. The prover node may execute a zero-knowledge proof (ZKP) using the CRS and transmit, to the verifier node, a commitment of an output of the ZKP. The commitment of the output may be configured to hide the output from the verifier node until the output is revealed to the verifier node. The verifier node may transmit the random value. The prover node may determine whether the CRS is generated using the random value from the verifier node and either abort the cryptographic operation or reveal the commitment. The verifier node may verify that the output is a valid ZKP if the prover node reveals the commitment.


