TWI707246B - Key management system based on distributed multi-layered recursive and method thereof - Google Patents

Abstract

A key management system based on distributed multi-layered recursive and method thereof is disclosed. By recursively executing a secret sharing algorithm, encrypting according to a selected encryption key, calculating an index key according to a selected address and combining the selected address, so as to decompose the key, the selected encryption key and each address combination into a plurality of parts, wherein each different parts of the key, encryption key, and address combination in different databases. The mechanism is help to improve the security of the key.

Description

Distributed multi-layer recursive key storage system and method

The invention relates to a key custody system and method, in particular to a decentralized multi-layer recursive key custody system and method.

In recent years, as governments, organizations, and people attach importance to information security, various key-based applications have sprung up. Therefore, how to safely keep the keys has become one of the problems that manufacturers urgently want to solve.

Generally speaking, the common key storage method is to store the key separately in a specific device, such as storing the key separately on a flash drive, or encrypting the key and setting a password, and so on. However, when the USB flash drive is lost or the password is leaked or cracked, it will cause the unauthorized person to obtain the key and the entire chain of trust will be destroyed. Therefore, the above storage methods all have the problem of poor key security.

In view of this, some manufacturers have proposed the key management system (Key Management System, KMS) technology, which is used to uniformly generate, distribute and manage the keys (or key) of devices and applications, and use a master key To manage many other keys that have been generated. However, since the main key will be completely stored on the device, the security is still insufficient. When the main key is leaked, it will also lead As a result, other keys managed by it are also affected, so this method still cannot effectively solve the problem of poor key security.

In summary, it can be seen that the prior art has always had the problem of poor key security for a long time. Therefore, it is necessary to propose improved technical means to solve this problem.

The invention discloses a decentralized multi-layer recursive key storage system and method.

First of all, the present invention discloses a distributed multi-layer recursive key storage system. The system includes: an establishment module, an encryption processing module, a key processing module, a combination module, a drive module, and a storage module. Among them, the establishment module is used to establish keys, N encryption keys, 2N addresses, and M databases, and use this key as the data to be decomposed, where N and M are positive integers; encryption processing module The connection establishment module is used to execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and choose one of the unselected encryption keys to encrypt each shared unit separately. Generate M shared encryption units and choose one of the unselected addresses to provide each database for hash calculation to generate the corresponding index key value, and according to the index key value of each database, the The shared encryption units are stored in different databases; the key processing module connects the establishment module and the encryption processing module to execute the secret sharing algorithm to decompose the encryption key selected by the encryption processing module into M encryption keys Shared unit, and choose one of the unselected addresses to provide each database to perform hash calculation to generate the corresponding encryption key index key value, and according to the encryption key index key value of each database , To store the encryption key sharing unit in different databases; the combination module connects the encryption processing module and the key processing module, so that when there is an address that has not been selected, it is combined in a string combination The address selected in the encryption processing module and the key processing module is used as the data to be decomposed, so that the The data becomes an address combination containing two of the addresses and is sent to the encryption processing module; the drive module is connected to the encryption processing module, the key processing module, and the combination module to be used when there is an unselected encryption fund Key and address, drive the encryption processing module, the key processing module and the combination module to execute repeatedly in sequence; the storage module is connected to the encryption processing module and the key processing module to store the encryption processing module and The address selected last by the key processing module is read when the key is restored.

In addition, the present invention discloses a decentralized multi-layer recursive key storage method, the steps of which include: (A) establishing a key, N encryption keys, 2N addresses and M databases, where N and M are Positive integer; (B) use the key as the data to be decomposed; (C) execute the secret sharing algorithm to decompose the data to be decomposed into the corresponding M shared units, and choose one of the unselected encryption keys, use Encrypt each shared unit separately to generate M shared encryption units, and choose one of the unselected addresses to provide each database for hash calculation to generate the corresponding index key value, and according to For the index key value of each database, the shared encryption unit is stored in a different database; (D) The secret sharing algorithm is executed to decompose the selected encryption key into M encryption key sharing units, and in the unselected Choose one of the addresses to provide each database to perform hash calculation to generate the corresponding encryption key index key value, and divide the encryption key sharing unit according to the encryption key index key value of each database Stored in a different database; (E) When there is the address that has not been selected, the address selected in steps (C) and (D) is combined in a string combination as the data to be decomposed, so that the Decompose the data into an address combination containing two of the addresses; (F) when there is an encryption key and address that have not been selected, repeat steps (C) to (E); and (G) save step ( The last address selected in C) and (D) is used to read when providing the recovery key.

