Merkle Hash Tree Data Authentication for Computational Load Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for data authentication in content-centric, content delivery, and peer-to-peer networks face significant computational loads due to the generation and verification of electronic signatures, which can be inefficient and less flexible, especially when dealing with non-power-of-2 data segments, leading to decreased transmission efficiency and increased operational loads.
Innovation Solution
The method employs a Merkle hash tree (MHT) technique combined with a trapdoor hash function to generate and verify signature information, distributing the computational load by calculating signature information for a predetermined number of data segments rather than each segment individually, and using a digital signature algorithm to minimize computational effort while ensuring robustness against packet losses and transmission errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If electronic signature generation and verification are performed for each data segment individually, then data authentication security is improved, but computational load increases significantly
Solution Approach 1:
The patent divides data into multiple segments and applies Merkle hash tree structure to organize them hierarchically. Each segment is hashed and placed in the tree structure, allowing efficient batch verification. The root hash of the Merkle tree serves as a compact representation of all segments, enabling verification of multiple segments with a single signature operation rather than individual signatures for each segment.
Solution Approach 2:
The patent transitions from a flat one-to-one signature verification model to a hierarchical tree structure. By organizing segments in a Merkle hash tree, the system adds a dimensional layer of hierarchy where verification can occur at the root level. This dimensional change allows batch verification of multiple segments through a single root hash comparison, significantly reducing computational complexity from O(n) to O(1) for the signature verification part.
2Device complexity
If Merkle hash tree with trapdoor hash function is used for batch verification, then computational load is reduced, but handling non-power-of-2 data segments becomes less flexible
Solution Approach 1:
The patent implements a dynamic Merkle hash tree structure that can adapt to different numbers of data segments. When the number of segments is not a power of 2, the tree structure dynamically adjusts by creating empty placeholder nodes or balancing the tree differently. This dynamic adaptation allows the system to maintain the efficient batch verification properties while handling arbitrary numbers of segments, not just powers of 2.
Solution Approach 2:
The patent modifies the Merkle hash tree construction parameters to accommodate non-power-of-2 segment counts. Instead of requiring fixed power-of-2 structures, the system changes parameters such as tree depth, node distribution, and hashing strategies to optimize for the actual number of segments. This parameter flexibility allows efficient batch verification while adapting to various data segment configurations.
3Productivity
If digital signature algorithm is applied to minimize computational effort, then transmission efficiency is improved, but robustness against packet losses may be compromised
Solution Approach 1:
The patent performs preliminary hashing of all data segments into a Merkle hash tree structure before transmission. The root hash is computed in advance and signed with a digital signature. This preliminary action creates a compact authentication credential that remains valid even if individual segments are lost or corrupted during transmission. The receiver can verify the authenticity of received segments using the pre-computed root hash and signature, providing robustness against packet losses while maintaining transmission efficiency.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
Provided are apparatuses and methods of generating and verifying signature information for data authentication. A method of verifying signature information may involves receiving signature information with respect to a predetermined number of data segments from a transmitter, constructing a hash tree based on the signature information, and verifying a validity of the signature information, by verifying trapdoor hash values using a root hash value of the constructed hash tree.