CN112769566B - Block chain HD private key recovery method - Google Patents
Block chain HD private key recovery method Download PDFInfo
- Publication number
- CN112769566B CN112769566B CN202110068832.7A CN202110068832A CN112769566B CN 112769566 B CN112769566 B CN 112769566B CN 202110068832 A CN202110068832 A CN 202110068832A CN 112769566 B CN112769566 B CN 112769566B
- Authority
- CN
- China
- Prior art keywords
- key
- root
- private key
- chain code
- algorithm
- 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
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000011084 recovery Methods 0.000 title description 4
- 238000004422 calculation algorithm Methods 0.000 claims description 42
- 230000000007 visual effect Effects 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000006467 substitution reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000002441 reversible effect 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a method for retrieving a blockchain HD private key, 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, acquiring a public key address of a key tree node, creating an address table based on the public key address and a path identifier, searching back to obtain the path identifier of a lost service private key based on the address table, and calculating to obtain the lost service private key by utilizing the root private key, the root chain code and the path identifier. The business 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 service private key is lost or destroyed, it can be recalculated in accordance with the method to restore or retrieve the service private key.
Description
Technical Field
The invention relates to the technical field of blockchain, in particular to a method for retrieving a blockchain HD private key.
Background
Blockchain (Blockchain) is a term in the information technology arts. Essentially, the system is a distributed database or a distributed account book, and data or information stored in the system has the characteristics of time sequence, non-tamper property, traceability, public transparency, collective maintainability and the like. Based on the characteristics, the blockchain technology lays a solid trust foundation, creates a reliable collaboration mechanism and has wide application prospect.
The operation of information or digital assets on the blockchain is not separated from the private key, and can be divided into two classes according to the generation mode of the private key: non-deterministic structures (Non-deterministic) and deterministic structures (Hierarchical Deterministic, deterministic structures or Hierarchical deterministic structures). The working principle of HD structure can be summarized as: a random number is utilized to create a root key pair (also called a master key pair or a head father key pair) and a root chain code through a root seed, then a definite and irreversible algorithm is utilized to generate any number of sub-keys and sub-chain codes based on the root key and the root chain code, namely, the root seed of the HD structure can sequentially generate a plurality of pairs of keys and chain codes in a stacking way, finally, a key tree with depth of D is generated, each stage comprises a plurality of pairs of sub-keys and sub-chain codes, the root of the key tree is the root key and the root chain code, the leaf (called as a 'last point') of the key tree is a leaf key, a last point key or a service key, the bifurcation (called a 'fulcrum' or a 'fork point') of the key tree is a fork point key, a fulcrum key or a management key (according to different application scenes, and can also be used as a service key), and a node is commonly called a root, a fulcrum key and a last point key, so that the root key, the fulcrum key and the last point key are collectively called a node key, and a specific position of the node in the key tree is determined as to what kind of key is actually.
Current blockchain systems are functionally and solely business keys by which users operate on information such as electronic files (including electronic judicial documents) or digital assets in the blockchain system. The service key pair comprises a service private key and a service public key, and once the service private key is lost or destroyed, the service private key means that the information such as the electronic file or the digital asset in the block chain cannot be operated, and also means that the information ownership and the punishment rights of the electronic file (including the electronic judicial document) or the digital asset are lost, and irrecoverable losses are caused to users.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method for recovering a blockchain HD private key, so as to solve the problem that the blockchain HD private key cannot be recovered when lost or damaged.
The invention provides a method for retrieving a blockchain HD private key, 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;
obtaining 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 to obtain the service private key by using the root key, the root chain code and the path identifier.
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 from the random number via the root seed further includes:
calculating a 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 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 a specific 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 adopting a CKD algorithm (Child Key Derivation function or called CKD function) to obtain a plurality of pairs of sub-keys and sub-chain codes;
repeating CKD calculation on the sub-key and the sub-chain code to obtain a new pair of sub-key and sub-chain code;
and generating a key tree from all the key pairs, the chain codes and the path identifiers obtained through calculation.
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 performing visual coding on the hash value to obtain a visual ASCII code, namely the public key address of the key.
According to a specific embodiment of the present invention, the visually encoding the hash value includes:
the visual encoding of the hash value is performed 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 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.
According to the method for retrieving the blockchain HD private key, when the root private key is known, and the service key is lost or damaged, the path identifier corresponding to the public key address of the lost service private key is reversely queried through the created address table, the service private key of any node can be calculated based on the root private key, the root chain code and the path identifier, and then the lost service key is retrieved, so that ownership and punishment rights of electronic files (including electronic judicial documents) and digital assets and related operation functions are ensured.
Drawings
FIG. 1 is a flow chart of a private key recovery method according to an embodiment of the invention.
Fig. 2 is a flow chart of a method of 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 present invention.
Fig. 4 is a flowchart of a method for obtaining a public key address according to an embodiment of the present invention.
Fig. 5 is a flow chart of a method of creating an address table according to an embodiment of the invention.
Detailed Description
In order to make the concept and idea of the present invention more clearly understood by those skilled in the art, the present invention is described in detail with reference to specific embodiments. It is to be understood that the embodiments presented herein are only a portion of all embodiments that the invention may have. Those skilled in the art, after having read the present specification, will be able to make modifications, alterations, or substitutions to some or all of the embodiments described below, which are also within the scope of the invention as claimed.
The terms "first," "second," and the like, herein do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The terms "a," "an," and other similar words are not intended to mean that there is only one of the things, but rather that the description is directed to only one of the things, which may have one or more. In this document, the terms "comprise," "include," and other similar words are intended to denote a logical relationship, but not to be construed as implying a spatial structural relationship. For example, "a includes B" is intended to mean that logically B belongs to a, and not that spatially B is located inside a. In addition, the terms "comprising," "including," and other similar terms should 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 other elements such as C, D, E.
The terms "embodiment," "this embodiment," "an embodiment," "one embodiment," and the like herein do not denote that the descriptions are merely applicable to one particular embodiment, but rather denote that the descriptions are also applicable to one or more other embodiments. It will be appreciated by those skilled in the art that any descriptions of one embodiment herein may be substituted for, combined with, or otherwise combined with the descriptions of another embodiment or embodiments, such substitution, combination, or other combination resulting in a new embodiment as would be apparent to one of ordinary skill in the art and would be within the scope of this 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 flow chart of a private key recovery method according to an embodiment of the invention, as shown in FIG. 1, the method comprises 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: obtaining 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 to obtain the service private key by using the root private key, the root chain code and the path identifier.
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 step S1 of creating the root key and the root chain code according to a random number via a root seed further includes:
s11: calculating a 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 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, performing hash operation on the root seed by adopting HMAC-SHA512 algorithm to generate a hash value, wherein the first half part of the hash value is a root private key, the second half part of the hash value is a root chain code, then, based on the root private key, performing operation on the root private key 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 as to obtain the root key and the root chain code. Wherein the asymmetric algorithm includes, but is 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, 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-keys and sub-chain codes.
S22: and repeating CKD calculation on the pairs of sub-keys and sub-chain codes to obtain new pairs of sub-keys and sub-chain codes.
S23: and generating a key tree from all the key pairs, the chain codes and the path identifiers obtained through calculation.
For example, the root key and the root chain code can be expanded to generate N pairs of keys and sub-chain codes through CKD algorithm, where n=2ζ, N is generally 32, and then the sub-keys and sub-chain codes of the next stage are expanded by repeating the above algorithm, so that D times are repeated, and finally a key tree with depth D is generated, where each stage includes N pairs of keys, and the root of each pair of keys is the root key, and 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 by 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 bifurcation points (including tree roots) of the key tree are bifurcation point keys, fulcrum keys or management keys (according to different application scenes, the management keys can also be used as service keys), the service keys under the management nodes can be calculated by the management private keys, the management chain codes and the path identifiers, 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, as shown in fig. 4, the step S3 of obtaining the public key address of the secret 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 performing visual coding on 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 as "node address", also called as "address" or "account number") is a visualized ASCII code generated by hash operation of the public key to be used as an external expression form of the service public key, so as to protect the privacy of the service public key. Although the public key of the business is disclosed to a certain extent, but only to the interested persons, but not to the unrelated persons, since the hash value is invisible binary, the hash value is generally subjected to visual coding operation, and the embodiment of the invention adopts the Base58 or Base64 algorithm to carry out visual coding, the visual coding operation is one-to-one reversible, that is to say, the binary input value can be converted into a visual 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, as shown in fig. 5, step S4 of creating the address table according to the address and the path identifier of the corresponding public key 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.
In particular, step S5 searches the path identification of the public key address corresponding to the lost service private key based on the address table,
because the path identifier is implicit to the user, and the user sees the address, the user needs to look up the corresponding path identifier reversely from the corresponding relationship between the address recorded in the address table and the path identifier by looking up the address table.
Specifically, step S6 calculates the service private key by using the root private key, the root chain code and the path identifier. The embodiment of the invention adopts an 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 searches the path identifier by creating the address table reversely, and calculates the service private key by the root private key, the root chain code and the path identifier, thereby retrieving the lost or damaged service private key, and ensuring the safety of the digital asset.
The concepts, principles and concepts of the invention have been described above in connection with specific embodiments (including examples and illustrations). It will be appreciated by those skilled in the art that embodiments of the invention are not limited to the several forms set forth above, and that after reading this specification, those skilled in the art may make any possible modifications, substitutions, and equivalents of the steps, methods, apparatuses, and components of the above embodiments, which are intended to be within the scope of the invention. The protection scope of the invention is only subject to the claims.
Claims (6)
1. A blockchain HD private key retrieval method, comprising:
creating a root key and a root chain code from the random number via the root seed;
generating a key tree based on 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,
obtaining 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;
calculating to obtain the service private key by utilizing a root private key, a root chain code and the path identifier;
wherein the generating a key tree from the root key, root chain code, and path identification further comprises:
calculating the root key and the root chain code by adopting a CKD algorithm to obtain a plurality of pairs of sub-keys and sub-chain codes;
repeating CKD calculation on the sub-key and the sub-chain code to obtain a new pair of sub-key and sub-chain code;
generating a key tree from all the key pairs, the chain codes and the path identifiers obtained through calculation;
wherein creating an address table from the address and the path identification of the corresponding public key further comprises:
acquiring the corresponding relation between each public key address and the path identifier;
and establishing the address table according to the corresponding relation.
2. The method of claim 1, wherein the root key comprises a root private key and a root public key, and wherein the creating the root key and the root chain code from the random number via the root seed further comprises:
calculating a 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 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 the obtaining the public key address of the key based on the path identification comprises:
carrying out hash operation on the public key of the secret key to obtain a hash value of the public key;
and performing visual coding on the hash value to obtain a visual ASCII code, namely the public key address of the key.
5. The method of claim 4, wherein visually encoding the hash value comprises:
the visual ASCII encoding is carried out on the hash value by adopting a Base58 algorithm or a Base64 algorithm.
6. The method of claim 1, wherein calculating the traffic private key using the root private key, root chain code, and path identification 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 CN112769566A (en) | 2021-05-07 |
| CN112769566B true 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109067801A (en) * | 2018-09-29 | 2018-12-21 | 平安科技（深圳）有限公司 | A kind of identity identifying method, identification authentication system and computer-readable medium |
| US10790976B1 (en) * | 2018-08-01 | 2020-09-29 | Bloomio Ag | System and method of blockchain wallet recovery |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107566117B (en) * | 2017-07-14 | 2019-10-29 | 浙商银行股份有限公司 | A kind of block chain key management system and method |
| US10951401B2 (en) * | 2018-03-30 | 2021-03-16 | Bitnomial, Inc. | Digital asset transfer system for secure digital asset transactions |
| CN108764907B (en) * | 2018-05-30 | 2022-03-01 | 招商银行股份有限公司 | Asset retrieving method, system and computer readable storage medium |
| CN109716375B (en) * | 2018-07-27 | 2023-06-23 | 区链通网络有限公司 | Block chain account processing method, device and storage 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 |
| CN110086612B (en) * | 2019-04-26 | 2022-03-04 | 山大地纬软件股份有限公司 | Block chain public and private key backup and lost recovery method 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 |
| CN111339199B (en) * | 2020-02-28 | 2023-08-29 | 中国工商银行股份有限公司 | Block chain key recovery method and device |
| CN111342967B (en) * | 2020-03-06 | 2021-03-19 | 北京中宇万通科技股份有限公司 | Method and device for solving block chain user certificate loss or damage |
-
2021
- 2021-01-19 CN CN202110068832.7A patent/CN112769566B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Non-Patent Citations (1)
| Title |
|---|
| Andreas M. Antonopoulos等.Mastering Ethereum.《Mastering Ethereum》.2018,第92-97页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112769566A (en) | 2021-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200374126A1 (en) | Method for storing an object on a plurality of storage nodes | |
| CN112769567B (en) | Block chain HD private key retrieving method | |
| KR20230169472A (en) | Trustless deterministic state machine | |
| CN113765657A (en) | Key data processing method and device and server | |
| Chang et al. | Short redactable signatures using random trees | |
| CN106776904A (en) | The fuzzy query encryption method of dynamic authentication is supported in a kind of insincere cloud computing environment | |
| CN103119594A (en) | Searchable encryption processing system | |
| CN107220559A (en) | A kind of encryption storage method for that can not tamper with a document | |
| CN107070896B (en) | Safe and efficient block chain network customized login method and safe reinforcement system | |
| CN112906056A (en) | Cloud storage key security management method based on block chain | |
| CN111461751A (en) | Block chain-based house property information chain organization method, historical state tracing method and device | |
| JPWO2018174112A1 (en) | Device authentication technology on the network | |
| CN109840401A (en) | For the watermark embedding method of data text | |
| Iftikhar et al. | A reversible watermarking technique for social network data sets for enabling data trust in cyber, physical, and social computing | |
| He et al. | Public integrity auditing for dynamic regenerating code based cloud storage | |
| CN110555783B (en) | Block chain-based electric power marketing data protection method and system | |
| Hou et al. | Multi-party verifiable privacy-preserving federated k-means clustering in outsourced environment | |
| KR102142955B1 (en) | A privatekey management method | |
| Iftikhar et al. | A survey on reversible watermarking techniques for relational databases | |
| Kazmirchuk et al. | The Improvement of digital signature algorithm based on elliptic curve cryptography | |
| CN112769566B (en) | Block chain HD private key recovery method | |
| EP3395032B1 (en) | Method for providing a proof-of-retrievability | |
| CN109088850B (en) | Lot cloud auditing method for positioning error files based on Lucas sequence | |
| KR101894566B1 (en) | Data transmission apparatus and method for encoding by integrating authentication and error correction | |
| CN108039944B (en) | De-ordering encryption framework algorithm with forward security |
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. |