The system and method disclosed in the present invention are as above. The difference from the prior art is that the present invention executes the secret sharing algorithm recursively, encrypts according to the selected encryption key, and selects The address calculation index key value and the address selected by the combination are used to decompose the key, encryption key, and address combination into multiple parts, so that different databases can store the key, encryption key, and location separately Different parts of the address combination.

Through the above technical means, the present invention can achieve the technical effect of improving the security of the key.

110: Create a module

111: database

120: Encryption processing module

130: Key Processing Module

140: Combined module

150: drive module

160: storage module

301: The first database

310: The Mth database

400: data sheet

Step A: Create a key, N encryption keys, 2N addresses, and M databases, where N and M are positive integers

Step B: Use the key as a data to be decomposed

Step C: Execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and choose one of the encryption keys that have not been selected to encrypt each shared unit separately Generate M shared encryption units, and choose one of the addresses that have not been selected to provide each database for hash calculation to generate a corresponding index key value, and according to the index of each database Key value, storing the shared encryption units in different databases

Step D: Execute the secret sharing algorithm to decompose the selected encryption key into M encryption key sharing units, and choose one of the unselected addresses to provide each database for processing Hash calculation to generate a corresponding encryption key index key value, and according to the encryption key index key value of each database, the encryption key sharing unit is respectively stored in different said database

Step E: When there is the address that has not been selected, combine the address selected in steps (C) and (D) as the data to be decomposed

Step F: When there is the encryption key and the address that have not been selected, repeat steps (C) to (E)

Step G: Store the address selected last in steps (C) and (D) for reading when restoring the key

Figure 1 is a system block diagram of the decentralized multi-layer recursive key storage system of the present invention.

Figure 2 is a method flow chart of the decentralized multi-layer recursive key storage method of the present invention.

Figure 3 is a schematic diagram of applying the present invention to generate a shared encryption unit based on a key and store it in a database.

Figure 4 is a schematic diagram of the application of the present invention to generate an encryption key sharing unit based on the encryption key and store it in the database.

Figure 5 is a schematic diagram of the application of the present invention in combination with the selected address to generate a shared encryption unit and store it in the database.

Figure 6 is a schematic diagram of the storage content of the database using the present invention.

Hereinafter, the implementation of the present invention will be described in detail with the drawings and embodiments, so as to fully understand and implement the implementation process of how the present invention uses technical means to solve technical problems and achieve technical effects.

Before describing the decentralized multi-layer recursive key custody system and method disclosed in the present invention, the self-defined terminology of the present invention will be explained. The "Share" in the present invention refers to the secret after execution. The parts decomposed after the calculation of the shared algorithm; the "shared encryption unit" refers to the "shared unit" encrypted by the encryption key; the "encryption key sharing unit" refers to the encryption key after performing secret sharing The parts decomposed by the algorithm calculation, in fact, are different from the aforementioned shared unit only in that the encryption key shared unit is generated based on the encryption key; the "index key" and "encryption key index" The key value is the value obtained by hashing the selected address in the database. The difference is that the former corresponds to the "shared unit" and the latter corresponds to the "encrypted key shared unit". In particular, because the hash function used by each database has a different salt (that is, insert a specific string at any fixed position of the address before hashing), so The calculated value will not be the same. In other words, assuming that there are five shared encryption units, which are stored in five different databases, their corresponding index key values will not be the same, which can ensure that the index key values are unique Sex.

