CN112769566A - Block chain HD private key retrieving method - Google Patents
Block chain HD private key retrieving method Download PDFInfo
- Publication number
- CN112769566A CN112769566A CN202110068832.7A CN202110068832A CN112769566A CN 112769566 A CN112769566 A CN 112769566A CN 202110068832 A CN202110068832 A CN 202110068832A CN 112769566 A CN112769566 A CN 112769566A
- Authority
- CN
- China
- Prior art keywords
- key
- root
- private key
- algorithm
- path identifier
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000004422 calculation algorithm Methods 0.000 claims description 42
- 230000000007 visual effect Effects 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000011084 recovery Methods 0.000 claims description 2
- 230000002441 reversible effect Effects 0.000 abstract description 2
- 230000004075 alteration Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000009795 derivation Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- 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/0825—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) using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates
-
- 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
Abstract
The invention discloses a block chain HD private key retrieving method which comprises the steps of creating and storing a root key and a root chain code, generating a key tree according to the root key and the root chain code, obtaining a public key address of a key tree node, creating an address table based on the public key address and a path identifier, obtaining the path identifier of a lost service private key based on the reverse checking of the address table, and obtaining the lost service private key by utilizing the root private key, the root chain code and the path identifier. The service private key is used for daily electronic files, such as delivery, editing, approval, signature and the like of electronic judicial documents, or creation, accounting, transaction, circulation and the like of digital assets, and the root private key and the root chain code are properly stored in a safe place. Once the private service key is lost or destroyed, the private service key can be recalculated to restore or retrieve the private service key according to the method.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain HD private key retrieving method.
Background
Blockchains (Blockchain) are a term of art in information technology. In essence, it is a distributed database or distributed book, and the data or information stored therein has the characteristics of time sequence, non-tamper property, traceability, public transparency, collective maintainability, etc. Based on the characteristics, the block chain technology lays a solid trust foundation, creates a reliable cooperation mechanism and has wide application prospect.
The operation of the information or digital assets on the block chain cannot leave the private key, and the generation mode of the private key can be divided into two types: Non-Deterministic structures (Non-Deterministic) and Deterministic structures (Deterministic or Hierarchical Deterministic). The working principle of the HD architecture can be summarized as: a random number is used to create a root key pair (also called a master key pair or a first parent key pair) and a root chain code through a root seed, and then a determined and irreversible algorithm is used to generate any number of sub-keys and sub-chain codes based on the root key and the root chain code, i.e. the root seed of the HD structure can sequentially generate multiple pairs of keys and chain codes in a stacking manner, and finally a key tree with depth D is generated, each stage comprises multiple pairs of sub-keys and sub-chain codes, the tree root is the root key and the root chain code, the leaves (called "end points") of the key tree are leaf keys, end point keys or service keys, the branches (called "fulcrums" or "fork points") of the key tree are fork point keys, fulcrum keys or management keys (according to different application scenarios, also can be used as service keys), and the nodes are the collective names of root, fulcrum and end points, so the root keys, fulcrum keys and end point keys are collectively called node keys, the actual type of key is determined by the specific location of the node in the key tree.
The current blockchain system has functions and only has a service key, and a user operates information such as electronic files (including electronic judicial documents) or digital assets in the blockchain system through the service key. The service key pair comprises a service private key and a service public key, and once the service private key is lost or damaged, the service private key means that the information such as electronic files or digital assets in the block chain cannot be operated, and the loss of ownership and distribution rights of the information such as electronic files (including electronic judicial documents) or digital assets also means that irreparable loss is caused to users.
Disclosure of Invention
In order to solve the above problems, the present invention provides a block chain HD private key retrieving method to solve the problem that the block chain service private key cannot be retrieved when lost or damaged.
The invention provides a block chain HD private key retrieving method, which comprises the following steps:
creating a root key and a root chain code from the random number via the root seed;
generating a key tree according to the root key, the root chain code and the path identifier, wherein the key tree comprises a plurality of pairs of keys and chain codes;
acquiring a public key address of the secret key according to the path identifier;
creating an address table according to the address and the path identifier of the corresponding public key;
searching a path identifier of a public key address corresponding to the lost service private key based on the address table;
and calculating by using the root key, the root chain code and the path identifier to obtain the service private key.
According to a specific embodiment of the present invention, the root key includes a root private key and a root public key, and the creating the root key and the root chain code via the root seed according to the random number further includes:
calculating the root seed by adopting any one of HMAC-SHA512, HMAC-SHA256 and HMAC-SHA128 algorithms to obtain the root private key and the root chain code;
and calculating to obtain the root public key by adopting an asymmetric algorithm based on the root private key.
According to a specific embodiment of the present invention, the asymmetric algorithm includes any one of an RSA algorithm, an ECC algorithm, an ECDSA algorithm, an SM2 algorithm, and an SM9 algorithm.
According to an embodiment of the present invention, generating a key tree according to the root private key, the root chain code, and the path identifier includes:
calculating the root Key and the root chain code by using a CKD (Child Key Derivation function, or CKD function) algorithm to obtain a plurality of pairs of sub-chain codes and sub-keys;
repeating CKD calculation on the sub-secret keys and the sub-chain codes to obtain new multi-pair sub-secret keys and sub-chain codes;
and generating a key tree by using all the calculated key pairs, chain codes and path identifications.
According to a specific embodiment of the present invention, the obtaining the public key address of the secret key according to the path identifier includes:
carrying out Hash operation on the public key of the secret key to obtain a Hash value of the public key;
and visually encoding the hash value to obtain a visual ASCII code, namely the public key address of the secret key.
According to a specific embodiment of the present invention, the visually encoding the hash value includes:
and visually encoding the hash value by adopting a Base58 algorithm or a Base64 algorithm.
According to a specific embodiment of the present invention, the creating an address table according to the address and the path identifier of the corresponding public key includes:
acquiring the corresponding relation between each public key address and the path identifier;
and establishing the address table according to the corresponding relation.
According to a specific embodiment of the present invention, the calculating the service private key by using the root private key, the root chain code, and the path identifier includes:
and calculating the root private key, the root chain code and the path identifier by adopting a CKD algorithm to obtain a service private key.
The invention provides a block chain HD private key recovery method, which is characterized in that when a service private key is lost or damaged under the condition that a root private key is known, a path identifier corresponding to a public key address of the lost service private key is reversely inquired through a created address table, the service private key of any node can be calculated based on the root private key, a root chain code and the path identifier, and then the lost service private key is recovered, so that ownership and distribution rights and related operation functions of electronic files (including electronic judicial documents) and digital assets are ensured.
Drawings
Fig. 1 is a flowchart of a method for retrieving a private key according to an embodiment of the present invention.
Fig. 2 is a flowchart of a method for creating a root key and a root chain code according to an embodiment of the invention.
Fig. 3 is a flowchart of a method of generating a key tree according to an embodiment of the invention.
Fig. 4 is a flowchart of a method for obtaining a public key address according to an embodiment of the invention.
FIG. 5 is a flow diagram of a method of creating an address table according to an embodiment of the invention.
Detailed Description
The present invention is described in detail below with reference to specific embodiments in order to make the concept and idea of the present invention more clearly understood by those skilled in the art. It is to be understood that the embodiments presented herein are only a few of all embodiments that the present invention may have. Those skilled in the art who review this disclosure will readily appreciate that many modifications, variations, or alterations to the described embodiments, either in whole or in part, are possible and within the scope of the invention as claimed.
As used herein, the terms "first," "second," and the like are not intended to imply any order, quantity, or importance, but rather are used to distinguish one element from another. As used herein, the terms "a," "an," and the like are not intended to mean that there is only one of the described items, but rather that the description is directed to only one of the described items, which may have one or more. As used herein, the terms "comprises," "comprising," and other similar words are intended to refer to logical interrelationships, and are not to be construed as referring to spatial structural relationships. For example, "a includes B" is intended to mean that logically B belongs to a, and not that spatially B is located inside a. Furthermore, the terms "comprising," "including," and other similar words are to be construed as open-ended, rather than closed-ended. For example, "a includes B" is intended to mean that B belongs to a, but B does not necessarily constitute all of a, and a may also include C, D, E and other elements.
The terms "embodiment," "present embodiment," "an embodiment," "one embodiment," and "one embodiment" herein do not mean that the pertinent description applies to only one particular embodiment, but rather that the description may apply to yet another embodiment or embodiments. Those of skill in the art will understand that any of the descriptions given herein for one embodiment can be combined with, substituted for, or combined with the descriptions of one or more other embodiments to produce new embodiments, which are readily apparent to those of skill in the art and are intended to be within the scope of the present invention.
Example 1
Additional aspects and advantages of embodiments of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of embodiments of the invention.
Fig. 1 is a flowchart of a method for retrieving a private key according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
s1: creating a root key and a root chain code from the random number via the root seed;
s2: generating a key tree according to the root key, the root chain code and the path identifier, wherein the key tree comprises a plurality of pairs of keys and chain codes;
s3: acquiring a public key address of the secret key according to the path identifier;
s4: creating an address table according to the address and the path identifier of the corresponding public key;
s5: searching a path identifier of a public key address corresponding to the lost service private key based on the address table;
s6: and calculating by using the root private key, the root chain code and the path identifier to obtain the service private key.
Specifically, fig. 2 is a flowchart of a method for creating a root key and a root chain code according to an embodiment of the present invention, and as shown in fig. 2, the creating a root key and a root chain code from a random number via a root seed in step S1 further includes:
s11: calculating the root seed by adopting any one of HMAC-SHA512, HMAC-SHA256 and HMAC-SHA128 algorithms to obtain the root private key and the root chain code;
s12: and calculating to obtain the root public key by adopting an asymmetric algorithm based on the root private key.
In this embodiment, under the condition that the root seed is known, firstly, the HMAC-SHA512 algorithm is adopted to perform hash operation on the root seed to generate a hash value, the first half of the hash value is a root private key, the second half of the hash value is a root chain code, then, based on the root private key, the root private key is operated by adopting an asymmetric encryption algorithm to obtain a root public key, and the root private key and the root public key form a root key, so that the root key and the root chain code are obtained. Wherein the asymmetric algorithms include, but are not limited to, RSA algorithm, ECC algorithm, ECDSA algorithm, SM2 algorithm, and SM9 algorithm.
Specifically, fig. 3 is a flowchart of a method for generating a key tree according to an embodiment of the present invention, and as shown in fig. 3, the step S2 of generating a key tree according to the root key, the root chain code, and the path identifier further includes:
s21: and calculating the root key and the root chain code by adopting a CKD algorithm to obtain a plurality of pairs of sub-pair keys and sub-chain codes.
S22: and repeating CKD calculation on the pairs of sub-pair keys and the sub-chain codes to obtain new pairs of sub-pair keys and sub-chain codes.
S23: and generating a key tree by using all the calculated key pairs, chain codes and path identifications.
For example, N pairs of sub-keys and sub-chain codes are generated by expanding a root key and a root chain code through a CKD algorithm, where N =2^ N, N is generally 32, and the algorithm is repeated by the sub-keys and the sub-chain codes to expand the sub-keys and the sub-chain codes of the next stage, and the repeating is performed for D times, so as to finally generate a key tree with a depth of D, each stage includes N pairs of sub-keys, the root of the tree is the root key, each pair of keys corresponds to a path identifier, in other words, a unique sub-key pair and a corresponding sub-chain code can be defined and calculated through the root key pair, the root chain code and the path identifier. In practice, the leaves of the key tree are leaf keys, end point keys or service keys, the branch points (including the tree root) of the key tree are branch point keys, fulcrum keys or management keys (which can also be used as service keys according to different application scenarios), the management private keys, the management chain codes and the path identifiers can calculate the service keys under the management nodes, and the root private keys, the root chain codes and the path identifiers can calculate any service keys and management keys in the whole tree (HD structure).
Specifically, fig. 4 is a flowchart of a method for obtaining a public key address according to an embodiment of the present invention, and as shown in fig. 4, the step S3 obtaining the public key address of the key according to the path identifier includes:
s31: carrying out Hash operation on the public key of the secret key to obtain a Hash value of the public key;
s32: and visually encoding the hash value to obtain a visual ASCII code, namely the public key address of the secret key. The hash value is visually encoded, for example, using the Base58 algorithm or the Base64 algorithm.
The public key address (also called node address, also called address or account number for short) is a visual ASCII code generated by hash operation of the public key to generate a hash value, which is used as an external representation form of the service public key to protect the privacy of the service public key. Although the service public key is disclosed to some extent, but is only disclosed to interested persons, but not to irrelevant persons, since the hash value is invisible binary, the hash value is generally subjected to visual coding operation, the embodiment of the invention adopts the Base58 or Base64 algorithm to perform visual coding, the visual coding operation is one-to-one reversible, that is, the binary input value can be converted into a visible and unique visual ASCII output value, and the input value can be restored by the output value.
Specifically, fig. 5 is a flowchart of a method for creating an address table according to an embodiment of the present invention, and as shown in fig. 5, the creating an address table according to the address and the path identifier of the corresponding public key in step S4 includes:
s41: acquiring the corresponding relation between each public key address and the path identifier;
s42: and establishing the address table according to the corresponding relation.
Specifically, step S5 finds the path id of the public key address corresponding to the lost service private key based on the address table,
since the path identifier is implicit to the user and the user sees the address, the user needs to look up the address table and reversely look up the corresponding path identifier from the corresponding relationship between the address recorded in the address table and the path identifier.
Specifically, in step S6, the service private key is obtained by calculation using the root private key, the root chain code, and the path identifier. The embodiment of the invention adopts HD algorithm to calculate the root private key, the root chain code and the path identifier to obtain the service private key.
In summary, the invention creates the address table to query the path identifier reversely, and then calculates the service private key from the root private key, the root chain code and the path identifier, thereby retrieving the lost or damaged service private key, and thus ensuring the security of the digital assets.
The concepts, principles and concepts of the invention have been described above in detail in connection with specific embodiments (including examples and illustrations). It will be appreciated by persons skilled in the art that embodiments of the invention are not limited to the specific forms disclosed above, and that many modifications, alterations and equivalents of the steps, methods, apparatus and components described in the above embodiments may be made by those skilled in the art after reading this specification, and that such modifications, alterations and equivalents are to be considered as falling within the scope of the invention. The scope of the invention is only limited by the claims.
Claims (8)
1. A block chain HD private key recovery method is characterized by comprising the following steps:
creating a root key and a root chain code from the random number via the root seed;
generating a key tree according to the root key, the root chain code and the path identifier, wherein the key tree comprises a plurality of pairs of keys and chain codes;
acquiring a public key address of the secret key according to the path identifier;
creating an address table according to the public key address and the corresponding path identifier;
searching a path identifier of a public key address corresponding to the lost service private key based on the address table;
and calculating by using the root private key, the root chain code and the path identifier to obtain the service private key.
2. The method of claim 1, wherein the root key comprises a root private key and a root public key, and wherein creating the root key and a root chain code from the random number via a root seed further comprises:
calculating the root seed by adopting any one of HMAC-SHA512, HMAC-SHA256 and HMAC-SHA128 algorithms to obtain the root private key and the root chain code;
and calculating to obtain the root public key by adopting an asymmetric algorithm based on the root private key.
3. The method of claim 2, wherein the asymmetric algorithm comprises any one of an RSA algorithm, an ECC algorithm, an ECDSA algorithm, an SM2 algorithm, and an SM9 algorithm.
4. The method of claim 1, wherein generating a key tree from the root key, root chain code, and path identification comprises:
calculating the root key and the root chain code by adopting a CKD algorithm to obtain a plurality of pairs of sub-pair keys and sub-chain codes;
repeating CKD calculation on the sub-secret keys and the sub-chain codes to obtain new multi-pair sub-secret keys and sub-chain codes;
and generating a key tree by using all the calculated key pairs, chain codes and path identifications.
5. The method of claim 1, wherein obtaining the public key address of the key according to the path identifier comprises:
carrying out Hash operation on the public key of the secret key to obtain a Hash value of the public key;
and visually encoding the hash value to obtain a visual ASCII code, namely the public key address of the secret key.
6. The method of claim 5, wherein visually encoding the hash value comprises:
and visually encoding the hash value by using the ASCII (American standard code for information interchange) algorithm of Base58 or the algorithm of Base 64.
7. The method of claim 1, wherein creating an address table based on the addresses and path identifications of corresponding public keys comprises:
acquiring the corresponding relation between each public key address and the path identifier;
and establishing the address table according to the corresponding relation.
8. The method of claim 1, wherein computing the service private key using the root private key, a root chain code, and the path identifier comprises:
and calculating the root private key, the root chain code and the path identifier by adopting a CKD algorithm to obtain a service private key.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068832.7A CN112769566B (en) | 2021-01-19 | 2021-01-19 | Block chain HD private key recovery method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110068832.7A CN112769566B (en) | 2021-01-19 | 2021-01-19 | Block chain HD private key recovery method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112769566A true CN112769566A (en) | 2021-05-07 |
| CN112769566B CN112769566B (en) | 2023-06-02 |
Family
ID=75703149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110068832.7A Active CN112769566B (en) | 2021-01-19 | 2021-01-19 | Block chain HD private key recovery method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112769566B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107566117A (en) * | 2017-07-14 | 2018-01-09 | 浙商银行股份有限公司 | A kind of block chain key management system and method |
| CN108764907A (en) * | 2018-05-30 | 2018-11-06 | 招商银行股份有限公司 | Assets method for retrieving, system and computer readable storage medium |
| CN109067801A (en) * | 2018-09-29 | 2018-12-21 | 平安科技（深圳）有限公司 | A kind of identity identifying method, identification authentication system and computer-readable medium |
| CN109412798A (en) * | 2018-12-06 | 2019-03-01 | 中链科技有限公司 | Private key generation, data interactive method and its system of block chain |
| CN109716375A (en) * | 2018-07-27 | 2019-05-03 | 区链通网络有限公司 | Processing method, device and the storage medium of block chain account |
| CN110086612A (en) * | 2019-04-26 | 2019-08-02 | 山大地纬软件股份有限公司 | A kind of public and private key backup of block chain and lose method for retrieving and system |
| US20190305943A1 (en) * | 2018-03-30 | 2019-10-03 | Bitnomial, Inc. | Digital asset transfer system for secure digital asset transactions |
| CN111325535A (en) * | 2020-02-19 | 2020-06-23 | 福州博泉网络科技有限公司 | Block chain private key management method, system and storage medium based on elliptic curve migration |
| CN111342967A (en) * | 2020-03-06 | 2020-06-26 | 北京中宇万通科技股份有限公司 | Method and device for solving block chain user certificate loss or damage |
| CN111339199A (en) * | 2020-02-28 | 2020-06-26 | 中国工商银行股份有限公司 | Block chain key recovery method and device |
| CN111385084A (en) * | 2018-12-27 | 2020-07-07 | 中国电信股份有限公司 | Key management method and device for digital assets and computer readable storage medium |
| US10790976B1 (en) * | 2018-08-01 | 2020-09-29 | Bloomio Ag | System and method of blockchain wallet recovery |
-
2021
- 2021-01-19 CN CN202110068832.7A patent/CN112769566B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107566117A (en) * | 2017-07-14 | 2018-01-09 | 浙商银行股份有限公司 | A kind of block chain key management system and method |
| US20190305943A1 (en) * | 2018-03-30 | 2019-10-03 | Bitnomial, Inc. | Digital asset transfer system for secure digital asset transactions |
| CN108764907A (en) * | 2018-05-30 | 2018-11-06 | 招商银行股份有限公司 | Assets method for retrieving, system and computer readable storage medium |
| CN109716375A (en) * | 2018-07-27 | 2019-05-03 | 区链通网络有限公司 | Processing method, device and the storage medium of block chain account |
| US10790976B1 (en) * | 2018-08-01 | 2020-09-29 | Bloomio Ag | System and method of blockchain wallet recovery |
| CN109067801A (en) * | 2018-09-29 | 2018-12-21 | 平安科技（深圳）有限公司 | A kind of identity identifying method, identification authentication system and computer-readable medium |
| CN109412798A (en) * | 2018-12-06 | 2019-03-01 | 中链科技有限公司 | Private key generation, data interactive method and its system of block chain |
| CN111385084A (en) * | 2018-12-27 | 2020-07-07 | 中国电信股份有限公司 | Key management method and device for digital assets and computer readable storage medium |
| CN110086612A (en) * | 2019-04-26 | 2019-08-02 | 山大地纬软件股份有限公司 | A kind of public and private key backup of block chain and lose method for retrieving and system |
| CN111325535A (en) * | 2020-02-19 | 2020-06-23 | 福州博泉网络科技有限公司 | Block chain private key management method, system and storage medium based on elliptic curve migration |
| CN111339199A (en) * | 2020-02-28 | 2020-06-26 | 中国工商银行股份有限公司 | Block chain key recovery method and device |
| CN111342967A (en) * | 2020-03-06 | 2020-06-26 | 北京中宇万通科技股份有限公司 | Method and device for solving block chain user certificate loss or damage |
Non-Patent Citations (3)
| Title |
|---|
| ANDREAS M. ANTONOPOULOS等: "《Mastering Ethereum》", 31 December 2018 * |
| 张中霞，王明文: "区块链钱包方案研究综述", 《计算机工程与应用》 * |
| 王伟康: "区块链技术在文档管理中的应用与研究", 《中国优秀硕士学位论文全文数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112769566B (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112769567B (en) | Block chain HD private key retrieving method | |
| CN109074562B (en) | Combined data transmission control method and system based on block chain | |
| CN106612172B (en) | A kind of data tampering recovery algorithms can verify that restoring data authenticity in cloud storage | |
| JP2022037089A (en) | Cryptographic method and system for secure extraction of data from blockchain | |
| KR101873946B1 (en) | Generating obfuscated data | |
| CN107276754B (en) | Method and device for generating a large number of private keys based on block chain | |
| CN102195781B (en) | Electronic evidence obtaining system based on electronic record correlated signature | |
| CN110096903B (en) | Asset verification method based on block chain and block chain network system | |
| CN106776904A (en) | The fuzzy query encryption method of dynamic authentication is supported in a kind of insincere cloud computing environment | |
| CN107181797A (en) | The block compression method and system of a kind of block chain | |
| CN108833117B (en) | Private key storage and reading method and device and hardware equipment | |
| CN111444257A (en) | Block chain-based electronic evidence storage method and system | |
| CN111461751A (en) | Block chain-based house property information chain organization method, historical state tracing method and device | |
| Iftikhar et al. | A reversible watermarking technique for social network data sets for enabling data trust in cyber, physical, and social computing | |
| CN110225012A (en) | The ownership inspection and update method of one outer bag data based on alliance's chain | |
| He et al. | Public integrity auditing for dynamic regenerating code based cloud storage | |
| CN103718502B (en) | Information processing device and information processing method | |
| CN108733783A (en) | A kind of student status information management system based on privately owned block chain | |
| CN110555783B (en) | Block chain-based electric power marketing data protection method and system | |
| CN111866134B (en) | Method and system for generating hash value and address of block chain transaction and storage medium | |
| CN109063513B (en) | Dynamic data integrity verification method based on Hadoop platform | |
| CN112699123A (en) | Method and system for verifying existence and integrity of data in data storage system | |
| CN112528323A (en) | Data processing method and device | |
| CN116760528A (en) | Multiparty asset delivery method and device based on multi-key homomorphic sharing | |
| CN109088850B (en) | Lot cloud auditing method for positioning error files based on Lucas sequence |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240119 Address after: No. 1260, Room 101, 9th Floor, Building 9, Zone 16, No. 188 South Fourth Ring West Road, Fengtai District, Beijing, 100071 Patentee after: Beijing Maple Jade Technology Co.,Ltd. Patentee after: Guangzhou Buluo Technology Co.,Ltd. Address before: Room q427, 107 Lane 421, Siping Road, Hongkou District, Shanghai Patentee before: Shanghai Buqin Network Technology Co.,Ltd. Patentee before: Beijing Maple Jade Technology Co.,Ltd. Patentee before: Guangzhou Buluo Technology Co.,Ltd. |