Hash Chain Secure Token Passing via Blockchain
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Electronic records accessible through networks are vulnerable to unauthorized modification and alteration, making it difficult to detect and prevent changes, especially in distributed ledger systems.
Innovation Solution
A method for extending a hash chain by requesting a confirmation possession token, generating a confirmation hash digest, and linking expansion nodes to predecessor nodes to record privilege transfers between entities, ensuring secure token passing and transfer of resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If electronic records are made accessible through networks for rapid access and analysis, then convenience and accessibility are improved, but vulnerability to unauthorized modification and alteration increases
Solution Approach 1:
The system performs preliminary actions by pre-computing and storing hash digests of possession tokens in the hash chain before actual resource transfers occur. This allows for rapid verification of transfer legitimacy without real-time computation, maintaining both accessibility and security. The hash chain is built in advance with predetermined digest values that can be quickly validated.
Solution Approach 2:
The patent introduces hash digests as an intermediary element between possession tokens and verification processes. Instead of directly verifying possession tokens during resource transfers, the system uses pre-computed hash digests as mediators that can be rapidly compared and validated, enabling fast verification while maintaining security against unauthorized modifications.
2Reliability
If block chains are used to make electronic records resistant to unauthorized modification, then security and integrity are improved, but system complexity increases
Solution Approach 1:
The patent extracts the computationally intensive hashing operation from the real-time verification process and separates it into a preliminary setup phase. The complex hash chain construction is performed in advance, while the verification process only requires simple digest comparison, thereby reducing real-time system complexity while maintaining security and integrity.
Solution Approach 2:
The system performs the complex hash chain construction and digest computation in advance before actual resource transfers. This preliminary action moves the computational burden away from the critical verification path, simplifying the real-time operation while maintaining the reliability and tamper-evidence properties of the hash chain structure.
3Reliability
If hash chains are extended with expansion nodes to record privilege transfers, then transparency and tamper-evidence are improved, but processing time and computational overhead increase
Solution Approach 1:
The system pre-computes and stores hash digests in the hash chain expansion nodes during the setup phase, so that during resource transfer verification, only simple digest comparison is needed. This preliminary computation eliminates the need for real-time hashing operations, significantly reducing verification processing time while maintaining full tamper-evidence capability.
Solution Approach 2:
The patent uses hash digests as simplified copies or representations of the original possession tokens. Instead of verifying the actual possession tokens during transfers, the system verifies the pre-computed hash digest copies, which are much faster to process while providing equivalent security and tamper-evidence properties.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments presented herein provide systems and methods for creating and modifying a hash chain. A hash chain is created to track resource-privilege transfers between entities. A root node of the hash chain identifies the resource and specifies a digest of a possession token held by a first entity that initially possesses the privilege. A transfer of the privilege to a second entity can be recorded by adding an expansion node to the hash chain. If the second entity successfully reveals a possession token that a hashing function associated with the hash chain maps to the digest, an expansion node is linked to the root node. The expansion node indicates the possession token and a successor digest that is based on a successor possession token.