The following is a further description of the distributed multi-layer recursive key custody system and method of the present invention in conjunction with the diagrams. Please refer to "Figure 1" first. "Figure 1" shows the distributed multi-layer recursive key custody system of the present invention. The system block diagram of the system includes: a creation module 110, an encryption processing module 120, a key processing module 130, a combining module 140, a driving module 150, and a storage module 160. Wherein, the creation module 110 is used to create a key, N encryption keys, 2N addresses, and M database 111, and use this key as the data to be decomposed, where N and M are positive integers. For example, assuming that N is a value of 3 and M is a value of 5, it means that three encryption keys, six addresses, and five databases 111 are created. In actual implementation, the key may be a master key (Master Key), that is, a key used to manage other private keys (Private keys). In addition, when the address is created, an encoding function can be executed to make the address and the blockchain address The format is the same, so that many similar data can appear in the database 111 through the same format, thereby achieving the effect of confusion and making it difficult for hackers to distinguish the role of each data. As for the generation of the encryption key, the public key corresponding to the key and the private key managed by it can be used, and each private key can be used as the data to be decomposed to execute the secret sharing algorithm to decompose the private key into shared Unit, encrypt as a shared encryption unit, and calculate the corresponding index key value, and then store different shared encryption units and their corresponding index key values in different database 111 respectively.

The encryption processing module 120 is connected to the establishment module 110 to execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and choose one of the encryption keys that have not been selected for each A shared unit encrypts to generate M shared encryption units, and selects one of the unselected addresses to provide each database 111 for hash calculation to generate the corresponding index key value, and according to each data The index key value of the library 111 stores the shared encryption unit in different database 111 respectively. In other words, each selected encryption key cannot be selected again after encrypting each shared unit. In actual implementation, in order to improve calculation efficiency, the encryption key can be a symmetric key. In addition, the secret sharing algorithm may include Shamir's Secret Sharing (SSS), Blakley's Secret Sharing (BSS) or similar algorithms.

The key processing module 130 is connected to the establishment module 110 and the encryption processing module 120, and is used to execute a secret sharing algorithm to decompose the encryption key selected by the encryption processing module into M encryption key sharing units, and the unselected Choose one of the addresses to provide each database 111 for hash calculation to generate the corresponding encryption key index key value, and share the encryption key according to the encryption key index key value of each database 111 The units are stored in different databases 111 respectively. The difference between the key processing module 130 and the encryption processing module 120 is that the former does not encrypt the result of the secret sharing algorithm, and The latter uses an encryption key to encrypt the result, the former performs a secret sharing algorithm for the key or combined address, and the latter is for the selected encryption key.

The combining module 140 is connected to the encryption processing module 120 and the key processing module 130, and is used to combine the addresses selected in the encryption processing module 120 and the key processing module 130 when there are addresses that have not yet been selected As the data to be decomposed, it is sent to the encryption processing module 120 to execute the secret sharing algorithm. In actual implementation, the address selected in combination may be a combination of strings. For example, the address selected in the encryption processing module 120 is "0xabc...", and the address selected in the key processing module 130 is selected The address of is "0xdef...", when combined by the combination module 140, an address combination containing two addresses "0xabc......0xdef......" will be generated As the data to be decomposed, it is sent to the encryption processing module 120 to execute the secret sharing algorithm.

The drive module 150 is connected to the encryption processing module 120, the key processing module 130, and the combining module 140, and is used to drive the encryption processing module 120, the key processing module when there is an encryption key and address that have not been selected yet. The group 130 and the combining module 140 are repeatedly executed in sequence. Because each execution in sequence will use one encryption key and two addresses. Therefore, in the example where N is the value 3, the encryption processing module 120, the key processing module 130, and the combining module 140 will be executed three times in sequence before there is no unselected encryption key and address. It can be treated as one layer at a time.

