Merkle Tree Data Frame Grouping for Secure Streaming
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data security methods, particularly key-based encryption, face challenges in efficiently securing large data sets like video frames, leading to delays, increased storage requirements, and administrative burdens, while also relying on third-party certificate authorities and risking corruption or tampering.
Innovation Solution
A system that subdivides data streams into frames, computes a group signature using a Merkle tree or Guardtime infrastructure, allowing for real-time transmission with reduced storage and processing burdens, and verifies data integrity without relying on key-based encryption or third-party authorities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If key-based encryption is used to secure data streams, then data security is improved, but transmission delay increases and processing burden increases
Solution Approach 1:
The patent segments the data stream into individual frames or blocks, and further divides each frame into smaller data units. Instead of encrypting entire frames with separate keys, it processes smaller units that can be grouped and secured more efficiently. This segmentation reduces the computational overhead per unit of data while maintaining security through the use of hash trees that can verify multiple units with a single verification operation.
Solution Approach 2:
The patent performs preliminary hashing of data units before transmission, creating a hash tree structure in advance. The root hash of this tree is then used for verification purposes. This preliminary action allows the receiving end to verify data integrity without performing complex decryption operations on each frame, thereby reducing transmission delay and processing burden while maintaining security.
2Reliability
If key-based encryption is used to secure data streams, then data security is improved, but storage requirements increase
Solution Approach 1:
By segmenting data into units and creating a hash tree structure, the patent reduces the amount of key material that needs to be stored. Instead of storing separate encryption keys for each frame or large data block, the system stores hash values that are more compact. The hash tree root serves as a compact representation that can verify the integrity of multiple data units, significantly reducing storage requirements compared to traditional key-based approaches.
3Reliability
If key-based encryption is used to secure data streams, then data security is improved, but administrative burden increases
Solution Approach 1:
The patent extracts the complex key management requirements from the data transmission process by using hash-based message authentication. Instead of requiring the receiving end to maintain and manage encryption keys that match the transmitting end, the system uses public hash functions that can be verified without secret key exchange. This extraction of key management complexity eliminates the need for third-party certificate authorities and simplifies administrative burden while maintaining security verification capabilities.
4Productivity
If streams are encrypted in smaller units to reduce delay, then transmission speed is improved, but key management complexity increases
Solution Approach 1:
The patent merges multiple small data units into a hash tree structure where the root hash represents the collective integrity of all units. This merging allows the system to process and verify multiple small units together, maintaining the transmission speed benefits of small-unit processing while eliminating the need for separate key management for each unit. The hash tree structure combines verification functionality for multiple units into a single verification operation, reducing key management complexity.
Data Source
AI summary
Data acquired, for example by a mobile platform, such as a sequence of images observed by a mobile platform, is grouped. A signature is computed for each group and is transmitted along with frame data to a reception system, which verifies correct transmission based on the group signature. The signature may be a root value of a hash tree that has at least selected ones of each group as inputs. Transmission events may also be separately signed as a whole using an event validation system. Although the signature maybe computed for all frames in a group, it may also be computed based on only a subset, selected pseudo-randomly.