Hash Chain Data Management for Falsification Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data governance techniques face challenges in performing falsification checks on processing histories without disclosing sensitive information, as access restrictions often hinder the verification of data processing histories.
Innovation Solution
A management program and apparatus that generates a simplified processing history linked through a hash chain, allowing for falsification checks without revealing non-public processing history details by coupling a public and non-public history data processing sequence, enabling tracking back to verify authenticity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Object-affected harmful factors
If access restriction is applied to processing histories, then information security is improved, but falsification check capability deteriorates
Solution Approach 1:
The processing history is divided into two separate chains: a public chain containing only hash values and a private chain containing detailed processing information. This segmentation allows the public chain to maintain accessibility for verification while the private chain secures sensitive information, resolving the contradiction between information security and falsification check capability.
Solution Approach 2:
The patent introduces an intermediary structure where the public processing history chain acts as a mediator between the private detailed history and the external verification system. The public chain stores condensed hash values that serve as intermediaries, enabling verification without exposing sensitive processing details, thus maintaining both security and reliability.
2Reliability
If detailed processing history is made public, then falsification check is improved, but information leakage increases
Solution Approach 1:
The patent extracts only the essential verification information (hash values) from the detailed processing history and places them in the public chain, while leaving the sensitive detailed information in the private chain. This extraction allows falsification check without information leakage, as the public chain contains minimal data that cannot reveal processing details.
Solution Approach 2:
The patent creates a simplified copy of the processing history in the public chain that contains only hash values rather than actual processing details. This copy serves the verification function without copying sensitive information, enabling falsification check while preventing information leakage of detailed processing content.
3Adaptability or versatility
If access restriction is applied to processing histories, then data governance is improved, but verification difficulty increases
Solution Approach 1:
The dual-chain structure segments verification into two parts: public verification of hash chain integrity and private access to detailed processing histories. This segmentation simplifies the verification process for external systems while maintaining data governance control, as only hash verification is needed publicly without accessing restricted detailed information.
Solution Approach 2:
The patent creates a simplified public copy of the processing history containing only hash values, which greatly reduces verification difficulty compared to accessing detailed histories. The public chain provides an easy-to-verify simplified representation that maintains data governance while lowering verification complexity for external systems.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A management program causes a computer to execute a process including generating a data processing sequence in which a plurality of processing histories including processing contents of data are linked by chain coupling, setting a first processing history, to which access is restricted, in the data processing sequence, generating a second processing history that is associated with the first processing history, chain-coupling the second processing history to the data processing sequence, generating a third processing history that is chain-coupled to the first processing history and the second processing history, disclosing a first data chain that passes the first processing history to an owner of an access right to the first processing history, and disclosing a second data chain that passes the second processing history without passing the first processing history to a non-owner of the access right.