The storage module 160 is connected to the encryption processing module 120 and the key processing module 130, and is used to store the last selected addresses of the encryption processing module 120 and the key processing module 130 respectively for reading when the key is restored. In actual implementation, these two addresses (that is, the last selected address of the encryption processing module 120 and the last selected address of the key processing module 130) can be stored through the key management configuration file, so as to restore the key At the time, by reading these two addresses, the corresponding partial encryption key and the partial binding address encrypted by this encryption key are known (the partial binding address mentioned here refers to the combination of the combination module 140). of The address is used as the data to be decomposed, and the encryption processing module 120 executes the shared unit decomposed by the secret sharing algorithm on the data to be decomposed), and then restores the complete encryption key based on the partial encryption key, and then decrypts it to encrypt The key-encrypted part of the combined address in order to restore the unencrypted part of the combined address, and then restore it to the complete combined address to obtain the two addresses it contains, and continue processing in the same way until the partial encrypted address is obtained. After the key, the complete key is restored. In particular, due to the use of the secret sharing algorithm, in the restoration process, the complete encryption key can be restored without obtaining all the partial encryption keys. Similarly, it is not necessary to obtain all the partial binding addresses. The complete binding address is restored, and the complete key can be restored without obtaining all partial keys. Generally speaking, when M is 5, as long as you have three of the parts, you can restore the complete key, and you don't need to have all the parts.

In particular, it should be noted that in actual implementation, each module described in the present invention can be implemented in various ways, including software, hardware, or any combination thereof. For example, in some embodiments, each module can be It can be implemented by software and hardware or one of them. In addition, the present invention can also be implemented partially or completely based on hardware. For example, one or more modules in the system can be implemented through integrated circuit chips, System on Chip (SoC), Complex Programmable Logic Device (CPLD), Field Programmable Gate Array (FPGA), etc. are implemented. The present invention can be a system, method and/or computer program. The computer program may include a computer-readable storage medium loaded with computer-readable program instructions for enabling the processor to implement various aspects of the present invention. The computer-readable storage medium may be a tangible storage medium that can hold and store instructions used by an instruction execution device. equipment. The computer-readable storage medium can be, but is not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (non-exhaustive list) of computer-readable storage media include: hard drives, Machine access memory, read-only memory, flash memory, CD-ROM, floppy disk, and any suitable combination of the above. The computer-readable storage medium used herein is not interpreted as a transient signal itself, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides or other transmission media (for example, optical signals through fiber optic cables), or through wires Transmission of electrical signals. In addition, the computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to various computing/processing devices, or downloaded via a network, such as the Internet, local area network, wide area network, and/or wireless network To an external computer device or external storage device. The network may include copper transmission cables, optical fiber transmission, wireless transmission, routers, firewalls, switches, hubs and/or gateways. The network card or network interface in each computing/processing device receives computer-readable program instructions from the network, and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing/processing device in. The computer program instructions that perform the operations of the present invention may be combined language instructions, instruction set architecture instructions, machine instructions, machine-related instructions, micro instructions, firmware instructions, or source code or object code written in any combination of one or more programming languages (Object Code), the programming language includes object-oriented programming languages, such as: Common Lisp, Python, C++, Objective-C, Smalltalk, Delphi, Java, Swift, C#, Perl, Ruby, PHP, etc., as well as conventional programs Procedural programming language, such as C language or similar programming language. Computer readable program instructions can be executed entirely on the computer, partly on the computer, executed as a stand-alone software, partly on the client computer and partly on the remote computer, or entirely on the remote computer or server Executed on.

Please refer to "Figure 2. "Figure 2" is a flow chart of the method for decentralized multi-layer recursive key storage of the present invention. The steps include: establishing a key, N encryption keys, 2N addresses, and M A database 111, where N and M are positive integers (step A); use the key as the data to be decomposed (step B); execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and Unselected Choose one of the selected encryption keys to separately encrypt each shared unit to generate M shared encryption units, and choose one of the unselected addresses to provide each database 111 Perform hash calculation to generate the corresponding index key value, and according to the index key value of each database 111, store the shared encryption units in different database 111 (step C); execute the secret sharing algorithm to select the encryption gold The key is decomposed into M encryption key sharing units, and one of the unselected addresses is selected to provide each database 111 for hash calculation to generate the corresponding encryption key index key value, and according to each The encryption key index key value of the database 111, and the encryption key sharing units are respectively stored in different databases 111 (step D); when there is an address that has not yet been selected, combine steps (C) and (D) The selected address is used as the data to be decomposed (step E); when there is an encryption key and address that have not been selected, repeat steps (C) to (E) (step F); and save steps (C) and The last selected address in (D) is used for reading when providing the recovery key (step G). Through the above steps, you can execute the secret sharing algorithm recursively, encrypt according to the selected encryption key, calculate the index key value according to the selected address, and combine the selected address to combine the key, encryption key and The address combination is decomposed into multiple parts, so that different databases 111 store the key, encryption key, and different parts of the address combination, instead of storing the complete key and encryption in a single database. Key and address combination.

