Hierarchical Key Derivation Using Data Paths for Blockchain Interoperability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hierarchical key derivation protocols, such as BIP-32, primarily focus on monetary hierarchy and lack interoperability with data-oriented blockchain applications, necessitating improved methods for generating keys that are efficient and adaptable to diverse data structures.
Innovation Solution
A computer-implemented method for generating keys in a hierarchical key structure using a child key derivation path based on a data path, where each element in the path corresponds to a position in the key structure, allowing quick regeneration and obfuscation of keys for various applications, including blockchain transactions and encryption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If hierarchical deterministic wallets are used to generate multiple keys from a single seed, then key storage efficiency is improved, but interoperability with data-oriented blockchain applications deteriorates
Solution Approach 1:
The patent extends the traditional monetary-focused hierarchical key derivation protocol to support data-oriented blockchain applications by enabling the generation of keys based on arbitrary data paths. This multi-functional approach allows the same key derivation mechanism to serve both monetary transactions and data storage/verification purposes, resolving the interoperability issue while maintaining storage efficiency.
Solution Approach 2:
The patent introduces data paths as a new parameter dimension in key derivation, moving beyond the fixed monetary hierarchy. By allowing keys to be derived from arbitrary data paths rather than solely from monetary account structures, the system adapts to diverse data-oriented applications while preserving the hierarchical efficiency benefits.
2Device complexity
If traditional monetary hierarchy key derivation is used, then key structure simplicity is improved, but adaptability to diverse data structures deteriorates
Solution Approach 1:
The patent segments the key derivation process into two independent components: the hierarchical structure (which remains simple) and the data path layer (which provides adaptability). This segmentation allows the underlying key hierarchy to maintain its simplicity while the data path parameter enables adaptation to diverse data structures without increasing structural complexity.
Solution Approach 2:
The patent adds a data path dimension to the traditional hierarchical key structure. Rather than complicating the hierarchical structure itself, the invention introduces a new dimensional parameter (data path) that enables adaptability to diverse data structures while the original hierarchical simplicity is preserved in the vertical key generation dimension.
3Reliability
If keys are frequently regenerated for privacy, then privacy protection is improved, but key management time consumption increases
Solution Approach 1:
The patent enables preliminary generation of multiple keys along a data path hierarchy in advance. Instead of regenerating keys on-demand which consumes time, the system can pre-generate a sequence of keys along a data path, allowing for efficient privacy-preserving operations where pre-computed keys are used without requiring time-consuming regeneration during actual use.
Data Source
AI summary
A computer-implemented method of generating keys of a hierarchical key structure, wherein the method is performed by a key generator and comprises: obtaining a child key derivation path, wherein the child key derivation path comprises a sequence of elements, wherein the sequence of elements comprises one or more sets of one or more elements, each set of elements being generated based on a respective data item of a data path, and wherein each element in the sequence corresponds to a respective position of key in a respective level of the key structure; and generating one or more child keys based on the child key derivation path, wherein each respective child key is generated based on a respective element in the sequence at the respective position and of the respective level corresponding to that respective element.