Commitment Key Ownership Proof With Verifier-Restricted ZK Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain systems lack a method for a data owner to control who can verify the correctness of their data, as multiple verifiers can potentially gain partial knowledge of the commitment key, allowing unauthorized verification.
Innovation Solution
A computer-implemented method using a commitment key with a secret trapdoor value x, iteratively computing challenge proof portions and generating a non-interactive zero-knowledge proof to prove sole ownership or possession, ensuring only the designated verifier can verify the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a commitment key is shared with multiple verifiers, then verification accessibility is improved, but security deteriorates as verifiers may gain partial knowledge of the key
Solution Approach 1:
The commitment key is divided into multiple shares, with each verifier receiving only a specific share. This segmentation allows multiple verifiers to access the key for verification purposes while preventing any single verifier from obtaining complete knowledge of the key, thus resolving the contradiction between verification accessibility and key security
Solution Approach 2:
A threshold secret sharing mechanism acts as an intermediary between the key owner and verifiers. The threshold scheme ensures that verification can proceed when sufficient shares are collected, while maintaining security by requiring collaboration among multiple parties, thereby balancing accessibility and security
2Loss of information
If zero-knowledge proofs are used to prove ownership, then data privacy is improved, but computational complexity increases
Solution Approach 1:
The system implements zero-knowledge proofs that provide more privacy protection than strictly necessary by ensuring complete ownership verification without revealing any additional information. This partial action approach uses efficient cryptographic primitives to achieve strong privacy guarantees with acceptable computational overhead
Solution Approach 2:
The system adjusts the complexity parameters of the zero-knowledge proof protocol based on the specific verification requirements. By optimizing the proof parameters and using efficient cryptographic algorithms, the system achieves strong privacy protection while keeping computational complexity within acceptable limits for practical applications
Data Source
AI summary
A computer-implemented method for proving sole ownership of a commitment key. The commitment key comprises two elements and a secret trapdoor value x defines a relationship between the elements of the commitment key. A challenge proof portion πi is iteratively computed for a predefined number of iterations d, wherein the challenge proof portion is generated based on succinct commitments derived using the secret trapdoor value x. A challenge proof π is generated based on the challenge proof portions πi. The challenge proof π is made available to a verifier. The challenge proof π is a non-interactive zero-knowledge proof proving knowledge of the secret trapdoor value x.