The following description will be given in the form of an embodiment in conjunction with "Figure 3" to "Figure 6". Please refer to "Figure 3". "Figure 3" is the application of the present invention to generate a shared encryption unit based on a key and store it in Schematic diagram of the database. Assuming that a key, N encryption keys, 2N addresses, and M databases 111 have been established, in order to effectively protect this key and prevent unauthorized persons from obtaining it, first execute a secret sharing algorithm to decompose this key into Multiple parts, namely: shared unit 1 to shared unit M. Then, choose one of the N encryption keys to encrypt each shared unit into shared encryption unit 1 to shared encryption unit M, and store these shared encryption units in different database 111, for example , Will total The shared encryption unit 1 is stored in the first database 301, the shared encryption unit 2 is stored in the second database, and so on, the shared encryption unit M is stored in the M-th database 310. In particular, before saving to the database, you need to choose one of the 2N addresses (for example, if N is the value 3, then choose one of the six addresses), and provide it to Each database performs a hash calculation to generate a corresponding index key value, which is unique. At this point, the index key value can be filled in the key field, and the shared encryption unit can be filled in the value field. The detailed storage content of the database will be further explained later in conjunction with the diagram. So far, the key has been decomposed into M parts, and each part is encrypted and stored in the database together with the corresponding index key value.

As shown in "Figure 4", "Figure 4" is a schematic diagram of applying the present invention to generate an encryption key sharing unit based on an encryption key and store it in a database. As mentioned earlier, any one of the N encryption keys can be selected to encrypt each shared unit into shared encryption unit 1 to shared encryption unit M. In order to protect the encryption key, the secret sharing algorithm is also executed to decompose it into M parts, namely: encryption key sharing unit 1 to encryption key sharing unit M. Then, choose one of the addresses that have not been selected before, and provide each database for hash calculation to generate the corresponding encryption key index key value, that is, the selected address in the process of "Figure 3" The address will be excluded because it has already been selected. After the encryption key sharing unit and the encryption key index key value are generated, each encryption key sharing unit can be stored in different databases. At this point, the selected encryption key has been decomposed into M parts, and stored in the database together with the corresponding index key value, for example: the encryption key index key generated by the hash operation of the first database according to the selected address The value corresponds to the encryption key sharing unit stored in the first database (for example: encryption key sharing unit 1); the second database performs a hash operation based on the selected address to generate the encryption key index key value Correspond to the encryption key sharing unit stored in the second database (for example: encryption key sharing unit 2), and so on, the Mth database is selected according to the selection The encryption key index key value generated by the hash operation at the address corresponds to the encryption key sharing unit (for example, the encryption key sharing unit M) stored in the M-th database.

As shown in "Figure 5", "Figure 5" is a schematic diagram of applying the present invention in combination with the selected address to generate a shared encryption unit and store it in the database. From the above description, it is clear that the key and the selected encryption key have been processed by the secret sharing algorithm. In order to improve the confusion and security, similar processing is also performed on the selected address. First, combine the addresses selected in the processes of "Figure 3" and "Figure 4". For example, suppose the addresses selected in "Figure 3" are "1234" and "Figure 4" The selected address in "is "5678", then the string can be combined into "12345678". Then, the combined address is used as the data to be decomposed and provided to the secret sharing algorithm for calculation to generate M parts (ie, sharing unit 1 to sharing unit M). Next, select an encryption key that has not been selected, and use this encryption key to encrypt shared unit 1 to shared unit M to become shared encryption unit 1 to shared encryption unit M, and select an address that has not been selected before. Perform hash calculation for each database to generate the corresponding index key value, and then store these encrypted shared units (ie: shared encryption unit 1 to shared encryption unit M) in different databases, for example, the first The index key value generated by the database 301 performing the hash operation according to the selected address corresponds to the shared encryption unit (for example: shared encryption unit 1) stored in the first database 301; the second database is based on the selected bit The index key value generated by the hash operation of the address corresponds to the shared encryption unit (for example: shared encryption unit 2) stored in the second database, and so on, the M-th database 310 performs processing according to the selected address The index key value generated by the hash operation corresponds to the shared encryption unit (for example, the shared encryption unit M) stored in the M-th database 310. So far, the combined address has been decomposed into M parts, and after being encrypted separately, they are stored in different databases together with the corresponding index keys.

