Key data processing method and device and server

Method, device and server for processing key data

[0001] This application is a divisional application for an invention patent application with an application number of 201710747807.5, an application date of August 28, 2017, and an invention title of "a method, device and server for processing key data".

Technical field

[0002] This embodiment belongs to the technical field of blockchain data processing, and in particular relates to a key data processing method, device, and server.

Background technique

[0003] Blockchain is a distributed database. It is a chained data structure in which data blocks are sequentially connected in chronological order, and the data is encrypted to ensure that the data cannot be tampered with and cannot be tampered with. Forgery. Because the blockchain can effectively guarantee the authenticity of data, more and more fields are used.

[0004] Generally, data on the blockchain is signed and verified using asymmetric encryption. The transaction initiator of the blockchain can use its own private key to sign the transaction, and the miner (computing node) can use the initiator's public key to verify the transaction. If the transaction verification is passed, it can indicate that the funds flowed by the transaction belong to the normal asset owner, and the transaction information is placed in a new block of the blockchain. In the process of blockchain asset transactions, the private key is usually held by a single party, such as stored in a persons mobile phone or computer. Therefore, the ownership and controller of the asset can be regarded as the party that holds the private key. Owned. In reality, certain assets are shared by multiple people, such as real estate being jointly owned by the husband and wife, investment in partnership, etc. When multiple parties need to share an asset, the same private key needs to be shared to multiple sharing parties. Each sharing party can use the private key to control and trade this asset, and transfer this asset without others knowing it. There is a greater risk of safe transactions. Therefore, there is an urgent need for a safer and more reliable way to ensure the security of blockchain shared assets.

Summary of the invention

[0005] The purpose of this embodiment is to provide a key data processing method, device, and server, which can automatically generate the same number of subkeys according to the number of shared assets, and use the subkeys to restore the original key during transactions. , Realize the effective multi-person sharing security guarantee of assets in the blockchain.

[0006] The key data processing method, device, and server provided in this embodiment are implemented in the following ways:

[0007] A method for processing key data, the method comprising:

[0008] Obtain the original key of the shared object in the blockchain, and determine the shared number of the original key;

[0009] The original key is processed using a preset algorithm to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0010] A key data processing device, the device comprising:

[0011] The original key information module is used to obtain the original key of the shared object in the blockchain and determine the number of shared original keys; The key is processed to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0013] A key data processing device, including a processor and a memory for storing executable instructions of the processor, when the processor executes the instructions:

[0014] Obtain the original key of the shared object in the blockchain, and determine the number of shared original keys;

[0015] The original key is processed using a preset algorithm to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0016] A server includes at least one processor and a memory for storing processor-executable instructions, and when the processor executes the instructions:

[0017] Obtain the original key of the shared object in the blockchain, and determine the number of shared original keys;

[0018] The original key is processed using a preset algorithm to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0019] The key data processing method, device, and server provided by one or more embodiments can split the original key into multiple sub-keys according to the number of original key shares of shared objects such as assets and data. , The generated sub-keys can be shown to the corresponding asset sharing parties respectively. When it is necessary to perform operations on shared objects, each asset sharing party can provide its own subkey, and then can use the subkey to restore the original key, and then perform corresponding signatures, asset transactions, and other operations. In this way, by using this embodiment, when the assets in the blockchain are shared by multiple people, it can effectively prevent any one of the multiple people from operating the asset without others knowing, ensuring the shared assets in the blockchain Security of transactions.

Description of the drawings

[0020] In order to more clearly explain the technical solutions in this embodiment or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiment or the prior art. Obviously, the appendix in the following description The drawings are only some of the embodiments described in the drawings. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative labor.

[0021] FIG. 1 is a schematic diagram of the method flow of a key data processing method provided by the present invention;

[0022] FIG. 2 is a schematic diagram of a method flow of another embodiment of the method provided by the present invention;

[0023] FIG. 3 is a schematic diagram of the processing procedure of an embodiment of generating a subkey provided by the present invention;

[0024] FIG. 4 is a schematic diagram of a method flow of another embodiment of the method provided by the present invention;

[0025] FIG. 5 is a schematic diagram of another preset algorithm processing process for generating a subkey in the method provided by this invention;

[0026] FIG. 6 is a schematic diagram of a module structure of an embodiment of a key data processing device provided by the present invention;

[0027] FIG. 7 is a schematic diagram of the module structure of another embodiment of the key data processing device provided by the present invention;

[0028] FIG. 8 is a schematic diagram of a module structure of an embodiment of a subkey generation module in the device provided by the present invention;

[0029] FIG. 9 is a schematic diagram of the module structure of another embodiment of the key data processing device provided by the present invention;

[0030] FIG. 10 is a schematic diagram of the module structure of another embodiment of the subkey generation module in the device provided by the present invention;

[0031] FIG. 11 is a schematic diagram of a module structure of a wallet application using this embodiment;

[0032] FIG. 12 is a schematic structural diagram of a server implementing the method or device implementation.

detailed description

[0033] In order to enable those skilled in the art to better understand the technical solutions in the present specification, the technical solutions in one or more embodiments of this specification will be clarified below in conjunction with the drawings in one or more embodiments of this specification. A complete description. Obviously, the described embodiments are only a part of the embodiments, rather than all of the embodiments. Based on one or more embodiments, all other embodiments obtained by a person of ordinary skill in the art without creative work shall fall within the protection scope of the solution of this embodiment.

[0034] Although the method operation steps or device structures shown in the following embodiments or drawings are provided in the present invention, based on conventional or without creative labor, the method or device may include more or less after partial combination. Operation steps or modular units. In steps or structures where there is no necessary causal relationship logically, the execution order of these steps or the module structure of the device is not limited to the execution order or module structure shown in this embodiment or the drawings. When the described method or module structure is applied to an actual device, server or terminal product, it can be executed sequentially or in parallel according to the method or module structure shown in the embodiment or the drawings (for example, parallel processor or multi-threaded processing). Environment, even including the implementation environment of distributed processing and server clusters).

[0035] A blockchain usually includes multiple blocks, and a block is a logical data structure that can be used to store blockchain data. These blockchain data can include data information generated by operations such as the transfer and changes of funds in the blockchain. Usually, in the blockchain, a transfer of funds or a change of an asset can be called a transaction. The assets described in some embodiments of the present invention may include assets such as currency, securities, and precious metals stored on the blockchain in the form of electronic data in the blockchain. For example, the wallet function provided by some applications can store currency assets and use the assets in the wallet to purchase products or transfer money.

[0036] The data in the blockchain can use asymmetric encryption to verify the legitimacy of the transaction. The asymmetric encryption usually includes a public key and a private key. The public key can be publicized, and the private key is not publicly disclosed. It is one of the main methods used to verify transactions when trading assets on the blockchain. The transaction party can use the private key to sign the transaction, and the verifier can use the transaction party's public key to verify the signature. If it can be verified, it can indicate that the transaction comes from the true owner of the private key corresponding to the public key, the transaction is legal, and the transaction can be placed in a new block of the blockchain. It can be seen from the above process that private keys play a very important role in blockchain asset transactions. When the asset is shared by multiple people, the asset involves the rights and interests of multiple parties. One or more of the embodiments provided herein can realize that the asset sharing party needs to participate in the asset transaction, which can effectively guarantee the operation of the shared asset in the blockchain. safety.

[0037] Specifically, the implementation process of this solution is described with a blockchain transaction of a wallet application as an implementation scenario. The wallet may include an application on the client side or the server side, and usually generates an asymmetric key, calculates a public key address, and realizes blockchain asset transactions. When a new asset is confirmed or the asset sharing party changes, the wallet can automatically use the private key corresponding to the asset to calculate and generate the same number of subkeys as the asset sharing party according to the number of asset sharing parties. These sub-keys can be sent to the corresponding asset-sharing parties, so that each asset-sharing party can control a copy of the sub-key. These subkeys restore the original private key when the original private key is needed for asset transactions, and then use the restored private key to sign and initiate the transaction.

[0038] Of course, the shared object described in the solution of this embodiment is not necessarily limited to the electronic currency asset described above, and the original key is not limited to the private key in asymmetric encryption. The shared object may also include corresponding types of business data in other implementation scenarios, such as billing data, user data, public information, etc., and the original key may also include other data information that encrypts data, such as String, even image, sound, fingerprint and other types of key data. In the following embodiments, multiple sub-keys are generated from the original key and the received sub-keys are used to restore the original

The key processing can also be calculated by the miners in the blockchain. The mentioned miners generally refer to nodes with sufficient computing power, which can collect multiple transaction records and install them together, and then use the miners own key to try various padding bits for encryption, broadcast this block to the entire network, and let other nodes Know that a new block in the blockchain has been generated.

[0039] A specific embodiment is shown in FIG. 1. In an embodiment of a key data processing method provided in the present invention, the method may include:

[0040] S0: Obtain the original key of the shared object in the blockchain, and determine the shared number of the original key;

[0041] S2: Use a preset algorithm to process the original key to generate the shared number of subkeys, and the subkey is used to restore the original secret when the shared number of subkeys is obtained key.

[0042] In this embodiment, the computing device can obtain the information of the original key corresponding to the asset and the amount of information that the asset is shared. Then, a pre-selected or designed preset algorithm can be used to perform calculation processing on the original key to generate the same number of sub-keys as the data shared by the asset. The shared objects described in the implementation scenario of this embodiment may include assets in a wallet. The original key may be generated by the local wallet (server), or may include the received original key sent by other wallets (server). In this embodiment, among the multiple sub-keys generated from the original key, each sub-key cannot be independently authenticated for a transaction or the authentication cannot be passed. The said subkey can be restored when all the subkeys generated by the same original key are collected. If the subkey is missing or any one of the subkeys is incorrect, the restoration cannot be completed. The original key or the restored original key is incorrect.

[0043] For example, in the application scenario of this embodiment, a blockchain network may include multiple nodes, and each node may have its own public key and private key. Assuming that there is a wallet application in a node, the wallet is the shared object described in the embodiment, and the private key of the wallet is the original key. The private key of the wallet can be named S, and the number of people sharing the wallet is 2. Then, two sub-keys S1 and S2 can be produced based on the private key S according to a pre-selected or designed algorithm. Among them, the signature of the sub-key S1 that cannot perform transactions in the wallet or the signature cannot pass verification, and the signature of the sub-key S2 that cannot perform transactions in the wallet or the signature cannot pass the verification. However, the original private key S can be restored according to the subkey S1 and the subkey S2. The specific method of restoring the original private key S can be calculated according to the preset algorithm used when producing the sub-key, such as the reverse algorithm that is the opposite of the preset algorithm to generate the sub-key, and of course it can also include other For example, the algorithm of interpolation, sub-key correlation, and even combined with third-party auxiliary data to restore the implementation of the original key.

[0044] Further, in another embodiment of the method provided by the present invention, after generating the same number of sub-keys as the asset-sharing party, the sub-key can be displayed to the corresponding asset-sharing party, so that each Each asset sharing party can get its own subkey. Then the original key can be destroyed, for example, the original private key can be completely deleted from the wallet (or the storage unit where the original private key is stored). In this way, any asset sharing party has its own sub-key and will not save the original key, which can further ensure the security of key data and prevent an asset sharing party from using the private key to conduct asset transactions. Specifically, another embodiment of the method is shown in FIG. 2, and may further include:

[0045] S4: Send the subkeys to the corresponding object sharing parties respectively;

[0046] S6: Delete the original key.

[0047] FIG. 2 is a schematic diagram of a method flow of another embodiment of the method provided in the present invention. In this embodiment, after the wallet generates its own public key and private key, it can use the private key to generate the same number of subkeys as the number of sharers according to different number of sharers, and then the subkeys can be shown to the asset sharing party. , And then destroy the private key. In the specific implementation process, a subkey can be set and sent to an asset sharing party. Of course, it is not excluded that in other embodiments, an asset sharing party may have two or more subkeys, for example, mutually trusted asset sharing parties store each other's subkeys.

[0048] In an implementation manner, the subkey may be sent by the wallet to the object sharing party. In other implementation manners, after the wallet generates the subkey, the generated multiple subkeys are output, and then other processing parties (for example, a specially set subkey distribution device) send the subkeys to the object Sharing party. When sending the subkey, a randomly selected and generated subkey can be used to send, or a designated subkey can be selected and sent to the corresponding object sharing party according to a certain rule.

[0049] The preset algorithm for generating the subkey in the foregoing embodiment may include multiple implementation manners. This embodiment provides a preset algorithm for generating a subkey using an original key, and a random character string can be combined with the original key to perform arithmetic processing to generate a subkey. Specifically, in an embodiment of the method, the preset algorithm may include:

[0050] S20: Use a randomly generated character string to perform an operation on the original key to generate a shared number of subkeys corresponding to the original key.

[0051] The character string may include numbers, letters, symbols, etc. The wallet can save these randomly generated strings, which can be used for subsequent restoration of the original key. The specific method of using a randomly generated character string and the original key to perform arithmetic processing can be set in advance. For example, a fixed-length character string is randomly generated, and one or more characters of the character string are inserted into the original key in a certain order to generate Sub-key, or add the value of the corresponding bit to the string and the original key. In this embodiment, a random character string is used to generate the sub-key of the original key, which can further ensure the security of the generated sub-key, thereby improving the security of the original key.

[0052] In another embodiment of the method, there is provided an implementation that uses random numbers, prime numbers, and modulo operations to generate sub-keys. Specifically, as shown in FIG. 3, FIG. 3 is a schematic diagram of the processing process of an embodiment of generating a subkey provided by the present invention, and the preset algorithm may include:

[0053] S200: When the shared number is (N+1), generate N random numbers Ri, where Ri is the i-th random number, ie[1,

N];

[0054] S202: Determine a prime number P, where the prime number P is at least greater than any one of the original key value S and the random number Ri, and the value range of Ri includes (0, P-1];

[0055] S204: Calculate (S+R₁X+R₂X²+R3X³+-+RnXⁿ) After modulo P, X takes the value [1, N+1] to obtain (N+1) subkeys, and NZ1, X, N are integers.

[0056] Generally, in the asymmetric key algorithm used in the blockchain, the length of the generated private key is usually 1024 bits or 2048 bits. Therefore, in a specific implementation process of an implementation scenario, the wallet can pre-store more than Part of the known prime numbers of 1024 or 2048 bits are used as data storage when the wallet generates the subkey in this embodiment. Assuming that the private key is named S, the wallet can take a random number Ri according to the number of people sharing, and then take a prime number P that is longer than the private key S or greater than the random number Ri to meet the sub-key calculation conditions. Further, you can use s+r₁x+r₂x²+r3x³+..·+rnxⁿModulo P to generate each subkey respectively. A specific example can be as follows:

[0057] 1) If there are two people sharing assets, the generated subkeys can be respectively:

[0058] Subkey one: (S+R) mod P;

[0059] Sub-key two: (S+2R) modulo P.

[0060] 2). Assuming that there are three people sharing assets, the generated subkeys can be respectively:

[0061] Subkey one: (S+R#R₂) Mod P;

[0062] Sub-key two: (S+2R₁+4R₂) Mod P;

[0063] Sub-key three: (S+3R₁+9R₂) Mod P.

[0064] By analogy, assuming that there are (N+1) individual shared assets and (N+1) subkeys need to be generated, then (S+%X+Κ₂Χ²+%Χ³+···+ΚΝΧⁿ) Take the modulus of P, where each subkey can be calculated by X taking the value [1,N+1]. In another example, the process of calculating four sub-keys when sharing assets shared by four people using the above method can be as follows: [0065] Sub-key one: (S+R1+R)₂+R₃) Mod P;

[0066] Subkey two: (S+2R#4R₂+8R₃) Mod P;

[0067] Subkey three: (S+3R₁+9R₂+27R₃) Mod P;

[0068] Subkey four: (S+4R#16R₂+64R₃) Mod P.

[0069] The preset algorithm for calculating the sub-key provided in this embodiment adopts a predetermined method of processing that combines random numbers, prime numbers, and modulo operations, and the shared number of sub-keys can be automatically generated according to the shared number of the original key. Key, and because of the above-mentioned sub-key generation method, the generated sub-key has stronger confidentiality, reduces the risk of being cracked, and has higher security. [0070] In another embodiment of the method provided by the present invention, not only can corresponding multiple subkeys be generated according to the original key of the shared object, but also the calculation processing of restoring the original key can be performed according to the received subkey . Specifically, in another embodiment of the method provided in this specification, the method may further include:

[0071] S80: Receive the input subkey;

[0072] S82: When it is determined that the number of the subkeys is the same as the shared number of the corresponding original keys, perform the original key restoration calculation processing on the shared number of subkeys through a predetermined algorithm to obtain the corresponding Original key.

[0073] Of course, further, it may also include:

[0074] S84: Operate the shared object by using the original key obtained after the restoration calculation process.

[0075] FIG. 4 is a schematic diagram of a method flow of another embodiment of the method provided in the present invention. When the original key is needed for asset operations, each asset sharing party of the original key can enter its own sub-key. Since the subkeys are distributed to multiple asset sharing parties, in this embodiment, the original key is restored and calculated when the number of subkeys shared by the original key is received. For example, the private key of the wallet generates three sub-keys, which are kept by three wallet sharers. When wallet fund operations are required, each wallet sharer enters his own sub-key respectively. At this time, when the wallet receives three sub-keys, the three sub-keys can be used to restore the private key of the wallet. If the wallet only receives one or two sub-keys, or there are more than three sub-keys, it can be set to match the number of shares different from that of the wallet, and it is not necessary to perform the restoration calculation processing of the original key.

[0076] The restoration calculation process for restoring the original key based on the subkey can be combined with the algorithm for generating the subkey to design a restoration algorithm, or can be combined with the characteristics of the subkey to perform the restoration calculation in some specific ways . For example, in the foregoing implementation of using random numbers, prime numbers, and modulo operations to generate subkeys, in the process of one or more of the original key restoration calculation processing, the original key can be calculated and restored through the Lagrangian formula. Private key S.

[0077] After the restored original key is obtained, the key can be used to perform operations on the corresponding shared object, such as signing a transaction and confirming that the transaction is generated by a legitimate user of the wallet. Furthermore, the wallet can broadcast the signed transaction information to the blockchain network and store it in a new block.

[0078] The foregoing embodiments provide some preset algorithms for generating sub-keys using random character strings or random numbers, prime numbers, etc. Another embodiment of the present invention provides another implementation manner of generating a corresponding number of subkeys based on the original key. In this embodiment, the original key and random numbers of the same length generated at any time can be XORed one by one to obtain a value, and then the value obtained by the XOR calculation and these random numbers can be used as subkeys. Specifically, in another embodiment of the method provided in the present invention, the preset algorithm may include:

[0079] S210: Generate (N-1) random numbers, where the binary length of the random number corresponds to that of the original key

The length is the same, and N is the shared number of the original key;

[0080] S212: Perform a bitwise XOR operation on the original key and the (N-1) random numbers one by one to obtain an XOR subkey;

[0081] S214: Use the XOR subkey and the (NT) random numbers as output N subkeys.

[0082] In the solution of this embodiment, if the shared object can generate (NT) random numbers in advance. The length of the random number can be the same as the length of the original key, for example, both are 1024-bit or 2048-bit binary numbers. The original key can be XORed with (N-1) random numbers one by one, and finally a number is obtained. This number and the previously generated (N-1) random numbers are used as sub-keys, and each object sharing party is assigned a sub-key.

[0083] According to the one-by-one processing method of XOR operation, a specific example is shown in FIG. 5, which is another preset algorithm processing for generating subkeys provided by the method. Schematic diagram of the process. Assume that the length of the original key S is 1024 bits binary, and the shared number is 4. You can first generate three 1024-bit random binary. Then the original key S can be XORed with the first random number to get R1, and then R1 can be XORed with the second random number to get R2. Finally, R2 is XORed with the third random number to obtain R3, which is the XOR subkey described in this embodiment. Then use R3 and these 3 1024-bit random binary as the calculated 4 subkeys. Using the subkeys obtained by performing the exclusive OR operation in this embodiment, each subkey can be reversed XORed again when the original key needs to be restored. The XOR operation is used during encryption, and the inverse operation of the XOR operation during decryption is XOR again, so that the original key can be obtained. Using the XOR operation method provided in this embodiment not only ensures that the correct subkeys need to be collected during decryption, but also the original key can be quickly obtained by performing the XOR of the subkeys. The key restoration calculation is simpler and assets are protected. At the same time of transaction security, the processing speed of decrypting and restoring the original key is greatly improved.

[0084] The various embodiments in this disclosure are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. For details, reference may be made to the description of the foregoing related processing related embodiments, which will not be repeated here.

[0085] This particular embodiment has been described above. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps described in the claims may be performed in a different order than in the embodiments and still achieve desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or sequential order shown in order to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0086] According to a method for processing key data provided by one or more embodiments, the original key can be split into multiple sub-keys according to the number of original key shares of shared objects such as assets and data, and the generated sub-keys The keys can be shown to the corresponding asset sharing parties respectively. When it is necessary to perform operations on shared objects, each asset sharing party can provide its own subkey, and then can use the subkey to restore the original key, and then perform corresponding signatures, asset transactions, and other operations. In this way, by using this embodiment, when the assets in the blockchain are shared by multiple people, it can effectively prevent any one of the multiple people from operating the asset without others knowing, ensuring the shared assets in the blockchain Security of transactions.

[0087] Based on the user key data processing method described above, one or more embodiments of the present invention also provide a key data processing device. The described devices may include systems (including distributed systems), software (applications), modules, components, servers, clients, etc., which use the method described in this embodiment, combined with necessary implementation hardware devices. Based on the same innovative concept, the devices in one or more embodiments provided in this embodiment are as described in the following embodiments. Since the implementation scheme and method of the device to solve the problem are similar, the implementation of the specific device in this embodiment can refer to

See the implementation of the aforementioned method, and the repetition will not be repeated. As used below, the term "unit" or "module" can be a combination of software and/or hardware that implements a predetermined function. Although the devices described in the following embodiments are preferably implemented by software, implementation by hardware or a combination of software and hardware is also possible and conceived. Specifically, FIG. 6 is a schematic diagram of the module structure of an embodiment of a key data processing device provided by the present invention. As shown in FIG. 6, the device may include:

[0088] The original key information module 101 can be used to obtain the original key of a shared object in the blockchain and determine the number of shared original keys;

[0089] The subkey generation module 102 may be used to process the original key using a preset algorithm to generate the shared number of subkeys, and the subkey is used to obtain the shared number of subkeys. The original key is restored when the key is turned.

[0090] The key data processing device provided by this embodiment can split the original key into multiple sub-keys according to the number of original key shares of shared objects such as assets, data, etc., and different sharers each hold one. The share key enables an asset to be shared by multiple people while ensuring that the transaction of the asset requires the participation of multiple people. It can effectively prevent the asset sharing party from privately operating the transaction data on the blockchain and ensure the security of asset transactions.

[0091] FIG. 7 is a schematic diagram of the module structure of another embodiment of the key data processing device provided by the present invention. In another embodiment of the device, the device may further include:

[0092] The subkey output module 103 can be used to send the subkeys to the corresponding object sharing parties respectively; [0093] The original key deletion module 104 can be used to delete the original keys.

[0094] In this embodiment, among the multiple sub-keys generated by the original key, each sub-key cannot be authenticated separately for a transaction or the authentication cannot be passed. The said subkey can be restored to the original key when all the subkeys generated by the same original key are collected.

[0095] After generating the same number of sub-keys as the asset-sharing parties, the sub-keys can be displayed to the corresponding asset-sharing parties, so that each asset-sharing party can obtain its own sub-key. The original key can then be destroyed, for example, the original private key can be completely deleted from the wallet. In this way, any asset sharing party has its own sub-key and will not save the original key, which can further ensure the security of key data and prevent an asset sharing party from using the private key to conduct asset transactions. [0096] In another embodiment of the device, the preset algorithm used in the subkey generation module 102 may include:

[0097] Use a randomly generated character string to perform operations on the original key to generate a shared number of subkeys corresponding to the original key.

[0098] In another embodiment of the device, there is provided an implementation that uses random numbers, prime numbers, and modulo operations to generate sub-keys. FIG. 8 is a schematic diagram of the module structure of an embodiment of a subkey generation module in the device provided by the present invention. As shown in FIG. 8, the sub-key generation module 102 may include:

[0099] The random number generating unit 1021 may be used to generate N random numbers Ri when the shared number is (N+1), where Ri is the i-th random number, ie[1,N];

[0100] The prime number selection unit 1022 may be used to determine a prime number P, where the prime number P is at least greater than any one of the original key value S and the random number Ri, and the value range of Ri includes (0, P-1] ;

[0101] The sub-key calculation unit 1023 may be used to calculate (S+RiX+R₂X²+R3X³+...+RnXⁿAfter) modulo P, X takes the value [1, N+1] to obtain (N+1) subkeys, and NZ1, X, N are integers.

[0102] The preset algorithm for calculating the sub-key provided in this embodiment adopts a predetermined method of processing that combines random numbers, prime numbers, and modulo operations, and the shared number of sub-keys can be automatically generated according to the shared number of the original key. The key, and because the above-mentioned sub-key generation method is adopted, the generated sub-key has stronger confidentiality, reduces the risk of being cracked, and has higher security.

[0103] In another embodiment of the device provided by the present invention, not only can corresponding multiple subkeys be generated according to the original key of the shared object, but also the calculation processing of restoring the original key can be performed according to the received subkey . Fig. 9 is a schematic diagram of the module structure of another embodiment of a key data processing device provided in this specification. As shown in Figure 9, the device may further include:

[0104] The receiving module 1051 can be used to receive the input subkey;

[0105] The original key restoration module 1052 may be used to perform the original key for the shared number of subkeys through a predetermined algorithm when it is determined that the number of the subkeys is the same as the shared number of the corresponding original keys. The restoration calculation process of, the corresponding original key is obtained.

[0106] FIG. 10 is a schematic diagram of the module structure of another embodiment of the subkey generation module in the device provided by the present invention. As shown in FIG. 10, the sub-key generation module 102 may include:

[0107] The random number generating unit 20 may be used to generate (N-1) random numbers, the binary length of the random number is the same as the binary length corresponding to the original key, and N is the share of the original key quantity;

[0108] The exclusive OR calculation unit 21 may be used to perform a bitwise exclusive OR operation on the original key and the (N-1) random numbers one by one to obtain an exclusive OR subkey;

[0109] The subkey determining unit 22 may be used to take the XOR subkey and the (N-1) random numbers as the output N subkeys.

[0110] In this embodiment, the original key and random numbers with the same length generated at any time can be XORed one by one to obtain a value, and then the XOR calculated value and these random numbers can be used as Subkey.

[0111] Using the XOR operation method provided in this embodiment not only ensures that the correct subkeys need to be collected during decryption, but also performs the XOR of the subkeys to quickly obtain the original key, and the key restoration calculation is simpler. , While ensuring the security of asset transactions, it greatly improves the processing speed of decrypting and restoring the original key.

[0112] It should be noted that the above-mentioned device may also include other implementation manners according to the description of the method embodiment, and the specific implementation manner may refer to the description of the related method embodiment, which is not repeated here.

[0113] In the above-mentioned device embodiments, in actual product applications, various modules or sub-modules can be combined or split according to the implementation environment or data processing requirements. When implementing one or more of these modules, the function of each module can be implemented in the same one or more software and/or hardware, or the module that implements the same function can be implemented by a combination of multiple sub-modules or sub-units. The device embodiments described above are merely illustrative, for example, the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or integrated. To another system, or some features can be ignored, or not implemented.

[0114] FIG. 11 is a schematic diagram of the module structure of a wallet application using this embodiment. As shown in FIG. 11, the public and private key generation component of the wallet can generate the public key and private key of the wallet, and the prime number storage component and pre-stored larger than private key Multiple prime numbers of the key length, the random number generation component can generate a corresponding number of random numbers each time it needs to generate a sub-key, and the sub-key calculation unit can generate multiple sub-keys corresponding to the private key and output the sub-key key. The output subkey can be distributed to the corresponding wallet sharer. When performing asset transactions on the wallet, each sharing party enters the subkey, and then the private key restoration calculation component can calculate the original key according to the corresponding algorithm for restoring the original key, and then use the original key to sign and verify the transaction, etc. . After the transaction is generated, the transaction can be broadcast to the entire blockchain network.

[0115] According to a key data processing device provided by one or more embodiments, the original key can be split into multiple sub-keys according to the number of original key shares of shared objects such as assets, data, and the generated sub-keys. The keys can be shown to the corresponding asset sharing parties respectively. When the operation of the shared object is required, each asset sharing party can provide separately

Your own subkey can then be used to restore the original key, and then perform corresponding signatures, asset transactions, and other operations. In this way, by using this embodiment, when the assets in the blockchain are shared by multiple people, it can effectively prevent any one of the multiple people from operating the asset without others knowing, ensuring the shared assets in the blockchain Security of transactions.

[0116] The method or device described in the above-mentioned embodiment provided by the present invention can implement business logic through a computer program and record it on a storage medium, and the storage medium can be read and executed by a computer to realize the effects of the solution described in this embodiment . The storage medium may include a physical device for storing information, and usually the information is stored in an electric, magnetic, or optical medium after digitizing the information. The storage medium may include: devices that use electric energy to store information, such as various types of memories, such as RAM, ROM, etc.; devices that use magnetic energy to store information, such as hard disks, floppy disks, magnetic tapes, magnetic core memories, magnetic bubble memories, U disk; a device that uses optical means to store information, such as CD or DVD. Of course, there are other ways of readable storage media, such as quantum memory, graphene memory, and so on.

[0117] The above-mentioned user key data processing method or device provided in this embodiment can be implemented by a processor executing corresponding program instructions in a computer, such as using the C++ language of the windows operating system on the server side or a server based on the Linux system, Or other, for example, using android, iOS system programming language to realize on the server system terminal, and including the realization of processing logic based on quantum computer, etc. The program instructions can be stored on the storage medium. In another embodiment of the key data processing device provided in the present invention, it may include a processor and a memory for storing executable instructions of the processor, and when the processor executes the instructions:

[0118] Obtain the original key of the shared object in the blockchain, and determine the number of shared original keys;

[0119] The original key is processed by using a preset algorithm to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0120] It should be noted that the above-mentioned device according to the description of the method embodiment may also include other implementation manners, for example, the processor deletes the data of the original key, and uses random numbers, prime numbers, and modulo operations to generate sub-keys. , Langera day formula to restore the original key, XOR operation to generate sub-keys and reverse operation to restore the original key and other implementation methods. For specific implementation manners, reference may be made to the description of the related method embodiments, which will not be repeated here.

[0121] The aforementioned method or device can be used in a variety of key data processing servers, such as the aforementioned wallet server, blockchain miner node server, blockchain node business server, etc. The said server may include a single server, or may include a server of a distributed system or an architecture mode of a server cluster. Specifically, the present invention provides a server, as shown in FIG. 12, which may include at least one processor and a memory for storing processor-executable instructions, and when the processor executes the instructions:

[0122] Obtain the original key of the shared object in the blockchain, and determine the number of shared original keys;

[0123] The original key is processed using a preset algorithm to generate the shared number of subkeys, and the subkey is used to restore the original key when the shared number of subkeys are obtained.

[0124] It should be noted that the above-mentioned server may also include other implementation manners according to the description of the method or device embodiment, such as deleting the data of the original key, and generating the subkey using random numbers, prime numbers, and modulo operations. , Langela day interpolation to restore the original key, XOR operation to generate a sub-key, and inverse operation to restore the original key and other implementation methods. For specific implementation manners, reference may be made to the description of the relevant method or device embodiment, which will not be repeated here.

[0125] The various embodiments in the present invention are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the hardware + program embodiment, since it is basically similar to the method embodiment, the description is relatively simple.

Part of the description of the law embodiment is sufficient.

[0126] This particular embodiment has been described above. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps described in the claims may be performed in a different order than in the embodiments and still achieve desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or sequential order shown in order to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0127] The key data processing method, device, and server provided by one or more embodiments can split the original key into multiple sub-keys according to the number of original key shares of shared objects such as assets and data. , The generated sub-keys can be shown to the corresponding asset sharing parties respectively. When it is necessary to perform operations on shared objects, each asset sharing party can provide its own subkey, and then can use the subkey to restore the original key, and then perform corresponding signatures, asset transactions, and other operations. In this way, by using this embodiment, when the assets in the blockchain are shared by multiple people, it can effectively prevent any one of the multiple people from operating the asset without others knowing, ensuring the shared assets in the blockchain Security of transactions.

[0128] Although the content of the embodiment mentions the use of random numbers and prime numbers and modulus operations to generate subkeys, exclusive OR operations to generate subkeys, use Lagrangian formula to restore the original keys, and destroy the original keys after allocating subkeys. Description of data generation, definition, acquisition, interaction, calculation, judgment, etc., such as keys, etc. However, this embodiment is not limited to complying with industry communication standards, blockchain data rules, standard computer data processing and storage rules Or the situation described in one or more embodiments. Certain industry standards or implementations described in custom methods or examples with slight modifications can also achieve the same, equivalent or similar implementation effects of the foregoing examples, or predictable implementation effects after modification. Embodiments obtained by applying these modified or deformed data acquisition, storage, judgment, processing methods, etc., may still fall within the scope of alternative implementations of this embodiment.

[0129] This particular embodiment has been described above. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps described in the claims may be performed in a different order than in the embodiments and still achieve desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or sequential order shown in order to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0130] In the 1990s, the improvement of a technology can be clearly distinguished between hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to method flows). ). However, with the development of technology, the improvement of many methods and processes of today can be regarded as a direct improvement of the hardware circuit structure. Designers almost always get the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that the improvement of a method flow cannot be realized by the hardware entity module. For example, a Programmable Logic Device (PLD) (such as a Field Programmable Gate Array (FPGA)) is such an integrated circuit whose logic function is determined by the user's programming of the device. It is programmed by the designer to "integrate" a digital system on a piece of PLD, without having to ask the chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly realized by using "logic compiler" software, which is similar to the software compiler used in program development and writing. The original code must also be written in a specific programming language, which is called a hardware description language (Hardware Description Language, HDL), and HDL is not only one, but there are many, such as ABEL (Advanced Boolean Expression Language)>AHDL (Altera Hardware Description Language)

Language)>Confluence>CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used at present is VHDL (Very- High-Speed Integrated Circuit Hardware Description Language) and Verilog. It should also be clear to those skilled in the art that just a little bit of logic programming of the method flow in the above-mentioned hardware description languages and programming into an integrated circuit can easily obtain the hardware circuit that implements the logic method flow.

[0131] The controller can be implemented in any suitable manner. For example, the controller can take the form of, for example, a microprocessor or a processor and a computer storing computer-readable program codes (such as software or firmware) executable by the (micro)processor. In the form of readable media, logic gates, switches, application specific integrated circuits (ASICs), programmable logic controllers and embedded microcontrollers, examples of controllers include but are not limited to the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicon Labs C8051F320, the memory controller can also be implemented as part of the memory control logic. Those skilled in the art know, in addition to the computer-pure than the read program code means for implementing a controller, can be programmed by the logic method steps so that the controller logic gates, switches, an application specific integrated circuit, a programmable logic controller and the embedded The same function can be realized in the form of a microcontroller or the like. Therefore, such a controller can be regarded as a hardware component, and the devices included in it for realizing various functions can also be regarded as a structure within the hardware component. Or even, the device for realizing various functions can be regarded as both a software module for realizing the method and a structure within a hardware component.

[0132] The systems, devices, modules, or units illustrated in the foregoing embodiments may be specifically implemented by computer chips or entities, or implemented by products with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, and a tablet. Computers, wearable devices, or any combination of these devices.

