Content Verification System Using XOR Hash Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing high-capacity content verification methods, such as the Merkle Hash Tree scheme, increase transmission and calculation loads due to the need to transmit witness and signature values with each segment and repeated hash calculations, making them inefficient for verifying the integrity of divided content.
Innovation Solution
A validation system that divides content into segments, calculates hash values, generates a content hash value through an XOR operation, signs it with a signature key, and creates verification information for each segment, reducing the need for repeated calculations and transmission of signature values by using a signature device to verify segment integrity through comparison with a public key.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the Merkle Hash Tree scheme is used to verify segmented content, then the integrity of each segment can be verified, but the transmission load increases due to transmitting witness and signature values with each segment
Solution Approach 1:
The patent extracts only the essential verification elements (hash values of segments) from the traditional Merkle Hash Tree scheme, eliminating the need to transmit witness nodes and signature values with each segment. The verification information is simplified to contain only the hash values that are necessary for integrity checking, thereby reducing transmission load while maintaining verification capability.
Solution Approach 2:
Instead of transmitting complex witness and signature structures, the patent uses simplified hash value copies that represent the essential verification information. Each segment carries its own hash value and a compact verification information structure, eliminating the need for redundant witness node transmissions.
2Reliability
If the Merkle Hash Tree scheme is used to verify segmented content, then the integrity of each segment can be verified, but the calculation load increases due to repeated hash calculations
Solution Approach 1:
The patent performs preliminary hashing of each segment to generate its hash value before transmission. The verification information is pre-calculated and embedded in the segment data, so that during verification, no repeated hash calculations along the tree path are needed. The verification process simply compares the received hash values against the verification information.
3Reliability
If witness and signature values are transmitted with each segment, then segment authenticity can be verified, but the overall system efficiency decreases
Solution Approach 1:
The patent changes the parameter structure of verification information from the traditional Merkle Hash Tree format (which includes multiple witness nodes and signature values) to a simplified format containing only essential hash values. This parameter simplification maintains authenticity verification capability while dramatically improving verification efficiency by reducing both transmission and processing overhead.
Data Source
AI summary
Provided are methods and a validation system that includes a signature device and a verification device for verifying a content. The signature device may generate verification information for each segment of a divided content and may generate signature information to verify the integrity of each segment and whether a corresponding segment is a part of a content. When a segment is received, the verification device may verify integrity of the segment and whether the segment is a part of the content, based on the verification information and the signature value received from the signature device.