CN110569291B - Key data query and acquisition method and device for digital currency wallet - Google Patents
Key data query and acquisition method and device for digital currency wallet Download PDFInfo
- Publication number
- CN110569291B CN110569291B CN201910872200.9A CN201910872200A CN110569291B CN 110569291 B CN110569291 B CN 110569291B CN 201910872200 A CN201910872200 A CN 201910872200A CN 110569291 B CN110569291 B CN 110569291B
- Authority
- CN
- China
- Prior art keywords
- key
- node
- target
- key node
- path information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/083—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) involving central third party, e.g. key distribution center [KDC] or trusted third party [TTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
- H04L9/0897—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage involving additional devices, e.g. trusted platform module [TPM], smartcard or USB
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Fuzzy Systems (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The application provides a method and a device for inquiring and acquiring key data of a digital currency wallet, wherein the method comprises the following steps: in response to the received key acquisition instruction, extracting target key path information in the key acquisition instruction; traversing the stored key node set according to the target key path information, determining a target key node corresponding to the target key path information and returning to the target key node, wherein the key node set is obtained by performing derivation operation by using a key seed to obtain a key node and storing the key node through a hash table. The method and the device for acquiring the key node of the digital currency wallet solve the technical problem that the key acquiring efficiency of the existing digital currency wallet is low.
Description
Technical Field
The application relates to the technical field of digital money purses, in particular to a method and a device for inquiring and acquiring key data of a digital money purse.
Background
The digital money wallet is also called a hierarchical deterministic wallet, and is equivalent to a 'container' of a private key, and the existing key derivation of the digital money wallet is based on the protocols of BIP32 and BIP39, that is, a master private key is derived from a 'seed', and a large number of sub private keys are derived from the master private key. By "deterministic" is meant that the same "seed" can derive the same set of child private keys.
However, in practical applications, the digital money wallet generally only retains the main private key, and each actually used sub-private key is derived from the main private key through an elliptic curve cryptography operation performed in real time, and the derivation process of the sub-private key requires a considerable amount of computation, which inevitably affects the key obtaining efficiency of the digital money wallet.
Disclosure of Invention
The application provides a method and a device for inquiring and acquiring key data of a digital money wallet, which are used for solving the technical problem of low key acquisition efficiency of the existing digital money wallet.
In view of the above, a first aspect of the present application provides a key data query obtaining method for a digital money wallet, including:
in response to a received key acquisition instruction, extracting target key path information in the key acquisition instruction;
traversing a stored key node set according to the target key path information, and determining a target key node corresponding to the target key path information, wherein the key node set is obtained by performing derivation operation by using a key seed and is stored in a hash table, and the key node set includes: a master key and a plurality of subkeys;
and outputting the target key node.
Optionally, after traversing the stored key node set according to the target key path information, the method further includes:
and if the target key node is not traversed according to the target key path information, creating and storing the target key node according to the target key path information.
Optionally, the creating and storing the target key node according to the target key path information specifically includes:
based on the target key path information, inquiring a parent key node with the highest similarity value between the key path information and the target key path from the key nodes stored in the key node set;
and creating and storing the target key node by using the parent key node according to the target key path information.
Optionally, the method further comprises:
according to a preset key node storage amount threshold value and a historical use record of key nodes, reserving a plurality of historical key nodes according to the use time sequence of keys, wherein the number of the historical key nodes is equal to the key node storage amount threshold value;
and deleting the key nodes except the historical key node.
Optionally, the key node specifically includes: the system comprises key path information, private key data, chain code data and a key association identifier, wherein the key association identifier is used for storing the storage address of the next key node.
A second aspect of the present application provides a key data inquiry and acquisition apparatus for a digital money wallet, comprising:
the key path extraction unit is used for responding to the received key acquisition instruction and extracting target key path information in the key acquisition instruction;
a target key obtaining unit, configured to traverse a stored key node set according to the target key path information, and determine a target key node corresponding to the target key path information, where the key node set is obtained by performing derivation operation using a key seed and is stored in a hash table, and the key node set includes: a master key and a plurality of subkeys;
and the target key output unit is used for outputting the target key node.
Optionally, the method further comprises:
and the target key creating unit is used for creating and storing the target key node according to the target key path information if the target key node is not traversed according to the target key path information.
Optionally, the target key creating unit is specifically configured to:
and inquiring a parent key node with the key path information and the target key path with the highest similarity value from the key nodes stored in the key node set based on the target key path information, and creating and storing the target key node by using the parent key node according to the target key path information.
Optionally, the apparatus further comprises:
and the key node updating unit is used for reserving a plurality of historical key nodes according to preset key node storage volume threshold values and historical use records of the key nodes and the use time sequence of the keys, and the number of the historical key nodes is equal to the key node storage volume threshold value.
Optionally, the key node specifically includes: the system comprises key path information, private key data, chain code data and a key association identifier, wherein the key association identifier is used for storing the storage address of the next key node.
According to the technical scheme, the method has the following advantages:
the application provides a method and a device for inquiring and acquiring key data of a digital currency wallet, wherein the method comprises the following steps: in response to the received key acquisition instruction, extracting target key path information in the key acquisition instruction; traversing the stored key node set according to the target key path information, determining a target key node corresponding to the target key path information and returning to the target key node, wherein the key node set is obtained by performing derivation operation by using a key seed to obtain a key node and storing the key node through a hash table.
The method and the device for acquiring the key node of the digital currency wallet solve the technical problem that the key acquiring efficiency of the existing digital currency wallet is low.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic flowchart of a key data query obtaining method for a digital money wallet according to a first embodiment of the present application;
fig. 2 is a schematic flowchart of a key data query obtaining method for a digital money wallet according to a second embodiment of the present application;
fig. 3 is an exemplary diagram of a key node topology structure in a key data query obtaining method for a digital money wallet provided in the present application;
fig. 4 is a schematic structural diagram of a first embodiment of a key data query acquisition device of a digital money wallet provided by the present application.
Detailed Description
The embodiment of the application provides a method and a device for inquiring and acquiring key data of a digital money wallet, which are used for solving the technical problem of low key acquisition efficiency of the existing digital money wallet.
In order to make the objects, features and advantages of the present invention more apparent and understandable, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the embodiments described below are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, an embodiment of the present application provides a method for acquiring key data of a digital money wallet, including:
It should be noted that, when performing the blockchain digital wallet service, the key required by the service must be acquired first, and for this reason, after receiving the key acquisition instruction, the present embodiment extracts the target key path information to be acquired from the received key acquisition instruction.
And step 102, traversing the stored key node set according to the target key path information, and determining a target key node corresponding to the target key path information.
The key node set is obtained by performing derivation operation by using key seeds based on the BIP32 and BIP39 protocols to obtain key nodes and storing the key nodes in a hash table, and comprises: a master key and a plurality of subkeys.
It should be noted that, according to the target key path information acquired in step 101, key node data in the stored key node set is traversed, a target key node corresponding to the target key path information is found, and data of the target key node is returned to the sender of the key acquisition instruction in a manner of responding to the instruction.
And step 103, outputting the target key node.
The method and the device for acquiring the key node of the digital currency wallet solve the technical problem that the key node set established by the hash table acquires the required target key node from the key node set in a traversal query mode, do not need to utilize a master key to perform instant operation to acquire a sub-key, and although data query can also generate a certain operation amount, the operation amount generated by data query is far smaller than that generated by elliptic curve cryptography operation, so that the purpose of improving the key acquisition speed of the digital currency wallet is still achieved overall, and the technical problem that the key acquisition efficiency of the existing digital currency wallet is low is solved.
The above is a detailed description of a first embodiment of a key data query acquisition method for a digital money wallet provided by the present application, and the following is a detailed description of a second embodiment of a key data query acquisition method for a digital money wallet provided by the present application.
Referring to fig. 2, an embodiment of the present application provides a method for acquiring key data of a digital money wallet, including:
The key node set is obtained by performing derivation operation by using key seeds based on the BIP32 and BIP39 protocols to obtain key nodes and storing the key nodes in a hash table, and comprises: a master key and a plurality of subkeys.
It should be noted that, according to the target key path information acquired in step 201, key node data in the stored key node set is traversed, a target key node corresponding to the target key path information is found, and data of the target key node is returned to the sender of the key acquisition instruction in a manner of responding to the instruction.
In addition, in this embodiment, the key node data is stored by using a hash table structure, and the key node can be quickly queried by using the structural characteristics of the hash table.
And step 203, outputting the target key node.
It should be noted that, when a corresponding target key node is not found in the key node set, a target key node needs to be created in a key derivation manner according to the target key path information.
The specific step of creating the target key comprises:
traversing key nodes with the same depth as the key path according to the key path depth of the target key path information, if the target key nodes are not traversed, reducing the key path depth of the target key path information, traversing the key nodes with the same depth as the adjusted key path until the traversal is successful, and setting the matched key nodes as parent key nodes;
it should be noted that, the structures between keys are generally distributed in a tree structure, and first, the key path depth N is determined according to the target key path information. And a depth N of the key node currently traversed, wherein N is N for the first round of traversal.
And traversing the key nodes of the n-th layer of the key node set, and searching whether the key path data in each node is completely consistent with the first 4 x n bytes of the current key path data. And if no node with the same path exists, the node is used as a target key node, and if the node with the same path exists, the current n value and the data of the key node are recorded, and the node is used as a parent key node.
And then, according to the target key path information, creating a target key node by using the parent key node and storing the created target key node into the key node set.
In order to more clearly explain the complete key inquiry acquisition process of the present embodiment, the present embodiment will be explained below with reference to an example.
Referring to fig. 3, fig. 3 provides a tree structure of key node data in a key node set, where M is a master key, and A, B are all subkeys derived from the master key M.
If the target key path extracted from the key acquisition instruction is MADF, the depth N of the key path is 3, and the traversal depth N of the first round is 3, and based on the illustrated node topology, the target key node F can be found by traversal.
If the target key path extracted from the key acquisition command is MA, the depth N of the key path is 1, and the traversal depth N of the first round is 1, and based on the illustrated node topology, the target key node a can be found by traversal.
If the target key path extracted from the key acquisition instruction is MBGH, the depth N of the key path is 3, the traversal depth N of the first round of traversal is 3, based on the node topology shown in the figure, the target key node H cannot be obtained in the first round of traversal, at this time, the traversal depth parameter N needs to be adjusted to be 3-1-2, that is, the adjusted path information becomes MBG, if the traversal is still unsuccessful, the traversal depth parameter N needs to be adjusted to be 2-1, at this time, the adjusted path information becomes MB, based on the node topology shown in the figure, the key node B can be traversed according to the path information MB, and the traversed key node B is set as a parent key node;
and then, circularly and iteratively deriving child key nodes (G and H) of each level by using a parent key node B according to the parent key node to finally obtain a target key node H, and then adding newly derived node data of each level into a hash table cache.
It should be noted that the above query process based on fig. 3 only serves as an example, and the key path information therein is also only an example and does not represent the real key node topology and the key path information.
Further, on the basis of the above embodiments, the embodiments of the present application further include:
step 205: and reserving a plurality of historical key nodes according to a preset key node storage capacity threshold value and the historical use record of the key nodes and the use time sequence of the keys.
The number of the historical key nodes is equal to the threshold value of the storage amount of the key nodes;
and step 206, deleting the key nodes except the historical key node.
It should be noted that, in view of the limited storage space of the terminal device and the near-infinite number of derived keys, in order to control the problem of storage space occupation caused by the key storage mechanism of this embodiment for the terminal device, this embodiment further adds a key storage control mechanism on the basis of the above steps, according to the usage time record of the key, keeps the history key node that has been used recently, and deletes the key node data except for the selected history key node, thereby controlling the capacity of the key node set.
Further, the information contained in the key node specifically includes: the key path information (which may be a key value of 4 × n bytes in a hash table, where n is a derivative level of a key), private key data (32 bytes), chain code data (32 bytes), and a key association identifier, where the key association identifier is used to store a storage address of a next key node, and may further include public key data (64 bytes, optionally stored, and may be derived unidirectionally from the private key) and a digital currency address (optionally stored, and may be derived unidirectionally from the public key).
The above is a detailed description of the second embodiment of the key data inquiry and acquisition method for the digital money wallet provided by the present application, and the following is a detailed description of the first embodiment of the key data inquiry and acquisition device for the digital money wallet provided by the present application.
Referring to fig. 4, the present embodiment provides a key data query and acquisition apparatus for a digital money wallet, including:
a key path extracting unit 401, configured to extract, in response to the received key obtaining instruction, target key path information in the key obtaining instruction;
a target key obtaining unit 402, configured to traverse a stored key node set according to target key path information, and determine a target key node corresponding to the target key path information, where the key node set is obtained by performing derivation operation using a key seed based on BIP32 and BIP39 protocols, and is stored in a hash table, and the key node set includes: a master key and a plurality of subkeys;
and a target key output unit 403, configured to output the target key node.
Further, still include:
and a target key creating unit 404, configured to create and store a target key node according to the target key path information if the target key node is not traversed according to the target key path information.
Further, the target key creating unit 404 is specifically configured to:
traversing the key nodes with the same depth as the key path according to the key path depth of the target key path information, if the target key nodes are not traversed, reducing the key path depth of the target key path information, traversing the key nodes with the same depth as the adjusted key path until the traversal is successful, setting the matched key nodes as father key nodes, and creating and storing the target key nodes by using the father key nodes according to the target key path information.
Further, still include:
and a key node updating unit 405, configured to keep a plurality of historical key nodes according to a preset key node storage amount threshold and a historical usage record of the key node, and according to a usage time sequence of the key, where the number of the historical key nodes is equal to the key node storage amount threshold, and delete key nodes other than the historical key nodes.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The terms "first," "second," "third," "fourth," and the like in the description of the application and the above-described figures, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.
Claims (8)
1. A key data query acquisition method for a digital currency wallet is characterized by comprising the following steps:
in response to a received key acquisition instruction, extracting target key path information in the key acquisition instruction; determining a target key node according to the target key path information;
traversing the stored key node set according to the target key path information, if the target key node is traversed according to the target key path information, determining the target key node corresponding to the target key path information, and if the target key node is not traversed according to the target key path information, creating and storing the target key node according to the target key path information; specifically, the method comprises the following steps:
s1, determining the depth N of a target key path and the depth N of a currently traversed key node according to the target key path information, wherein N is equal to N initially;
s2, starting traversal, if a key node of the same path is traversed in the traversal, taking the key node of the same path as the target key node, if no key node of the same path is traversed, making n equal to n-1, traversing the key node of the nth layer of the key node set again, if a key node of the same path is traversed, recording a current n value and a current key node of the same path, setting the current key node of the same path as a parent key node, then creating a target key node by using the parent key node according to the target key path information, and storing the created target key node in the key node set;
the key node set is obtained by performing derivation operation by using a key seed to obtain a key node and storing the key node in a hash table, and the key node set includes: a master key and a plurality of subkeys;
and outputting the target key node.
2. The method of claim 1, wherein the creating and storing the target key node according to the target key path information specifically comprises:
based on the target key path information, inquiring a parent key node with the highest similarity value between the key path information and the target key path from the key nodes stored in the key node set;
and creating and storing the target key node by using the parent key node according to the target key path information.
3. The method of claim 1, further comprising:
according to a preset key node storage volume threshold value and a historical use record of the key nodes, a plurality of historical key nodes are reserved according to the use time sequence of the keys, and the number of the historical key nodes is equal to the key node storage volume threshold value.
4. The method according to claim 1, wherein the key node specifically comprises: the system comprises key path information, private key data, chain code data and a key association identifier, wherein the key association identifier is used for storing the storage address of the next key node.
5. A key data inquiry acquisition apparatus for a digital money wallet, comprising:
the key path extraction unit is used for responding to the received key acquisition instruction and extracting target key path information in the key acquisition instruction; determining a target key node according to the target key path information;
a target key obtaining unit, configured to traverse a stored key node set according to the target key path information, determine, using the target key obtaining unit, the target key node corresponding to the target key path information if the target key node is traversed according to the target key path information, and create and store, using the target key creating unit, the target key node according to the target key path information if the target key node is not traversed according to the target key path information, specifically:
s1, determining the depth N of a target key path and the depth N of a currently traversed key node according to the target key path information, wherein N is equal to N initially;
s2, starting traversal, if a key node of the same path is traversed in the traversal, taking the key node of the same path as the target key node, if no key node of the same path is traversed, making n equal to n-1, traversing the key node of the nth layer of the key node set again, if a key node of the same path is traversed, recording a current n value and a current key node of the same path, setting the current key node of the same path as a parent key node, then creating a target key node by using the parent key node according to the target key path information, and storing the created target key node in the key node set;
the key node set is obtained by performing derivation operation by using a key seed to obtain a key node and storing the key node in a hash table, and the key node set includes: a master key and a plurality of subkeys;
and the target key output unit is used for outputting the target key node.
6. The apparatus according to claim 5, wherein the target key creation unit is specifically configured to:
based on the target key path information, inquiring a parent key node with the highest similarity value between the key path information and the target key path from the key nodes stored in the key node set;
and creating and storing the target key node by using the parent key node according to the target key path information.
7. The apparatus of claim 5, further comprising:
and the key node updating unit is used for reserving a plurality of historical key nodes according to preset key node storage volume threshold values and historical use records of the key nodes and the use time sequence of the keys, and the number of the historical key nodes is equal to the key node storage volume threshold value.
8. The apparatus according to claim 5, wherein the key node specifically comprises: the system comprises key path information, private key data, chain code data and a key association identifier, wherein the key association identifier is used for storing the storage address of the next key node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910872200.9A CN110569291B (en) | 2019-09-16 | 2019-09-16 | Key data query and acquisition method and device for digital currency wallet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910872200.9A CN110569291B (en) | 2019-09-16 | 2019-09-16 | Key data query and acquisition method and device for digital currency wallet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110569291A CN110569291A (en) | 2019-12-13 |
| CN110569291B true CN110569291B (en) | 2022-04-15 |
Family
ID=68780099
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910872200.9A Active CN110569291B (en) | 2019-09-16 | 2019-09-16 | Key data query and acquisition method and device for digital currency wallet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110569291B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114465726B (en) * | 2022-04-13 | 2022-06-28 | 北京银联金卡科技有限公司 | Digital wallet security framework system based on security unit and trusted execution environment |
| CN114760054A (en) * | 2022-06-14 | 2022-07-15 | 浙江毫微米科技有限公司 | Key management method and device based on digital wallet and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110670A (en) * | 2006-07-17 | 2008-01-23 | 西安电子科技大学 | Key management method based on wireless Mesh netword |
| EP2953312A1 (en) * | 2014-06-02 | 2015-12-09 | Alcatel Lucent | System to handle passwords for service authentication |
| CN108229962A (en) * | 2018-01-04 | 2018-06-29 | 众安信息技术服务有限公司 | Right management method and system based on block chain |
| CN109831405A (en) * | 2017-11-23 | 2019-05-31 | 航天信息股份有限公司 | Document protection method and device in a kind of cloud platform |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103763096B (en) * | 2014-01-17 | 2018-02-09 | 北京邮电大学 | Random key distribution method and apparatus |
| CN104852849B (en) * | 2015-05-04 | 2018-10-19 | 华为技术有限公司 | A kind of OSPF configuration methods and relevant apparatus |
| WO2018046085A1 (en) * | 2016-09-08 | 2018-03-15 | Huawei Technologies Co., Ltd. | Systems and methods for performing a range query on a skiplist data structure |
| US10719495B2 (en) * | 2017-02-09 | 2020-07-21 | Micron Technology, Inc. | Stream selection for multi-stream storage devices |
-
2019
- 2019-09-16 CN CN201910872200.9A patent/CN110569291B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101110670A (en) * | 2006-07-17 | 2008-01-23 | 西安电子科技大学 | Key management method based on wireless Mesh netword |
| EP2953312A1 (en) * | 2014-06-02 | 2015-12-09 | Alcatel Lucent | System to handle passwords for service authentication |
| CN109831405A (en) * | 2017-11-23 | 2019-05-31 | 航天信息股份有限公司 | Document protection method and device in a kind of cloud platform |
| CN108229962A (en) * | 2018-01-04 | 2018-06-29 | 众安信息技术服务有限公司 | Right management method and system based on block chain |
Non-Patent Citations (1)
| Title |
|---|
| 区块链技术在文档管理中的应用与研究;王伟康;《中国优秀博硕士学位论文全文数据库 信息科技辑》;20190515;第I138-1057页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110569291A (en) | 2019-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110275884B (en) | Data storage method and node | |
| CN105100146A (en) | Data storage method, device and system | |
| CN102110171B (en) | Method for inquiring and updating Bloom filter based on tree structure | |
| CN110147204B (en) | Metadata disk-dropping method, device and system and computer-readable storage medium | |
| CN110569291B (en) | Key data query and acquisition method and device for digital currency wallet | |
| CA2984833A1 (en) | Device, method and program for securely reducing an amount of records in a database | |
| CN112988912B (en) | Block chain data storage method and device and electronic equipment | |
| CN112988761B (en) | Block chain data storage method and device and electronic equipment | |
| CN104217011A (en) | Method and device for inquiring HBase secondary index table | |
| US8121974B2 (en) | Method of generating node indentifier in tree structure | |
| CN108399175B (en) | Data storage and query method and device | |
| CN112988908B (en) | Block chain data storage method and device and electronic equipment | |
| CN112988909B (en) | Block chain data storage method and device and electronic equipment | |
| CN101635001B (en) | Method and apparatus for extracting information from a database | |
| CN102685222B (en) | A kind of cloud SRM device for electric power system | |
| CN107547378B (en) | VPN route learning method and device | |
| WO2014069034A1 (en) | Communication control device, communication device, and computer program product | |
| CN103942213A (en) | Data paging method and device | |
| CN115292737B (en) | Multi-keyword fuzzy search encryption method and system and electronic equipment | |
| CN112988911B (en) | Block chain data storage method and device and electronic equipment | |
| CN112835896B (en) | Real-time database data hotspot balancing method, device, equipment and medium | |
| CN107515867B (en) | Data storage and query method and device of NoSQL database and generation method and device of rowKey full combination | |
| CN112035413B (en) | Metadata information query method, device and storage medium | |
| CN111190545B (en) | Method for carrying out LPM rule compression storage on trie structure based on software implementation | |
| CN106600250B (en) | User identification method and device from block chain decentralized to centralized |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |