CN118364477A - Data processing method and device, electronic device, and storage medium - Google Patents

Abstract

The embodiment of the present application discloses a data processing method and device, an electronic device, and a storage medium, the method comprising: after secret sharing is performed according to a target key to be backed up to generate multiple subkeys, the multiple subkeys are first encrypted separately to obtain multiple subkey ciphertext data, and the multiple subkey ciphertext data are stored in different storage devices; then, the subkey ciphertext data corresponding to the target key is searched from different storage devices, and the found subkey ciphertext data is verified, if the verification of the found subkey ciphertext data is successful, it is determined that the multiple subkey ciphertext data are successfully stored in different storage devices, therefore, the target key is activated to perform encryption processing according to the activated target key. The technical solution of the embodiment of the present application can improve the security of key backup, and thus improve data security.

Description

Data processing method and device, electronic device, and storage medium

Technical Field

The present application relates to the field of computer technology, and more specifically, to a data processing method and device, an electronic device, a storage medium, and a program product.

Background technique

In order to improve data security, key technology will be used in transactions, data sharing, communication transmission, blockchain, etc. For example, in order to improve transaction security, during the transaction process, the transaction request is usually signed based on the private key. The trading platform authenticates the identity based on the signature and then executes the corresponding transaction.

Therefore, in the process of using key technology for data protection, the security of data depends on the security of the key. In order to avoid key loss, the key is usually backed up. However, in the related art, in the process of backing up the key, the backed up key is usually stored in a designated area. This backup method is prone to leakage of the backed up key, reducing the security of key backup and data security.

Summary of the invention

The embodiments of the present application provide a data processing method and device, an electronic device, a storage medium, and a program product, which can reduce the risk of leakage of backup data corresponding to a key, improve the security of key backup, and thereby improve data security.

According to one aspect of an embodiment of the present application, a data processing method is provided, the method comprising:

Perform secret sharing according to the target key to be backed up to generate multiple subkeys;

Encrypt the multiple subkeys respectively to obtain multiple subkey ciphertext data, and store the multiple subkey ciphertext data in different storage devices;

Searching for subkey ciphertext data corresponding to the target key from the different storage devices, and verifying the found subkey ciphertext data;

If the found subkey ciphertext data is successfully verified, it is determined that the plurality of subkey ciphertext data are successfully stored in the different storage devices, and the target key is activated to perform encryption processing according to the activated target key.

According to one aspect of an embodiment of the present application, a data processing device is provided, the device comprising:

A generation module configured to perform secret sharing according to a target key to be backed up to generate a plurality of subkeys;

A processing module is configured to encrypt the multiple subkeys respectively to obtain multiple subkey ciphertext data, and store the multiple subkey ciphertext data in different storage devices;

A verification module, configured to search for subkey ciphertext data corresponding to the target key from the different storage devices, and verify the found subkey ciphertext data;

The activation module is configured to determine that the multiple subkey ciphertext data are successfully stored in the different storage devices if the verification of the found subkey ciphertext data is successful, and activate the target key to perform encryption processing according to the activated target key.

According to one aspect of an embodiment of the present application, there is provided an electronic device, including:

one or more processors;

The memory is used to store one or more computer programs. When the one or more computer programs are executed by the one or more processors, the electronic device implements the data processing method as described above.

According to one aspect of an embodiment of the present application, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor of an electronic device, the electronic device implements the data processing method as described above.

According to one aspect of an embodiment of the present application, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the data processing method as described above is implemented.

In the technical solution provided in the embodiment of the present application, after secret sharing is performed according to the target key to be backed up to generate multiple sub-keys, the multiple sub-keys are first encrypted separately to obtain multiple sub-key ciphertext data, and the multiple sub-key ciphertext data are stored in different storage devices; then, the sub-key ciphertext data corresponding to the target key is searched from different storage devices, and the found sub-key ciphertext data is verified. If the verification of the found sub-key ciphertext data is successful, it is determined that the multiple sub-key ciphertext data are successfully stored in different storage devices. Therefore, the target key is activated to perform encryption processing according to the activated target key. Compared with the related art, on the one hand, by encrypting multiple sub-keys corresponding to the target key Storing subkey ciphertext data in different storage devices not only realizes the backup of the target key and avoids the situation where data security cannot be guaranteed due to the loss of the target key, but also increases the difficulty of restoring the target key based on the backup data, reduces the risk of backup data being leaked, improves the security of key backup, and thus improves data security; on the other hand, the subkey ciphertext data stored in the storage device is verified to determine that multiple subkey ciphertext data are successfully stored in different storage devices before activating the target key, thereby avoiding the loss or error of subkey ciphertext data during the backup process, resulting in the inability to restore the target key based on the subkey ciphertext data stored in the storage device, further improving data security.

It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application.

BRIEF DESCRIPTION OF THE DRAWINGS

Figure 1 is a schematic diagram of the structure of a blockchain network;

Figure 2 is a schematic diagram of the connection relationship between blocks in the blockchain;

FIG3 is a schematic diagram of an implementation environment shown in an exemplary embodiment of the present application;

FIG4 is a flow chart of a data processing method shown in an exemplary embodiment of the present application;

FIG5 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG6 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG7 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG8 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG9 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG10 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG11 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG12 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG13 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG14 is a flow chart of a data processing method shown in another exemplary embodiment of the present application;

FIG15 is a flowchart of a key backup process shown in an exemplary embodiment of the present application;

FIG16 is a schematic diagram of a key backup process according to an exemplary embodiment of the present application;

FIG17 is a schematic diagram of a key backup process shown in an exemplary embodiment of the present application;

FIG18 is a schematic diagram of a key backup process according to an exemplary embodiment of the present application;

FIG19 is a flowchart of a key restoration process shown in an exemplary embodiment of the present application;

FIG20 is a schematic diagram of a key restoration process shown in an exemplary embodiment of the present application;

FIG21 is a schematic diagram of the structure of a data processing device shown in another exemplary embodiment of the present application;

FIG. 22 shows a schematic diagram of the structure of a computer system of an electronic device suitable for implementing an embodiment of the present application.

Detailed ways

Here, exemplary embodiments will be described in detail, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are only examples of devices and methods consistent with some aspects of the present application as detailed in the attached claims.

The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and operations/steps, nor must they be executed in the order described. For example, some operations/steps can be decomposed, and some operations/steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

It should also be noted that the "multiple" mentioned in this application refers to two or more than two. "And/or" describes the association relationship of the associated objects, indicating that there can be three relationships. For example, A and/or B can mean: A exists alone, A and B exist at the same time, and B exists alone. The character "/" generally indicates that the previous and next associated objects are in an "or" relationship.

The technical solution of the embodiment of the present application can be applied to the field of blockchain technology. Before introducing the technical solution of the embodiment of the present application, a brief introduction to blockchain technology is first given.

Blockchain: A distributed ledger in the field of information technology. It is a new application model of computer technologies such as distributed data storage, peer-to-peer transmission, consensus mechanism, and encryption algorithm. Blockchain is essentially a decentralized database, a string of data blocks (i.e. blocks) generated by cryptographic methods. Each data block contains a batch of network transaction information, which is used to verify the validity of its information (anti-counterfeiting) and generate the next block. Blockchain can include the underlying blockchain platform, platform product service layer, and application service layer. Consensus mechanisms include but are not limited to POW (Proof of Work), POS (Proof of Stake), DPOS (Delegated Proof-of-Stake Consensus), PBFT (Practical Byzantine Fault Tolerance), etc.

As mentioned above, blockchain is essentially a decentralized database, and blockchain is jointly maintained by nodes in the blockchain network. Nodes are the smallest units involved in blockchain maintenance and are the deployment and operation units of blockchain node programs. For example, please refer to Figure 1. In the blockchain network 10 shown in Figure 1, multiple nodes 101 may be included. Each node 101 can receive input information when performing normal work, and maintain the shared data in the blockchain network based on the received input information. In order to ensure the information intercommunication within the blockchain network, there can be information connections between each node in the blockchain network, and information can be transmitted between nodes through the above information connections. For example, when any node in the blockchain network receives input information, other nodes in the blockchain network obtain the input information according to the consensus algorithm, and store the input information as shared data, so that the data stored on all nodes in the blockchain network are consistent. Since the block is a node consensus, it has the characteristics of being tamper-proof, traceable, and jointly maintained.

Each node in the blockchain network has a corresponding node identifier, and each node in the blockchain network can store the node identifiers of other nodes, so that the generated blocks can be broadcast to other nodes in the blockchain network according to the node identifiers of other nodes. A node identifier list can be maintained in each node, and the node name and node identifier are stored in the node identifier list accordingly. The node identifier can be an IP (Internet Protocol, a protocol for interconnecting networks) address or any other information that can be used to identify the node.