As shown in "Figure 6", "Figure 6" is a schematic diagram of the stored content of the database using the present invention. In actual implementation, the database 111 can be a "Key-Value database" or its analogues, where the "index key value" and "encryption key index key value" generated by the hash calculation of the database, Stored in the field of the index key (Key); the M parts (including the encrypted "shared encryption unit" and the unencrypted "encrypted key sharing unit") decomposed by executing the secret sharing algorithm are stored in the value (Value) field. Assuming that N is a value of 3 and M is a value of 5, it represents the creation of three encryption keys, six addresses (2*3=6), and five databases, which are stored in the distributed multi-layer recursive key storage of the present invention After the method is processed, taking the content stored in the third database as an example, it can be clearly seen that there are six records in the table 400, among which "Hash(address ₁ )" represents the hash calculation of the first address; "Hash(address ₂ )" represents the hash calculation of the second address, and so on, "Hash(address ₆ )" represents the hash calculation of the sixth address; "Encrypted(masterKey_share ₃ ,key ₁ ) "Represents the value obtained by using the first encryption key to encrypt the third part of the key; "key ₁ _share ₃ " represents the third part decomposed by the first encryption key after executing the secret sharing algorithm; "Key ₂ _share ₃ " represents the third part of the second encryption key that is decomposed after executing the secret sharing algorithm; "key ₃ _share ₃ " represents the third encryption key that is decomposed after executing the secret sharing algorithm The third part of the output; "Encrypted([address ₁ +address ₂ ]_share ₃ ,key ₂ )" represents the combination of the address selected for the first time and the address selected for the second time. After executing the secret sharing algorithm The third part is decomposed and encrypted with the second encryption key; "Encrypted([address ₃ +address ₄ ]_share ₃ ,key ₃ )" represents the address selected for the third time and the address selected for the fourth time The third part decomposed after executing the secret sharing algorithm is encrypted with the third encryption key. In this example, the fifth selected address and the sixth selected address will be stored in the key management configuration file to provide the key to restore. When restoring the key, you only need to use the address recorded in the key management configuration file as the entry point and perform reverse processing to obtain the key. In particular, the restored key only exists in the memory of the key management system, and will not exist in a complete form in any non-volatile storage device, so the security of the key can be greatly improved.

In summary, it can be seen that the difference between the present invention and the prior art is that it executes the secret sharing algorithm recursively, encrypts according to the selected encryption key, calculates the index key value according to the selected address, and combines the selected address. Used to decompose the key, encryption key, and address combination into multiple parts, so that different parts of the key, encryption key, and address combination are stored in different databases. This technical method can Solve the problems existing in the prior art, and achieve the technical effect of improving the security of the key.

Although the present invention is disclosed in the foregoing embodiments as above, it is not intended to limit the present invention. Anyone familiar with similar art can make some changes and modifications without departing from the spirit and scope of the present invention. Therefore, the present invention The scope of patent protection shall be determined by the scope of the patent application attached to this specification.

110: Create a module

111: database

120: Encryption processing module

130: Key Processing Module

140: Combined module

150: drive module

160: storage module

Claims (8)

