Chained Data Record Hash-Linking for Integrity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ensuring data integrity and immutability across multiple parties in environments like supply chain management and healthcare, where data breaches can lead to mistrust and financial losses, is challenging due to the complexity of verifying and maintaining data integrity across different systems and stakeholders.
Innovation Solution
A data integrity network is established using sequences of chained data records, where each data record is hash-bound to the previous one using cryptographic hash functions, creating a tamper-proof tangle that requires cooperation from multiple parties to manipulate, thus ensuring high integrity and privacy without the need for consensus methods or central authorities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional centralized data storage and verification methods are used, then data integrity can be maintained through central authority control, but the system complexity increases and single points of failure create vulnerability to breaches and manipulation
Solution Approach 1:
The patent segments the centralized verification authority into multiple distributed nodes that collectively maintain the hash chain. Each node independently validates data integrity through cryptographic hashing, eliminating the need for a single central authority while maintaining or improving reliability through distribution.
Solution Approach 2:
The patent introduces cryptographic hash functions as an intermediary mechanism that enables trustless verification between parties. The hash chain acts as a mathematical mediator that proves data integrity without requiring direct trust or complex coordination between nodes.
2Adaptability or versatility
If multiple parties can access and share data, then interoperability and collaboration improve, but the risk of unauthorized manipulation and loss of data integrity increases
Solution Approach 1:
The patent applies preliminary action by pre-hashing data before distribution and embedding hash references in the chain structure. This preliminary cryptographic processing ensures that any subsequent manipulation attempts can be detected, allowing multiple parties to access data safely without increasing manipulation risk.
3Reliability
If data is chained using cryptographic hash functions, then tamper-proof integrity is achieved, but the computational overhead and processing time increase
Solution Approach 1:
The patent applies local quality by having each node independently compute and verify only its local segment of the hash chain rather than processing the entire chain. This localized approach maintains tamper-proof integrity through cryptographic hashing while significantly reducing computational overhead and improving processing throughput.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This approach provides immediate and provable data integrity, reducing the risk of data manipulation and ensuring high security and privacy, as altering data would require significant effort and cooperation from multiple nodes, making it costly and complex.
Implementation Method 1
obtain a first hash value of a first data record, the first data record being part of a first sequence of chained data records... obtain a second hash value of a second data record... generate a new data record comprising a hash value, wherein the hash value is based on the first hash value of the first sequence of chained data records and on the second hash value of the second sequence of chained data records
Data Source
AI summary
It is provided an apparatus comprising interface circuitry, machine-readable instructions, and processing circuitry to execute the machine-readable instructions. The machine-readable instructions comprise instructions to obtain a first hash value of a first data record which is part of a first sequence of chained data records. The machine-readable instructions comprise instructions to obtain a second hash value of a second data record which is part of a second sequence of chained data records. The machine-readable instructions comprise instructions to generate a new data record comprising a hash value which is based on the first hash value of the first sequence of chained data records and on the second hash value of the second sequence of chained data records. The machine-readable instructions comprise instructions to add the new data record to the first sequence. The new data record following the first data record in the first sequence.