Each node in the blockchain network stores an identical blockchain. As shown in Figure 2, the blockchain consists of multiple blocks. The genesis block includes a block header and a block body. The block header stores input information feature values, version numbers, timestamps, and difficulty values, and the block body stores input information. The next block of the genesis block uses the genesis block as its parent block. The next block also includes a block header and a block body. The block header stores the input information feature values of the current block, the block header feature values, version numbers, timestamps, and difficulty values of the parent block, and so on. This ensures that the block data stored in each block in the blockchain is associated with the block data stored in the parent block, ensuring the security of the input information in the block.

It is understandable that each node in the blockchain network can be a server or a terminal device. Among them, the server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud services, cloud databases, cloud computing (Cloud Computing), cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN (Content Delivery Network), and basic cloud computing services such as big data and intelligent platforms. Among them, the terminal device can be a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart speaker, a smart watch, a terminal used in a car (on-board terminal), an aircraft, etc., but is not limited to this. Each node can be directly or indirectly connected by wired or wireless communication, and this application is not limited here.

The technical solution of the embodiment of the present application can be applied to blockchain technology. The technical solution of the embodiment of the present application is described in detail below:

In order to improve data security, key technology will be used in transactions, data sharing, communication transmission, blockchain, etc. For example, in order to improve transaction security, in the process of conducting transactions, transaction requests are usually signed based on private keys, and the trading platform performs identity authentication based on the signature before executing the corresponding transaction. Therefore, in the process of using key technology for data protection, the security of the data depends to a large extent on the security of the key. In order to avoid the loss of keys, keys are usually backed up. However, in the related art, in the process of backing up keys, the backed-up keys are usually stored in a designated area. This backup method easily leads to the leakage of the backup keys, reducing the security of key backup and data security. Based on this, the embodiments of the present application provide a data processing method and device, an electronic device, a storage medium, and a program product, which can reduce the risk of leakage of backup data corresponding to the key, improve the security of key backup, and thus improve data security.

Please refer to Fig. 3, which is a schematic diagram of an implementation environment involved in the present application, and the implementation environment includes a data processing device 310 and multiple storage devices 320. The data processing device 310 and the storage device 320 can communicate with each other in a wired or wireless manner.

The data processing device 310 may be a server, a terminal device, or a processing system composed of a server and a terminal device. For specific examples of the server and the terminal device, please refer to the above description, which will not be repeated here.

A storage device is any device with storage function, which can be an independent device, a storage machine or distributed system composed of multiple storage units, or a cloud storage system that can provide storage function. Among them, cloud storage is a new concept extended and developed from the concept of cloud computing. A distributed cloud storage system refers to a storage system that uses cluster applications, grid technology, and distributed storage file systems to bring together a large number of different types of storage devices (storage devices are also called storage nodes) in the network through application software or application interfaces to work together and provide external data storage and business access functions.

The number of data processing devices 310 and storage devices 320 in FIG. 3 is merely illustrative, and any number of data processing devices 310 and storage devices 320 may be provided according to actual needs.

In an exemplary embodiment, the data processing method provided by the embodiment of the present application can be executed by the data processing device 310. Correspondingly, the data processing device 310 can perform secret sharing according to the target key to be backed up to generate multiple sub-keys, and then encrypt the multiple sub-keys separately to obtain multiple sub-key ciphertext data, and store the multiple sub-key ciphertext data in different storage devices; then, search for the sub-key ciphertext data corresponding to the target key from different storage devices, and verify the found sub-key ciphertext data. If the verification of the found sub-key ciphertext data is successful, it is determined that the multiple sub-key ciphertext data are successfully stored in different storage devices. Therefore, the target key is activated to perform encryption processing according to the activated target key. In this way, on the one hand, by storing multiple sub-key ciphertext data corresponding to the target key in different storage devices, not only the backup of the target key is achieved, avoiding the situation where the data security cannot be guaranteed due to the loss of the target key, but also the difficulty of restoring the target key based on the backup data is improved, the risk of backup data being leaked is reduced, the security of key backup is improved, and thus data security is improved; on the other hand, the sub-key ciphertext data stored in the storage device is verified to determine that multiple sub-key ciphertext data are successfully stored in different storage devices, and then the target key is activated, thereby avoiding the loss or error of sub-key ciphertext data during the backup process, resulting in the inability to restore the target key based on the sub-key ciphertext data stored in the storage device, further improving data security.

It should be noted that the data processing method provided in this embodiment can be applied to different fields. For example, in a transaction processing scenario based on blockchain technology, an asset owner can register in a blockchain network and obtain a private key and a public key for protecting the security of his assets. In the process of asset trading, the transaction request can include signature data generated based on the private key of the asset owner. After receiving the transaction request, the blockchain node first verifies the signature data included in the transaction request based on the public key of the asset owner. After successful verification, the asset owner's assets are traded according to the transaction request. In order to avoid the loss of the asset owner's private key, the private key of the asset owner can be used as a backup key, thereby backing up the private key of the asset owner, improving the security of the private key of the asset owner, improving the security of the asset, and then improving the security of transaction processing based on blockchain technology. Optionally, the data processing device 310 can be a blockchain node in the blockchain network or a non-blockchain node.

It should be noted that this application involves data related to the user object, such as the keys to be backed up. When the method of this application is applied to specific products or technologies, the permission or consent of the user object must be obtained, and the extraction, use and processing of the relevant data must comply with local security standards and local laws and regulations.

See Figure 4, which is a flow chart of a data processing method shown in an exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Figure 3, and can be executed by the data processing device 310 in the implementation environment shown in Figure 3.

As shown in FIG. 4 , in an exemplary embodiment, the data processing method may include: Step S410 to Step S440, which are described in detail as follows:

Step S410: secret sharing is performed according to the target key to be backed up to generate multiple sub-keys.

It should be noted that the target key refers to any key that needs to be backed up, that is, the key to be backed up, and its specific content can be flexibly set according to actual needs. For example, when applied to payment scenarios, the target key can be the user's payment password; when applied to transaction scenarios, asset owners can register on the trading platform to obtain a key pair, and the target key can be the private key in the key pair, wherein the key pair can be a key pair generated based on the elliptic curve cryptography algorithm (Elliptic Curve Cryptosystems, ECC). In the elliptic curve cryptography algorithm, assuming that the elliptic curve point generator is G, the public key and private key in the key pair have the following relationship: Q=P*G, wherein P is the private key and Q is the public key.

Secret sharing is a cryptographic technology that divides and stores secrets. The main idea is to split the secret into multiple shares in an appropriate way and store the multiple shares separately, so that the secret information cannot be restored based on a single share, thereby avoiding excessive concentration of secrets and achieving the purpose of dispersing risks and tolerating intrusions.

In order to avoid the backup key from being leaked, after obtaining the target key to be backed up, the target key is not directly backed up and stored, but the target key is first secretly shared to obtain multiple shares corresponding to the target key, each share is used as a subkey of the target key, thereby obtaining multiple subkeys corresponding to the target key. The number of subkeys can be flexibly set according to actual needs, and optionally, the number of subkeys can be set according to the security level corresponding to the target key, wherein the security level corresponding to the target key can be positively correlated with the number of subkeys, that is, the higher the security level corresponding to the target key, the more subkeys there are.

Among them, the specific method of performing secret sharing according to the target key to be backed up to generate multiple subkeys can be flexibly set according to actual needs. In one example, multiple subkeys can be generated according to the target key, so that after the generated multiple subkeys are operated by a specified operation method, the obtained values match the target key, wherein the specified operation method includes but is not limited to addition operation, multiplication operation, etc. In another example, the Shamir secret sharing algorithm can be used to process the target key to obtain multiple subkeys, wherein the Shamir secret sharing algorithm is a (t, w) threshold key sharing scheme, in which the secret is split into w shares, and under the condition of obtaining at least t shares, the secret can be restored according to the obtained shares, wherein w and t are integers greater than 1, and w is greater than or equal to t, and t is a threshold value, thereby improving the disaster recovery capability of key backup.

Step S420: encrypt the multiple subkeys respectively to obtain multiple subkey ciphertext data, and store the multiple subkey ciphertext data in different storage devices.

In order to further improve the security of the subkey, after generating multiple subkeys corresponding to the target key according to the secret sharing technology, each subkey can be encrypted to obtain the subkey ciphertext data corresponding to each subkey, thereby obtaining multiple subkey ciphertext data corresponding to the target key (wherein one subkey ciphertext data corresponds to one subkey). Among them, the encryption algorithm used to encrypt the subkey can be flexibly set according to actual needs, including but not limited to symmetric encryption algorithms and asymmetric encryption algorithms, and the asymmetric key algorithm includes but is not limited to elliptic curve encryption algorithms, such as SM2 encryption algorithms, etc. The encryption keys corresponding to different subkeys can be the same or different. For example, assuming that subkey 1 and subkey 2 are generated according to the target key, the encryption key corresponding to subkey 1 can be the same as the encryption key corresponding to subkey 2, or, in order to further improve the anti-attack capability of key backup, the encryption key corresponding to subkey 1 can be different from the encryption key corresponding to subkey 2. Optionally, the encryption keys corresponding to multiple subkeys can be the same or different, that is, the same encryption key can be used to encrypt multiple subkeys of the target key, or different encryption keys can be used to encrypt multiple subkeys of the target key.

After obtaining multiple subkey ciphertext data corresponding to the target key, in order to improve the security of the backup data, the multiple subkey ciphertext data corresponding to the target key can be stored in different storage devices. That is to say, only part of the backup data of the target key is stored in a single storage device. For example, assuming that subkey 1 and subkey 2 are generated according to the target key, the ciphertext data of subkey 1 can be stored in storage device 1, and the ciphertext data of subkey 2 can be stored in subkey 2, so that a single storage device cannot restore the target key according to the subkey ciphertext data stored in itself. In addition, if an attacker needs to restore the target key according to the backup data, he not only needs to attack multiple storage devices to obtain multiple subkey ciphertext data corresponding to the target key, but also needs to obtain the decryption key corresponding to the subkey ciphertext data, thereby increasing the difficulty of restoring the target key according to the backup data of the target key, improving the anti-attack capability of the key backup, and thus improving the security of the key backup.

Optionally, in order to further improve the security of key backup, multiple subkey ciphertext data can be stored in storage devices deployed in different areas. That is to say, the storage devices storing subkey ciphertext data are deployed in different areas. For example, assuming that subkey 1 and subkey 2 are generated according to the target key, the ciphertext data of subkey 1 can be stored in storage device 1 in area 1, and the ciphertext data of subkey 2 can be stored in storage device 2 in area 2, thereby further improving the anti-attack capability of key backup through isolation of geographical areas and devices.

Optionally, different storage devices may be randomly selected from a plurality of storage devices, or may be selected from a plurality of storage devices according to a device selection instruction, wherein the device selection instruction may be manually triggered, that is, the user may choose in which storage devices to store the plurality of sub-key ciphertext data corresponding to the target key.

Step S430, searching for subkey ciphertext data corresponding to the target key from different storage devices, and verifying the found subkey ciphertext data.

In order to ensure that the subkey ciphertext data corresponding to the target key stored in the storage device is correct and complete, so that the target key can be restored from the subkey ciphertext data corresponding to the target key stored in the storage device, after storing multiple subkey ciphertext data corresponding to the target key in different storage devices, the subkey ciphertext data corresponding to the target key can be searched from these storage devices, and the searched subkey ciphertext data can be verified. The verification method can be flexibly set according to actual needs.

Step S440: If the verification of the found subkey ciphertext data is successful, it is determined that the multiple subkey ciphertext data are successfully stored in different storage devices, and the target key is activated to perform encryption processing according to the activated target key.

If the verification of the subkey ciphertext data corresponding to the target key found from the storage device is successful, it indicates that the subkey ciphertext data of the target key stored in the storage device is correct and complete, and it is determined that multiple subkey ciphertext data are successfully stored in different storage devices. Therefore, the target key is activated, so that encryption processing can be performed according to the activated target key. Among them, the specific method of encryption processing according to the activated target key can be flexibly set according to actual needs. For example, if the target key is used as a payment password in a payment scenario, payment can be made based on the target key only after the target key is activated.

Optionally, if the verification of the subkey ciphertext data corresponding to the target key found in the storage device fails, the subkey ciphertext data corresponding to the target key stored in the storage device can be deleted, and the target key can be backed up again. In one example, in the process of backing up the target key again, the multiple subkey ciphertext data corresponding to the target key can be stored again in different storage devices, and the process goes to step S430, so that the subkey ciphertext data corresponding to the target key does not need to be generated again during the back-up process, thereby saving resources; in another example, in the process of backing up the target key again, the process can also go to step S410 to regenerate multiple subkeys corresponding to the target key, and re-encrypt, store, and verify the process. In order to improve the success rate of the re-backup, after the verification fails, you can wait for a preset period of time and then back up the target key again.

In the embodiment shown in FIG4 , on the one hand, in the process of backing up the target key, a secret is first shared based on the target key to generate multiple subkeys, and then the multiple subkeys are encrypted respectively, and the encrypted multiple subkey ciphertext data are stored in different storage devices, thereby realizing the backup of the target key. When it is necessary to restore the target key based on the backup data corresponding to the target key, it is necessary to first obtain the multiple subkey ciphertext data corresponding to the target key from multiple storage devices, decrypt the obtained subkey ciphertext data to obtain the subkey plaintext, and then restore the target key based on the subkey plaintext, thereby increasing the difficulty of restoring the target key based on the backup data of the target key and reducing the risk of backup data being leaked. If an attacker needs to restore the target key based on the backup data of the target key, he not only needs to attack multiple storage devices to obtain multiple subkey ciphertext data corresponding to the target key, but also needs to attack to obtain the decryption key of the subkey ciphertext data, thereby increasing the difficulty of the attack, thereby improving the anti-attack capability of the key backup, and improving the security of the key backup; on the other hand, after verifying the subkey ciphertext data stored in the storage device to determine that multiple subkey ciphertext data are successfully stored in different storage devices, the target key is activated, thereby avoiding the loss or error of the subkey ciphertext data during the backup process, resulting in the inability to restore the target key based on the subkey ciphertext data stored in the storage device, further improving data security.

In an exemplary embodiment, referring to Fig. 5, Fig. 5 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG5 , the data processing method may include: steps S510 to S520, and steps S420 to S440, wherein steps S510 to S520 are described in detail as follows:

Step S510, generating multiple numbers according to the target key; wherein the sum of the multiple numbers matches the target key.

In order to generate multiple subkeys corresponding to the target key so that the target key cannot be restored based on a single subkey, multiple numbers can be generated based on the target key so that the sum of the multiple numbers matches the target key, that is, after adding the generated multiple numbers, the value obtained matches the target key. Among them, the sum of the multiple numbers matching the target key can mean that the sum of the multiple numbers is equal to the target key. In order to improve security, there are different numbers in the multiple numbers. For example, in one example, assuming that the target key is 5, the multiple numbers generated based on the target key can be 11, -2, -4, respectively, so that the sum of the multiple numbers is 5. In this way, if only any one of 11, -2, and -4 is known, the target key 5 cannot be restored; in another example, assuming that the target key is 8, the multiple numbers generated based on the target key can be 2, 3, and 3, so that the sum of the multiple numbers is 8. In this way, if only any one of 2, 3, and 3 is known, the target key 8 cannot be restored.

Step S520, using each generated number as a subkey of the target key.

After generating the corresponding multiple numbers that match the target key, each generated number is used as a subkey of the target key, that is, after the multiple subkeys of the target key are added together, the value obtained matches the target key.

Optionally, under the condition that the sum of multiple subkeys of the target key matches the target key, when the target key is lost and needs to be restored based on backup data, multiple subkey ciphertext data corresponding to the target key can be first obtained from the storage device, and then the obtained subkey ciphertext data can be decrypted separately to obtain multiple sub-ciphertext plaintexts, and then the multiple subkey plaintexts are summed up, and the obtained value is used as the target key, thereby restoring the target key.

It should be noted that the specific implementation details of steps S420 to S440 shown in FIG. 5 can refer to steps S420 to S440 shown in FIG. 4 , which will not be repeated here.

In the embodiment shown in FIG5 , a plurality of numbers are first generated according to the target key, wherein the sum of the plurality of numbers matches the target key; and then each generated number is used as a subkey of the target key, so that the sum of the plurality of subkeys of the target key matches the target key. This not only makes it possible to achieve that the target key cannot be restored based on a single subkey, but also reduces the complexity of generating subkeys, improves the efficiency of generating subkeys and the efficiency of restoring the target key based on the subkeys.

In an exemplary embodiment, see Figure 6, which is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Figure 3, and can be executed by the data processing device 310 in the implementation environment shown in Figure 3.

As shown in FIG6 , the data processing method may include: steps S610 to S630, and steps S420 to S440, wherein steps S610 to S630 are described in detail as follows:

Step S610, generating a polynomial according to the target key; wherein, under the condition that the independent variable of the polynomial is a specified independent variable value, the dependent variable of the polynomial matches the target key.

In order to generate multiple subkeys corresponding to the target key so that the target key cannot be restored from a single subkey, a polynomial can be generated based on the target key. The polynomial contains independent variables, coefficients corresponding to the independent variables, constants and dependent variables. The value of the independent variable will affect the value of the dependent variable. For example, in the polynomial y=2x+3, x is the independent variable, 2 is the coefficient of the independent variable, 3 is the constant, y is the dependent variable, and the value of y changes with the value of x. In order to restore the target key based on the polynomial, the dependent variable of the polynomial can be matched with the target key under the condition that the independent variable of the polynomial is the specified independent variable value. The specified independent variable value can be flexibly set according to actual needs, for example, it can be 0, 1, 2, 3, etc. In an example, assuming that the specified independent variable value is 0 and the target key is 8, the generated polynomial can be y=5x+8, so that when x=0, y=8.

It should be noted that the specific form of the polynomial (including but not limited to the degree of the polynomial) can be flexibly set according to actual needs, wherein the degree of the polynomial refers to the highest degree of the independent variable in the polynomial. For example, in the polynomial y=a1*x^2+a2*x+a3, assuming that a1, a2, and a3 are constants, the degree of the polynomial r=2. In order to reduce the amount of data calculation, the degree of the polynomial can be 2, that is, the polynomial is a quadratic polynomial. In an example, assuming that the specified independent variable value is 1 and the target key is 11, the generated quadratic polynomial can be y=2*x^2+3*x+6, so that when x=1, y=11.

Step S620, obtaining multiple other independent variable values except the specified independent variable value, and calculating the dependent variable value corresponding to each other independent variable value according to the polynomial; wherein the number of other independent variable values is greater than the degree of the polynomial.

It should be noted that for a polynomial of degree r, at least (r+1) variable data combinations (x, y) need to be obtained, each variable data combination contains an independent variable value x and a dependent variable value y corresponding to the independent variable value, and the polynomial can be restored based on the (r+1) variable data combinations (x, y). For example, for a second-degree polynomial y=a1*x^2+a2*x+a3, at least three pairs of variable data combinations corresponding to the polynomial need to be obtained, and a1, a2, and a3 can be calculated based on these three pairs of variable data combinations, thereby restoring the second-degree polynomial. In an example, assuming that the second-degree polynomial is y=3*x^2+2*x+1, then without knowing that the coefficient of x^2 is 3, the coefficient of x is 2, and the constant is 1, the polynomial can be restored based on (x=1, y=6), (x=2, y=17), and (x=3, y=34).

Therefore, after generating a polynomial according to the target key, multiple other independent variable values in addition to the specified independent variable value can be obtained, and the dependent variable value corresponding to each other independent variable value can be calculated according to the generated polynomial, wherein, in order to be able to restore the polynomial according to the other independent variable values and the dependent variable values corresponding to the other independent variable values , the number of other independent variable values should be greater than or equal to the degree of the polynomial, that is, assuming that the number of other independent variable values is n and the degree of the polynomial is r, then n is greater than r, where n and r are both integers.

Step S630: Use the dependent variable value corresponding to each other independent variable value as a subkey of the target key.

After calculating the dependent variable value corresponding to each other independent variable value according to the polynomial, the dependent variable value corresponding to each other independent variable value is used as a subkey of the target key, so that the target key cannot be restored based on the subkey of a single target key. At the same time, since the subkey of the target key is the dependent variable value corresponding to other independent variable values calculated according to the polynomial, and the number of independent variable values is greater than the degree of the polynomial, the polynomial can be restored based on multiple subkeys corresponding to the target key and the independent variable values corresponding to the subkey, and the target key can be obtained based on the specified independent variable values and the restored polynomial.

It should be noted that step S610 to step S630 can be encapsulated as a Shamir secret sharing algorithm, whose threshold value t is r+1; w is the number n of other independent variable values, that is, the number of subkeys.

The specific implementation details of steps S420 to S440 shown in FIG. 6 may refer to steps S420 to S440 shown in FIG. 4 , and will not be described in detail here.

In the embodiment shown in FIG6 , a polynomial is first generated according to the target key, wherein the independent variable of the polynomial is a condition where the dependent variable of the polynomial matches the target key under the condition that the independent variable of the polynomial is a specified independent variable value; then, multiple other independent variable values except the specified independent variable value are obtained, and the dependent variable value corresponding to each other independent variable value is calculated according to the polynomial; wherein the number of other independent variable values is greater than the degree of the polynomial; and then the dependent variable value corresponding to each other independent variable value is used as a subkey of the target key, thereby realizing secret sharing for the target key, and by performing secret sharing in this manner, during the restoration process of the target key, the target key can be restored based on r+1 subkeys (where r is the degree of the polynomial), without obtaining all subkeys, thereby improving disaster recovery capability.

In an exemplary embodiment, referring to Fig. 7, Fig. 7 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 7 , the data processing method may include: steps S610 to S630, steps S420 to S440, and steps S710 to S740, wherein steps S710 to S740 are described in detail as follows:

Step S710: If the target key is lost, a specified number of subkey ciphertext data are obtained from different storage devices; wherein the specified number is greater than the degree of the polynomial.

If the target key is lost, in order to restore the target key, the polynomial needs to be restored first. For an r-degree polynomial, the polynomial can be restored according to r+1 pairs of variable data combinations. Therefore, under the condition that the target key is lost, the specified number of subkey ciphertext data corresponding to the target key can be obtained from the storage device storing the subkey ciphertext data corresponding to the target key. The specified number needs to be greater than the degree r of the polynomial, that is, the minimum value of the specified number is r+1.

Step S720: decrypt each acquired subkey ciphertext data to obtain the dependent variable value contained in each subkey ciphertext data.

After obtaining the specified number of subkey ciphertext data corresponding to the target key, each subkey ciphertext data can be decrypted to obtain the dependent variable value contained in the subkey ciphertext data, thereby obtaining the specified number of dependent variable values.

Step S730, restoring the polynomial according to the independent variable values corresponding to the dependent variable values contained in the specified number of subkey ciphertext data.

After obtaining a specified number of dependent variable values, a polynomial can be restored based on the specified number of dependent variable values and the independent variable values corresponding to the dependent variable values, that is, a polynomial is restored based on a specified number of variable data combinations.

Step S740, calculating the dependent variable value corresponding to the specified independent variable value according to the restored polynomial, and using the calculated dependent variable value corresponding to the specified independent variable value as the target key.

After the polynomial is restored, the corresponding dependent variable value can be calculated based on the restored polynomial under the condition that the independent variable is the specified independent variable value, so that the calculated dependent variable value is used as the target key to complete the restoration of the target key.

It should be noted that the specific implementation details of steps S420-S440 shown in Figure 7 can refer to steps S420-S440 shown in Figure 4, and the specific implementation details of steps S610-S630 shown in Figure 7 can refer to steps S610-S630 shown in Figure 6, which will not be repeated here.

In the embodiment shown in Figure 7, in the process of restoring the target key, it is only necessary to obtain a specified number of sub-key ciphertext data and decrypt the ciphertext data, wherein the specified number is greater than the polynomial degree, and there is no need to obtain the ciphertext data of all sub-keys, thereby improving disaster recovery capabilities.

In an exemplary embodiment, referring to Fig. 8, Fig. 8 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG8 , under the condition that each subkey ciphertext data contains signature data generated according to the encryption key corresponding to each subkey ciphertext data, the data processing method may include: steps S410 to S420, steps S810 to S830, and step S440, wherein steps S810 to S830 are described in detail as follows:

Step S810, searching for subkey ciphertext data corresponding to the target key from different storage devices.

In order to verify the subkey ciphertext data corresponding to the target key stored in the storage device, the subkey ciphertext data corresponding to the target key may be first searched from the storage device.

Step S820: extract signature data from the found subkey ciphertext data.

In the process of encrypting the subkey of the target key, for each subkey, the subkey is first encrypted by the encryption key to obtain the subkey ciphertext, and the subkey ciphertext is signed according to the encryption key, and the signed subkey ciphertext is used as the subkey ciphertext data corresponding to the subkey. That is to say, each subkey ciphertext data contains the corresponding subkey ciphertext and signature data.

Therefore, after finding out the subkey ciphertext data corresponding to the target key from the storage device, the signature data can be extracted from the found subkey ciphertext data.

Step S830, verifying the extracted signature data according to the decryption key corresponding to the found subkey ciphertext data.

Since the signature data is generated based on the encryption key corresponding to the subkey ciphertext data, the signature data extracted from the subkey ciphertext data can be verified based on the decryption key corresponding to the subkey ciphertext data. If the verification fails, it indicates that an error occurs in the subkey ciphertext data of the target key stored in the storage device; if the verification succeeds, it indicates that the subkey ciphertext data of the target key stored in the storage device is correct.

Optionally, in the process of encrypting the subkey of the target key, a symmetric encryption algorithm and an asymmetric encryption algorithm may be used. If a symmetric encryption algorithm is used, the encryption key corresponding to the subkey ciphertext data is the same as the decryption key; if an asymmetric encryption algorithm is used, the encryption key corresponding to the subkey ciphertext data is different from the decryption key, and the encryption key and the decryption key are a pair of key pairs. In one example, the encryption key may be a public key in the key pair, and the decryption key may be a private key in the key pair, that is, the subkey of the target key is encrypted using the public key in the key pair, and the subkey ciphertext data is signed using the public key in the key pair. During the verification process, the signature data is verified using the private key in the key pair; or, in another example, the encryption key may be a private key in the key pair, and the decryption key may be a public key in the key pair, that is, the subkey of the target key is encrypted using the private key in the key pair, and the subkey ciphertext data is signed using the private key in the key pair. During the verification process, the signature data is verified using the public key in the key pair.

It should be noted that the specific implementation details of steps S410 to S420 and step S440 shown in FIG. 8 can refer to steps S410 to S420 and step S440 shown in FIG. 4 , and will not be repeated here.

In the embodiment shown in FIG. 8 , under the condition that each subkey ciphertext data includes signature data generated according to the encryption key corresponding to each subkey ciphertext data, the signature data included in the subkey ciphertext data stored in the storage device is verified according to the decryption key corresponding to the subkey ciphertext data. This not only ensures that the subkey ciphertext data stored in the storage device is correct, but also can restore the target key based on the subkey ciphertext data stored in the storage device, thereby improving data security and reducing verification complexity.

See Figure 9, which is a flow chart of a data processing method shown in an exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Figure 3, and can be executed by the data processing device 310 in the implementation environment shown in Figure 3.

As shown in FIG9 , under the condition that each subkey ciphertext data contains a subkey ciphertext and a hash value corresponding to the subkey ciphertext, the data processing method may include: steps S410 to S420, steps S910 to S940, and step S440, which are described in detail as follows:

Step S910, searching for subkey ciphertext data corresponding to the target key from different storage devices.

In order to verify the subkey ciphertext data corresponding to the target key stored in the storage device, the subkey ciphertext data corresponding to the target key may be first searched from the storage device.

Step S920: extract the subkey ciphertext and the hash value from the found subkey ciphertext data, and perform a hash operation on the extracted subkey ciphertext.

It should be noted that in the process of encrypting the subkey of the target key, for each subkey, the subkey is first encrypted by the encryption key to obtain the subkey ciphertext, and the subkey ciphertext is hashed to obtain the hash value of the subkey ciphertext (i.e., hash value), and the subkey ciphertext and the corresponding hash value are added to the subkey ciphertext data corresponding to the subkey, that is, each subkey ciphertext data contains the corresponding subkey ciphertext and the hash value of the subkey ciphertext.

Therefore, after finding the subkey ciphertext data corresponding to the target key from the storage device, the subkey ciphertext and the hash value corresponding to the subkey ciphertext can be extracted from the found subkey ciphertext data, and then, a hash operation is performed on the extracted subkey ciphertext to obtain the hash value corresponding to the extracted subkey ciphertext.

S930: Compare the hash value obtained by the hash operation with the extracted hash value.

In order to verify whether the subkey ciphertext data corresponding to the target key stored in the storage device has been tampered with, after finding the subkey ciphertext data corresponding to the target key from the storage device, the hash value extracted from the subkey ciphertext data can be compared with the hash value obtained by performing a hash operation on the subkey ciphertext in the subkey ciphertext data.

S940: If the comparison result indicates that the hash value obtained by the hash operation matches the extracted hash value, it is determined that the verification of the found subkey ciphertext data is successful.

If the comparison result indicates that the hash value obtained by the hash operation matches the extracted hash value, it means that the subkey ciphertext data of the target key stored in the storage device has not been tampered with, and therefore, it is determined that the verification of the subkey ciphertext data of the target key stored in the storage device is successful; if the two do not match, it means that the subkey ciphertext data of the target key stored in the storage device has been tampered with, and therefore, it is determined that the verification of the subkey ciphertext data of the target key stored in the storage device has failed.

Optionally, in other embodiments, in the process of encrypting the subkeys of the target key, for each subkey, after performing a hash operation on the subkey ciphertext to obtain a hash value, the obtained hash value can be stored in a designated storage area; in the process of verifying the subkey ciphertext data stored in the storage device, after finding the subkey ciphertext data of the target key from the storage device, the hash value corresponding to the subkey ciphertext contained in the found subkey ciphertext data is compared with the hash value corresponding to the subkey ciphertext contained in the designated storage area; if the two match, it indicates that the subkey ciphertext data of the target key stored in the storage device has not been tampered with, and therefore, it is determined that the verification of the subkey ciphertext data of the target key stored in the storage device is successful; if the two do not match, it indicates that the subkey ciphertext data of the target key stored in the storage device has been tampered with, and therefore, it is determined that the verification of the subkey ciphertext data of the target key stored in the storage device has failed.

It should be noted that the specific implementation details of steps S410-S420 and step S440 shown in FIG. 9 can refer to steps S410-S420 and step S440 shown in FIG. 4 , and will not be repeated here.

In the embodiment shown in FIG. 9 , under the condition that each subkey ciphertext data contains a subkey ciphertext and a hash value corresponding to the subkey ciphertext, the hash value in the subkey ciphertext data contained in the storage device is compared with the hash value obtained by performing a hash operation on the subkey ciphertext in the subkey ciphertext data, thereby verifying whether the subkey ciphertext data stored in the storage device has been tampered with based on the comparison result. This not only ensures that the subkey ciphertext data stored in the storage device is correct, but also can restore the target key based on the subkey ciphertext data stored in the storage device, thereby improving data security and preventing subkey leakage.

In an exemplary embodiment, referring to Fig. 10, Fig. 10 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 10 , the data processing method may include: steps S410 to S440, and steps S1010 to S1040, wherein steps S1010 to S1040 are described in detail as follows:

Step S1010, obtaining storage durations of multiple subkey ciphertext data in different storage devices.

After storing multiple subkey ciphertext data of the target key in different storage devices, the storage duration of the subkey ciphertext data can be detected.

Step S1020: If the storage time exceeds the set time threshold, the subkey ciphertext data corresponding to the target key is deleted from different storage devices, and secret sharing is performed again based on the target key to generate multiple new subkeys.

Among them, the storage duration of the subkey ciphertext data is positively correlated with the risk of the subkey ciphertext data being leaked. Therefore, in order to reduce the probability of the subkey ciphertext data being leaked, if it is detected that the storage duration of the subkey ciphertext data exceeds the set duration threshold, the backup data of the target key can be updated. During the update process, the subkey ciphertext data corresponding to the target key is deleted from the storage device, and secret sharing is performed again based on the target key to generate multiple new subkeys.

The duration threshold may be flexibly set according to actual needs, for example, it may be set to 10 minutes, 20 minutes, etc.

Step S1030, encrypting the multiple new subkeys respectively to obtain multiple new subkey ciphertext data.

After generating multiple new subkeys corresponding to the target key, the multiple new subkeys are encrypted respectively to obtain multiple new subkey ciphertext data. The specific processing method is similar to the above step S420 and will not be repeated here.

Step S1040: storing multiple new subkey ciphertext data in different storage devices.

After obtaining the multiple new subkey ciphertext data, the multiple new subkey ciphertext data may be stored in different storage devices.

Optionally, in order to ensure that the new subkey ciphertext data is successfully stored in the storage device, the new subkey ciphertext data corresponding to the target key can be searched from the storage device, and the found new subkey ciphertext data can be verified. After the verification is successful, it is determined that the target key backup is completed.

In order to ensure that backup data of the target key always exists, after the new subkey ciphertext data is successfully stored in the storage device, the subkey ciphertext data corresponding to the target key stored in the storage device during the previous backup process can be deleted.

It should be noted that the specific implementation details of steps S410 to S440 shown in FIG. 10 may refer to steps S410 to S440 shown in FIG. 4 , and will not be described in detail here.

In the embodiment shown in FIG. 10 , the backup data of the target key is updated at set time thresholds, thereby improving the security of key backup.

In an exemplary embodiment, referring to Fig. 11, Fig. 11 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 11 , the data processing method may include: steps S1110 to S1120, and steps S420 to S440, wherein steps S1110 to S1120 are described in detail as follows:

Step S1110, generate a random number and add the random number to the target key.

In order to further enhance the anti-attack capability of key backup, during the process of backing up the target key, a random number may be generated and added to the target key.

Among them, the specific method of adding random numbers to the target key can be flexibly set according to actual needs. In an optional example, the random number can be inserted into a specified position of the character sequence corresponding to the target key, and the specified position can be the head, tail, or middle position of the sequence. For example, assuming that the target key is 234567 and the random number is 111, the random number can be inserted into the head of the target key to obtain 111234567, or the random number can be inserted into the tail of the target key to obtain 234567111, or the random number can be inserted into the middle position of the target key to obtain 234111567; in another example, the random number and the target key can be operated by a set operation method, and the obtained value is used as the target key after adding the random number, wherein the set operation includes but is not limited to addition operation, multiplication operation, etc. For example, assuming that the target key is 19 and the random number is 10, if the set operation method is addition operation, the target key after adding the random number is 29.

Step S1120, key sharing is performed according to the target key after adding the random number to generate multiple subkeys.

After a random number is added to the target key, key sharing can be performed based on the target key to which the random number is added to generate multiple subkeys.

It should be noted that the specific implementation details of steps S420 to S440 shown in FIG. 11 can refer to steps S420 to S440 shown in FIG. 4 , which will not be repeated here.

In the embodiment shown in FIG11 , a random number is first added to the target key, and then key sharing is performed based on the target key with the added random number to generate multiple sub-keys. As a result, when an attacker is restoring the target key based on the backup data of the target key, he not only needs to obtain the ciphertext data of the sub-key corresponding to the target key and the decryption key corresponding to the ciphertext data, but also needs to obtain the random number added in the target key, thereby further increasing the difficulty of the attack, and improving the anti-attack capability of the key backup and the security of the key backup.

In an exemplary embodiment, referring to Fig. 12, Fig. 12 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 12 , the data processing method may include: step S410, step S1210 to step S1230, and step S430 to step S440, wherein steps S1210 to step S1230 are described in detail as follows:

Step S1210, encrypt multiple subkeys respectively to obtain multiple subkey ciphertext data.

After obtaining multiple subkeys corresponding to the target key, the multiple subkeys can be encrypted separately to obtain multiple subkey ciphertext data.

Step S1220, generating interference data, and adding the interference data to the ciphertext data set; wherein the ciphertext data set includes a plurality of subkey ciphertext data.

After encrypting the multiple subkeys corresponding to the target key respectively, a ciphertext data set is obtained, wherein the ciphertext data set includes multiple subkey ciphertext data.

In order to further improve the anti-attack capability of key backup, interference data can be generated and added to the ciphertext data set. For example, assuming that the ciphertext data set corresponding to the target key contains 11, 14, and 18, the interference data 1000 can be added to the ciphertext data, and the resulting ciphertext data set contains 11, 14, 18, and 1000.

Step S1230: storing the plurality of subkey ciphertext data and interference data contained in the ciphertext data set in different storage devices.

After obtaining the ciphertext data set containing the interference data, the data contained in the ciphertext data set is stored in different storage devices. In this way, if the attacker needs to restore the target key based on the backup data, he not only needs to attack multiple storage devices to obtain the backup data, but also needs to filter out the interference data from the obtained backup data, thereby further improving the key backup's anti-attack capability.

It should be noted that the specific implementation details of step S410 and step S430-step S440 shown in Figure 12 can refer to step S410 and step S430-step S440 shown in Figure 4, and will not be repeated here.

In the embodiment shown in FIG12 , interference data is generated and added to a ciphertext data set, wherein the ciphertext data set includes a plurality of subkey ciphertext data; and the plurality of subkey ciphertext data and the interference data included in the ciphertext data set are stored in different storage devices, thereby improving the anti-attack capability and security of the key backup.

In an exemplary embodiment, referring to Fig. 13, Fig. 13 is a flow chart of a data processing method shown in an exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 13 , the data processing method may include: steps S410 to S440, and steps S1310 to S1320, wherein steps S1310 to S1320 are described in detail as follows:

Step S1310, obtaining the decryption key corresponding to each subkey ciphertext data.

In order to further enhance the anti-attack capability of key backup, the decryption key corresponding to each subkey ciphertext data of the target key can be obtained.

Step S1320: store the decryption key in a trusted execution environment or a storage device that is not connected to the network.

After obtaining the decryption key, the decryption key can be stored in a trusted execution environment. The trusted execution environment (TEE) implements secure computing based on memory isolation based on a hardware-secure CPU, and can complete privacy-protected computing while ensuring computing efficiency. Based on the security of the trusted execution environment, the security of the decryption key is improved, thereby improving the security of the backup data.

Alternatively, after obtaining the decryption key, the decryption key can be stored in a storage device that is not connected to the network (i.e., a storage device that is not connected to the network), that is, the decryption key is cold stored, thereby improving the security of the decryption key through network isolation.

Optionally, under the condition that the decryption key is stored in a trusted execution environment or a storage device that is not connected to the network, in the process of restoring the target key, after obtaining the subkey ciphertext data of the target key from the storage device, the subkey ciphertext data can be decrypted in the trusted execution environment or the storage device that is not connected to the network by using the decryption key stored therein, and then, the target key is restored based on the decrypted subkey plaintext, so that the decryption key only exists in the trusted execution environment or the storage device that is not connected to the network, thereby reducing the risk of decryption key leakage.

It should be noted that the specific implementation details of steps S410 to S440 shown in FIG. 13 can refer to steps S410 to S440 shown in FIG. 4 , which will not be repeated here.

In the embodiment shown in FIG. 13 , the decryption key corresponding to the subkey ciphertext data of the target key is stored in a trusted execution environment or a storage device not connected to the network, thereby improving the security of the decryption key and further improving the security of the key backup.

In an exemplary embodiment, referring to Fig. 14, Fig. 14 is a flow chart of a data processing method shown in another exemplary embodiment of the present application. The method can be applied to the implementation environment shown in Fig. 3, and can be executed by the data processing device 310 in the implementation environment shown in Fig. 3.

As shown in FIG. 14 , the data processing method may include: steps S410 to S440, and steps S1410 to S1420, wherein steps S1410 to S1420 are described in detail as follows:

Step S1410, obtaining the decryption key corresponding to each subkey ciphertext data, and performing secret sharing based on the decryption key to generate multiple subkeys.

In order to further improve the anti-attack capability of key backup, the decryption key corresponding to the subkey ciphertext data of the target key can be first obtained, and secret sharing is performed based on the decryption key to generate multiple subkeys corresponding to the decryption key. The specific method of performing secret sharing based on the decryption key to generate multiple subkeys is similar to the aforementioned step S410, which will not be repeated here.

Step S1420: Store multiple subkeys corresponding to the decryption key in different storage devices.

After obtaining multiple subkeys corresponding to the decryption key, the multiple subkeys corresponding to the decryption key can be stored in different storage devices. In this way, if an attacker needs to restore the target key based on the backup data, he not only needs to attack multiple storage devices to obtain the multiple subkey ciphertext data corresponding to the target key, but also needs to attack multiple storage devices to obtain the subkeys of the decryption key corresponding to the subkey ciphertext data to restore the decryption key, thereby further improving the key backup's anti-attack capability.

Optionally, after encrypting the multiple subkeys corresponding to the decryption key to obtain the ciphertext data corresponding to the multiple subkeys of the decryption key, the ciphertext data corresponding to the multiple subkeys of the decryption key are stored in different storage devices.

It should be noted that the specific implementation details of steps S410 to S440 shown in FIG. 14 can refer to steps S410 to S440 shown in FIG. 4 , which will not be repeated here.

In the embodiment shown in FIG. 14 , after a plurality of sub-keys are generated by secretly sharing the decryption key corresponding to the sub-key ciphertext data of the target key, the plurality of sub-keys corresponding to the decryption key are stored in different storage devices, thereby improving the security of the decryption key and further improving the security of the key backup.

In an exemplary embodiment, the data processing method includes a key backup process and a key restoration process, wherein, referring to FIG. 15 , FIG. 15 is a flowchart of a key backup process shown in an exemplary embodiment of the present application. As shown in FIG. 15 , the key backup process includes steps S1501 to S1508, which are described in detail as follows:

Step S1501, after the key management module generates a key pair, the key backup task is started.

It should be noted that the key management module is used to manage keys, including but not limited to generating key pairs. Among them, the private key in the key pair contained in the key management module can be used to sign transactions, thereby proving the output right of the transaction. Optionally, the key management module can be deployed in the blockchain network.

After generating a key pair, the key management module can start a key backup task to back up the generated key pair.

Step S1502: Use the private key in the generated key pair as the target key, and divide the target key through a secret sharing algorithm to obtain multiple subkeys corresponding to the target key.

After the key backup task is started, during the execution of the key backup task, the private key in the generated key pair is used as the target key to be backed up, and the target key is split through a secret sharing algorithm to obtain multiple sub-keys corresponding to the target key.

Optionally, the Shamir secret sharing algorithm may be used.

Step S1503: Generate an encryption key pair, and encrypt multiple subkeys corresponding to the target key based on the public key in the encryption key pair to obtain a subkey ciphertext corresponding to each subkey.

Optionally, an encryption key pair may be generated using the SM2 algorithm, and the public key in the encryption key pair is used to encrypt multiple subkeys corresponding to the target key to obtain a subkey ciphertext corresponding to each subkey, thereby obtaining multiple subkey ciphertexts.

Step S1504: Sign each subkey ciphertext based on the public key in the encryption key pair.

Optionally, each subkey ciphertext may be signed using the public key in the encryption key pair to obtain signature data corresponding to each subkey ciphertext.

Step S1505, performing a hash operation on each subkey ciphertext to obtain a hash value corresponding to each subkey ciphertext, and storing the hash value corresponding to each subkey ciphertext.

After performing a hash operation on the ciphertext data of each subkey to obtain a hash value corresponding to the ciphertext data of each subkey, the key management module may store the hash value corresponding to the ciphertext data of each subkey in a designated storage area.

Step S1506, storing multiple subkey ciphertext data of the target key in different storage devices, and cold storing the private key in the encryption key pair; each subkey ciphertext data includes a subkey ciphertext corresponding to the target key and a hash value corresponding to the subkey ciphertext.

Optionally, for each subkey of the target key, the subkey ciphertext and the hash value are used as the subkey ciphertext data corresponding to the subkey, thereby obtaining multiple subkey ciphertext data of the target key, and storing the multiple subkey ciphertext data in different storage devices. In order to improve security, the subkey ciphertext data can be sent to the storage device via the Secure Sockets Layer (SSL).

In order to improve security, the private key in the encryption key pair can be cold stored, that is, the private key in the encryption key pair can be stored in a storage device that is not connected to the Internet, so as to ensure that only the holder of the storage device that is not connected to the Internet can restore the target key based on the backup data of the target key.

It should be noted that storage devices include but are not limited to cloud servers with storage functions, personal computers (PCs), secret key systems, asset custody service providers, etc. For example, in one example, as shown in Figure 16, the key management module uses a secret sharing algorithm to process the target key to obtain subkeys k1, k2, and k3, and then uses the public key in the encryption key pair to encrypt k1, k2, and k3 respectively to obtain Enc(k1), Enc(k2), and Enc(k3). Then, Enc(k1), Enc(k2), and Enc(k3) are stored in different storage devices, and the private key in the encryption key pair is cold stored. Among them, the storage devices include cloud servers, personal computers, secret key systems, and asset custody service providers.

In an optional implementation, the key management module may store the subkey ciphertext data in a storage device deployed with a key escrow service, wherein the key escrow service is used to store the received subkey ciphertext data. Optionally, the key escrow service may provide a unified application programming interface (Application Programming Interface), so that the key management module may establish a connection with the storage device through the unified application programming interface, facilitating the interaction between the key management module and the storage device. For example, as shown in FIG17 , the storage device includes a cloud service provider deployed with a key escrow service, and Enc(k1), Enc(k2), and Enc(k3) may be stored in different cloud service providers.

In another optional implementation, different key hosting service providers (storage devices deployed with key hosting services) provide different key hosting methods, as shown in FIG. 18 . In key hosting service provider 1, the subkey ciphertext data is stored in a trusted execution environment, and in key hosting service provider 2, the subkey ciphertext data is stored in a key system. Of course, the subkey ciphertext data may also be stored through other key hosting methods.

Step S1507, verifying the subkey ciphertext data stored in the storage device.

Optionally, the signature of the subkey ciphertext data stored in the storage device can be verified based on the private key in the encryption key pair, and the hash value contained in the subkey ciphertext data stored in the storage device can be verified based on the hash value stored in the designated storage area. After both the signature and the hash value are successfully verified, it is determined that the verification of the subkey ciphertext data stored in the storage device is successful.

Step S1508: If the verification is successful, activate the target key.

After the verification is successful, it indicates that the target key is backed up successfully. Therefore, the target key can be activated to perform signature transactions based on the target key.

After the target key is successfully backed up, if the target key is lost, it is necessary to restore the target key based on the backup data, wherein, see FIG. 19 , FIG. 19 is a flowchart of a key restoration process shown in an exemplary embodiment of the present application. As shown in FIG. 19 , the key restoration process includes steps S1901 to S1903, which are described in detail as follows:

Step S1901: if the target key is lost, obtain a specified number of subkey ciphertext data from the storage device.

Since the Shamir secret sharing algorithm is used to process the target key to obtain the subkey, in the process of restoring the target key based on the subkey, it is only necessary to obtain a specified number of subkey ciphertext data, where the specified number is greater than or equal to the threshold value corresponding to the Shamir secret sharing algorithm.

Step S1902: In a storage device corresponding to the cold storage, the obtained subkey ciphertext data is decrypted based on the public key in the encryption key pair to obtain a specified number of subkey plaintexts.

Since the public key in the encryption key pair is stored in cold storage, in order to improve security, the subkey ciphertext data obtained based on the public key in the encryption key pair can be decrypted in the storage device corresponding to the cold storage to obtain a specified number of subkey plaintexts, thereby avoiding the decryption key corresponding to the subkey ciphertext data being extracted from the storage device corresponding to the cold storage, resulting in leakage.

Step S1903, restore the target key according to the specified number of subkey plaintexts.

After obtaining a specified number of subkey plaintexts, the target key can be restored based on the specified number of subkey plaintexts. For example, in one example, as shown in FIG20, after obtaining subkey ciphertext data Enc(k1) and Enc(k2) from different storage devices, Enc(k1) and Enc(k2) can be transferred to the storage device corresponding to the cold storage, and in the storage device corresponding to the cold storage, the public key pair Enc(k1) and Enc(k2) in the encryption key pair are used to decrypt the subkey plaintexts k1 and k2, respectively, and restore based on k1 and k2.

In the key backup process and key restoration process shown in Figures 15 and 19, the key is split into multiple sub-keys and secure distributed backup of the key is achieved by backing up the sub-keys. In addition, any storage device only has sub-key ciphertext data, which avoids the single-point security problem of key backup. In addition, the key is split through the Shamir secret sharing algorithm, so that the key can be restored by obtaining only sub-keys greater than or equal to the corresponding threshold value of the Shamir secret sharing algorithm, without obtaining all sub-keys, thereby improving the disaster recovery capability of the key backup; at the same time, the storage device is connected to the key management module, which improves the usability of the key management module.

Referring to FIG. 21 , FIG. 21 is a block diagram of a data processing device shown in an exemplary embodiment of the present application. As shown in FIG. 21 , the device includes:

A generating module 2101 is configured to perform secret sharing according to a target key to be backed up to generate a plurality of subkeys;

The processing module 2102 is configured to encrypt the multiple subkeys respectively to obtain multiple subkey ciphertext data, and store the multiple subkey ciphertext data in different storage devices;

Verification module 2103, configured to search for subkey ciphertext data corresponding to the target key from different storage devices, and verify the found subkey ciphertext data;

The activation module 2104 is configured to determine that multiple subkey ciphertext data are successfully stored in different storage devices if the verification of the found subkey ciphertext data is successful, and activate the target key to perform encryption processing according to the activated target key.

In another exemplary embodiment, based on the aforementioned scheme, the generation module 2101 is specifically configured as follows: generating multiple numbers according to the target key; wherein the sum of the multiple numbers matches the target key; and using each generated number as a subkey of the target key.

In another exemplary embodiment, based on the aforementioned scheme, the generation module 2101 is specifically configured as follows: a polynomial is generated according to the target key; wherein, under the condition that the independent variable of the polynomial is a specified independent variable value, the dependent variable of the polynomial matches the target key; multiple other independent variable values other than the specified independent variable value are obtained, and the dependent variable value corresponding to each other independent variable value is calculated according to the polynomial; wherein the number of other independent variable values is greater than the degree of the polynomial; and the dependent variable value corresponding to each other independent variable value is used as a subkey of the target key.

In another exemplary embodiment, based on the aforementioned scheme, the device also includes a restoration module, configured as follows: if the target key is lost, obtain a specified number of subkey ciphertext data from different storage devices; wherein the specified number is greater than the degree of the polynomial; decrypt each obtained subkey ciphertext data to obtain the dependent variable value contained in each subkey ciphertext data; restore the polynomial according to the independent variable values corresponding to the dependent variable values contained in the specified number of subkey ciphertext data; calculate the dependent variable value corresponding to the specified independent variable value according to the restored polynomial, and use the calculated dependent variable value corresponding to the specified independent variable value as the target key.

In another exemplary embodiment, based on the aforementioned scheme, under the condition that each subkey ciphertext data contains signature data generated according to the encryption key corresponding to each subkey ciphertext data, the verification module 2103 is specifically configured as follows: searching for the subkey ciphertext data corresponding to the target key from different storage devices, and extracting the signature data from the found subkey ciphertext data; and verifying the extracted signature data according to the decryption key corresponding to the found subkey ciphertext data.

In another exemplary embodiment, based on the aforementioned scheme, under the condition that each subkey ciphertext data contains a subkey ciphertext and a hash value corresponding to the subkey ciphertext, the verification module 2103 is specifically configured as follows: searching for subkey ciphertext data corresponding to the target key from different storage devices, extracting the subkey ciphertext and the hash value from the found subkey ciphertext data, and performing a hash operation on the extracted subkey ciphertext; comparing the hash value obtained by the hash operation with the extracted hash value; if the comparison result indicates that the hash value obtained by the hash operation matches the extracted hash value, it is determined that the verification of the found subkey ciphertext data is successful.

In another exemplary embodiment, based on the aforementioned scheme, the apparatus further includes an update module configured to: obtain the storage duration of multiple subkey ciphertext data in different storage devices; if the storage duration exceeds a set duration threshold, delete the subkey ciphertext data corresponding to the target key from different storage devices, and re-share the secret based on the target key to generate multiple new subkeys; encrypt the multiple new subkeys respectively to obtain multiple new subkey ciphertext data; and store the multiple new subkey ciphertext data in different storage devices.

In another exemplary embodiment, based on the above-mentioned scheme, the generation module 2101 is specifically configured to: generate a random number and add the random number to the target key; perform key sharing according to the target key after adding the random number to generate multiple subkeys.

In another exemplary embodiment, based on the aforementioned scheme, the processing module 2102 is specifically configured as follows: encrypt multiple subkeys respectively to obtain multiple subkey ciphertext data; generate interference data, and add the interference data to a ciphertext data set; wherein the ciphertext data set contains multiple subkey ciphertext data; store the multiple subkey ciphertext data and the interference data contained in the ciphertext data set in different storage devices.

In another exemplary embodiment, based on the aforementioned solution, the device further includes a storage unit configured to: obtain a decryption key corresponding to each subkey ciphertext data; and store the decryption key in a trusted execution environment or a storage device that is not connected to the network.