[0133] Although the present one or more embodiments provide method operation steps as described in the embodiments or flowcharts, conventional or non-innovative methods may include more or fewer operation steps. The sequence of steps listed in the embodiment is only one way of the execution order of the steps, and does not represent the only execution order. When the actual device or terminal product is executed, it can be executed sequentially or in parallel according to the methods shown in the embodiments or drawings (for example, a parallel processor or a multi-threaded processing environment, or even a distributed data processing environment). The terms "include", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, product, or device that includes a series of elements includes not only those elements, but also other elements that are not explicitly listed. Elements, or also include elements inherent to such processes, methods, products, or equipment. If there are no more restrictions, it does not exclude that there are other identical or equivalent elements in the process, method, product, or device including the elements.

[0134] For the convenience of description, when describing the above device, the functions are divided into various modules and described separately. Of course, when implementing one or more of these modules, the function of each module can be implemented in the same one or more software and/or hardware, or the module that implements the same function can be implemented by a combination of multiple sub-modules or sub-units. The device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or integrated. To another system, or some features can be ignored, or not implemented. In addition, the displayed or discussed mutual coupling or direct coupling or communication connection may be through some connections, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

[0135] Those skilled in the art also know that, in addition to implementing the controller in a purely computer-readable program code manner, complete

It is all possible to make the controller achieve the same function in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers and embedded microcontrollers by logically programming the method steps. Therefore, such a controller can be regarded as a hardware component, and the devices included in the controller for realizing various functions can also be regarded as a structure within the hardware component. Or even, the device for realizing various functions can be regarded as both a software module for realizing the method and a structure within a hardware component.

[0136] The present invention is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are used to generate It is a device that implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

[0137] These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device , The instruction device realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

[0138] These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so that the computer or other programmable equipment The instructions executed above provide steps for implementing functions specified in a flow or multiple flows in the flowchart and/or a block or multiple blocks in the block diagram.

[0139] In a typical configuration, the computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

[0140] The memory may include non-permanent memory in a computer readable medium, random access memory (RAM) and/or non-volatile memory, etc., such as read only memory (ROM) or flash memory (flash RAM). Memory is an example of computer readable media.

[0141] Computer-readable media including permanent and non-permanent, removable and non-removable media can be implemented by any method or technology for information storage. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical storage, Magnetic cassettes, magnetic tape magnetic disk storage, graphene storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices. According to the definition in this article, computer-readable media does not include transitory media, such as modulated data signals and carrier waves.

[0142] Those skilled in the art should understand that one or more embodiments of the present invention can be provided as a method, a system, or a computer program product. Therefore, the present one or more embodiments may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present one or more embodiments may adopt computer program products implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes. form.

[0143] The present one or more embodiments may be generalized on computer-executable instructions executed by a computer

Described below, for example, program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. One or more embodiments of the present invention can also be practiced in a distributed computing environment. In these distributed computing environments, tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules can be located in local and remote computer storage media including storage devices.

[0144] The various embodiments in this disclosure are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, as for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the part of the description of the method embodiment. In this description, descriptions with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" etc. mean the specific features described in conjunction with the embodiment or example, The structure, material, or feature is included in at least one embodiment or example of the present invention. In this context, the schematic representations of the above-mentioned terms do not necessarily refer to the same embodiment or example. Moreover, the described specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art can combine and combine the different embodiments or examples and the features of the different embodiments or examples described in the present invention without contradicting each other.

[0145] The foregoing descriptions are only examples of one or more embodiments of the present specification, and are not intended to limit one or more embodiments of the present specification. For those skilled in the art, the one or more embodiments may have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included in the scope of the claims.