A decentralized multi-layer recursive key custody system. The system includes: an establishment module to establish a key, N encryption keys, 2N addresses, and M databases, and use the key as A data to be decomposed, where N and M are positive integers; an encryption processing module, connected to the establishment module, to execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and Choose one of the unselected encryption keys to encrypt each shared unit to generate M shared encryption units, and choose one of the unselected addresses to provide Each database performs hash calculation to generate a corresponding index key value, and according to the index key value of each database, the shared encryption unit is stored in a different database; a key processing module , Connect the establishment module and the encryption processing module to execute the secret sharing algorithm to decompose the encryption key selected by the encryption processing module into M encryption key sharing units, and perform the secret sharing algorithm Choose one of the addresses to provide each database to perform hash calculation to generate a corresponding encryption key index key value, and to encrypt the encryption key according to the encryption key index key value of each database The key sharing units are respectively stored in different said databases; a combination module, which connects the encryption processing module and the key processing module, is used when the address that has not yet been selected exists, with a string The method of combining combines the address selected in the encryption processing module and the key processing module as the to-be-decomposed Data, making the data to be decomposed into a one-address combination containing two of the addresses and sent to the encryption processing module; a drive module connected to the encryption processing module, the key processing module and the combination A module for driving the encryption processing module, the key processing module, and the combination module to execute repeatedly when the encryption key and the address that have not been selected exist; and a storage module The group is connected to the encryption processing module and the key processing module, and is used to store the last selected address of the encryption processing module and the key processing module respectively for reading when the key is restored. According to the distributed multi-layer recursive key storage system according to the first item of the scope of patent application, when the address is established, an encoding function is executed to make the address and the blockchain address have the same format. The distributed multi-layer recursive key custody system according to item 1 of the scope of patent application, wherein the establishment module is used to manage at least one private key according to the key and a corresponding one of each private key The public key generates the encryption key, and each private key is used as the data to be decomposed. The encryption processing module executes the secret sharing algorithm to decompose the private key into the shared unit and encrypts the shared The encryption unit and the corresponding index key value are calculated, and then the different shared encryption units and the corresponding index key values are respectively stored in different databases. According to the decentralized multi-layer recursive key custody system according to the first item of the patent application, the secret sharing algorithm includes Shamir’s Secret Sharing (Shamir’s Secret Sharing). Sharing, SSS) and Blakley’s Secret Sharing (BSS). A decentralized multi-layer recursive key storage method, the steps include: (A) establishing a key, N encryption keys, 2N addresses, and M databases, where N and M are positive integers; B) Use the key as a data to be decomposed; (C) Execute a secret sharing algorithm to decompose the data to be decomposed into corresponding M shared units, and choose one of the encryption keys that have not been selected , To separately encrypt each shared unit to generate M shared encryption units, and to choose one of the addresses that have not been selected, to provide each database for hash calculation to generate a corresponding index Key value, and according to the index key value of each database, the shared encryption unit is stored in a different database; (D) execute the secret sharing algorithm to decompose the selected encryption key into M encryption key sharing units, and choose one of the addresses that have not been selected, to provide each database for hash calculation to generate a corresponding encryption key index key value, and according to each data The encryption key index key value of the library, the encryption key sharing unit is respectively stored in the different said database; (E) when there is the address that has not been selected, it is combined by string combination The address selected in steps (C) and (D) is used as the data to be decomposed, so that the data to be decomposed becomes a combination of two addresses; (F) when there is an unselected one For the encryption key and the address, repeat steps (C) to (E); and (G) Store the address selected last in steps (C) and (D) for reading when the key is restored. According to the distributed multi-layer recursive key storage method according to item 6 of the scope of patent application, when the address is created, an encoding function is executed to make the address and the blockchain address have the same format. The distributed multi-layer recursive key storage method according to item 6 of the scope of patent application, wherein the encryption key is generated according to a public key corresponding to the key and at least one private key managed by the key, And each private key is used as the data to be decomposed to execute the secret sharing algorithm to decompose the private key into the shared unit, encrypt it into the shared encryption unit, and calculate the corresponding index key value, Then, the different shared encryption units and their corresponding index key values are stored in different databases. According to the distributed multi-layer recursive key custody method of item 6 of the scope of patent application, the secret sharing algorithm includes Shamir's Secret Sharing (SSS) and Blakley's Secret Sharing (Blakley's Secret Sharing, BSS).

Images