In another exemplary embodiment, based on the foregoing solution, the device further includes a storage unit configured to:

The decryption key corresponding to each subkey ciphertext data is obtained, and secret sharing is performed based on the decryption key to generate multiple subkeys; the multiple subkeys corresponding to the decryption key are stored in different storage devices.

It should be noted that the data processing device provided in the above embodiment and the data processing method provided in the above embodiment belong to the same concept, wherein the specific manner in which each module and unit performs operations has been described in detail in the method embodiment and will not be repeated here.

An embodiment of the present application also provides an electronic device, comprising: one or more processors; a storage device for storing one or more computer programs, when the one or more computer programs are executed by one or more processors, the electronic device implements the data processing method provided in the above-mentioned embodiments.

FIG. 22 shows a schematic diagram of the structure of a computer system of an electronic device suitable for implementing an embodiment of the present application.

It should be noted that the computer system 2200 of the electronic device shown in FIG. 22 is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

As shown in FIG. 22 , a computer system 2200 includes a central processing unit (CPU) 2201, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 2202 or a computer program loaded from a storage part 2208 to a random access memory (RAM) 2203, such as executing the data processing method in the above-mentioned embodiment. Various computer programs and data required for system operation are also stored in RAM 2203. CPU 2201, ROM 2202, and RAM 2203 are connected to each other via a bus 2204. An input/output (I/O) interface 2205 is also connected to the bus 2204.

In some embodiments, the following components are connected to the I/O interface 2205: an input section 2206 including a keyboard, a mouse, etc.; an output section 2207 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage section 2208 including a hard disk, etc.; and a communication section 2209 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 2209 performs communication processing via a network such as the Internet. A drive 2210 is also connected to the I/O interface 2205 as needed. A removable medium 2211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 2210 as needed, so that a computer program read therefrom is installed into the storage section 2208 as needed.

In particular, according to an embodiment of the present application, a computer program that implements the data processing method can be carried on a computer-readable medium, and the computer program can be downloaded and installed from the network through the communication part 2209, and/or installed from the removable medium 2211.

It should be noted that the computer-readable medium shown in the embodiment of the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a computer program, which may be used by an instruction execution system, device or device or used in combination with it. The computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a computer-readable computer program is carried, and the propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The computer program contained in the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, etc., or any suitable combination of the foregoing.

The flowchart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present application. Wherein, each box in the flowchart or block diagram can represent a module, a program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of the boxes in the block diagram or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and a computer program.

The units involved in the embodiments described in this application may be implemented by software or hardware, and the units described may also be set in a processor. The names of these units do not constitute limitations on the units themselves in some cases.

Another aspect of the present application provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor of an electronic device, the electronic device implements the above data processing method. The computer-readable storage medium may be included in the electronic device described in the above embodiment, or may exist independently without being assembled into the electronic device.

Another aspect of the present application further provides a computer program product, the computer program product comprising a computer program, and when the computer program is executed by a processor, the data processing method provided in each of the above embodiments is implemented. The computer program may be stored in a computer-readable storage medium.

The above content is only a preferred exemplary embodiment of the present application and is not intended to limit the implementation scheme of the present application. A person skilled in the art can easily make corresponding changes or modifications based on the main concept and spirit of the present application. Therefore, the scope of protection of the present application shall be based on the scope of protection required by the claims.

Claims (15)

1. A method of data processing, the method comprising:

secret sharing is carried out according to a target secret key to be backed up, so that a plurality of sub secret keys are generated;

Encrypting the multiple sub-keys respectively to obtain multiple sub-key ciphertext data, and storing the multiple sub-key ciphertext data into different storage devices;

Searching sub-key ciphertext data corresponding to the target key from the different storage devices, and verifying the searched sub-key ciphertext data;

if the verification of the searched sub-key ciphertext data is successful, the plurality of sub-key ciphertext data are determined to be successfully stored in the different storage devices, and the target key is activated, so that encryption processing is carried out according to the activated target key.

2. The method of claim 1, wherein the secret sharing according to the target key to be backed up to generate the plurality of subkeys comprises:

generating a plurality of numbers according to the target key; wherein the sum of the plurality of digits matches the target key;

Each generated number is used as a sub-key of the target key.

3. The method of claim 1, wherein the secret sharing according to the target key to be backed up to generate the plurality of subkeys comprises:

Generating a polynomial according to the target key; wherein, the independent variable of the polynomial is matched with the target key under the condition of the independent variable of the polynomial being a specified self-variable value;

acquiring a plurality of other self-variable values except the appointed self-variable value, and calculating a dependent variable value corresponding to each other self-variable value according to the polynomial; wherein the number of other argument values is greater than the degree of the polynomial;

and taking the dependent variable value corresponding to each other independent variable value as a subkey of the target key.

4. A method as claimed in claim 3, wherein the method further comprises:

if the target key is lost, acquiring the ciphertext data of the appointed number of sub-keys from the different storage devices; wherein the specified number is greater than a degree of the polynomial;

decrypting each piece of obtained subkey ciphertext data to obtain a dependent variable value contained in each piece of subkey ciphertext data;

Restoring the polynomial according to the independent variable values respectively corresponding to the dependent variable values contained in the cipher text data of the appointed number of subkeys;

And calculating the dependent variable value corresponding to the specified self-variable value according to the restored polynomial, and taking the calculated dependent variable value corresponding to the specified self-variable value as the target key.

5. The method of claim 1, wherein each piece of subkey ciphertext data includes signature data generated from an encryption key corresponding to the each piece of subkey ciphertext data;

The verifying the searched sub-key ciphertext data comprises the following steps:

Extracting signature data from the searched sub-key ciphertext data;

and verifying the extracted signature data according to the decryption key corresponding to the searched sub-key ciphertext data.

6. The method of claim 1, wherein each piece of subkey ciphertext data comprises a subkey ciphertext and a hash value corresponding to the subkey ciphertext;

The verifying the searched sub-key ciphertext data comprises the following steps:

extracting a sub-key ciphertext and a hash value from the searched sub-key ciphertext data, and carrying out hash operation on the extracted sub-key ciphertext;

comparing the hash value obtained by the hash operation with the extracted hash value;

if the comparison result indicates that the hash value obtained by the hash operation is matched with the extracted hash value, the verification of the searched sub-key ciphertext data is determined to be successful.

7. The method of claim 1, the method further comprising:

acquiring storage time lengths of the plurality of sub-key ciphertext data in the different storage devices;

If the storage time length exceeds a set time length threshold, deleting the sub-key ciphertext data corresponding to the target key from the different storage devices, and carrying out secret sharing again according to the target key so as to generate a plurality of new sub-keys;

encrypting the plurality of new subkeys respectively to obtain a plurality of new subkey ciphertext data;

the plurality of new sub-key ciphertext data are stored in different storage devices.

8. The method of claim 1, wherein the secret sharing according to the target key to be backed up to generate the plurality of subkeys comprises:

generating a random number and adding the random number to the target key;

and carrying out key sharing according to the target key added with the random number so as to generate a plurality of sub-keys.

9. The method of claim 1, wherein storing the plurality of sub-key ciphertext data into different storage devices comprises:

generating interference data and adding the interference data to a ciphertext data set; wherein the ciphertext data set comprises the plurality of sub-key ciphertext data;

And storing the plurality of sub-key ciphertext data and the interference data contained in the ciphertext data set into different storage devices.

10. The method of any one of claims 1-9, wherein the method further comprises:

obtaining a decryption key corresponding to each sub-key ciphertext data;

Storing the decryption key in a trusted execution environment or a storage device which is not accessed to the network.

11. The method of any one of claims 1-9, wherein the method further comprises:

obtaining a decryption key corresponding to each sub-key ciphertext data, and carrying out secret sharing according to the decryption key to generate a plurality of sub-keys;

and storing the multiple sub-keys corresponding to the decryption key into different storage devices.

12. A data processing apparatus, the apparatus comprising:

the generation module is configured to carry out secret sharing according to a target key to be backed up so as to generate a plurality of sub-keys;

The processing module is configured to encrypt the plurality of sub-keys respectively to obtain a plurality of sub-key ciphertext data, and store the plurality of sub-key ciphertext data into different storage devices;

The verification module is configured to search the sub-key ciphertext data corresponding to the target key from the different storage devices and verify the searched sub-key ciphertext data;

and the activation module is configured to determine that the plurality of sub-key ciphertext data are successfully stored in the different storage devices if the verification of the searched sub-key ciphertext data is successful, and activate the target key so as to carry out encryption processing according to the activated target key.

13. An electronic device, comprising:

One or more processors;

A memory for storing one or more computer programs that, when executed by the one or more processors, cause the electronic device to implement the data processing method of any of claims 1-11.

14. A computer-readable storage medium, on which a computer program is stored which, when executed by a processor of an electronic device, causes the electronic device to implement the data processing method of any one of claims 1-11.

15. A computer program product comprising a computer program which, when executed by a processor, implements the data processing method of any of claims 1-11.