WO2020224138A1

WO2020224138A1 - Blockchain technology-based multi-party authorization method and device

Info

Publication number: WO2020224138A1
Application number: PCT/CN2019/104329
Authority: WO
Inventors: 何军
Original assignee: 平安科技（深圳）有限公司
Priority date: 2019-05-07
Filing date: 2019-09-04
Publication date: 2020-11-12
Also published as: CN110224984A

Abstract

The present application relates to the technical field of blockchain technology, and provided in embodiments of the present application are a blockchain technology-based multi-party authorization method and device. The method comprises: obtaining an authorization request uploaded by an authorized party, wherein the authorization request is associated with a plurality of authorizing parties; in response to the authorization request, obtaining an authorization data package uploaded by a main authorizing party among the plurality of authorizing parties, the uploaded authorization data package utilizing a first key for encryption, the first key comprising a plurality of sub-keys, and each sub-key corresponding to an authorizing party; obtaining a plurality of sub-keys uploaded by the authorized party; splicing the plurality of sub-keys by means of a preset algorithm to obtain a second key; and matching the second key with the first key; and when matching is successful, decrypting the authorization data package and authorizing same to the authorized party. The technical solution provided in the embodiments of the present application may solve the problem in the prior art which relates to data security of multi-party authorization being low.

Description

A multi-party authorization method and device based on blockchain technology

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on May 07, 2019, the application number is 201910374338.6, and the application name is "a method and device for multi-party authorization based on blockchain technology", all of which are approved The reference is incorporated in this application.

【Technical Field】

This application relates to the field of blockchain technology, in particular to a multi-party authorization method and device based on blockchain technology.

【Background technique】

At present, the authorization of data on the blockchain is usually one-to-one. However, in individual needs, multiple nodes are required to complete the authorization of a node before the authorization is successful. At this time, the one-to-one authorization scheme It cannot meet the needs. Therefore, how to ensure the security of data in the multi-party authorization situation has become an urgent problem to be solved.

【Content of Application】

In view of this, the embodiments of the present application provide a multi-party authorization method and device based on blockchain technology to solve the problem of low data security related to multi-party authorization in the prior art.

In order to achieve the above objective, according to one aspect of the present application, a multi-party authorization method based on blockchain technology is provided, and the method includes:

Acquiring an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorizing parties; in response to the authorization request, acquiring the authorization data package uploaded by a primary authorizer among the multiple authorized parties, Wherein, the uploaded authorization data package is encrypted using a first key, and the first key includes a plurality of sub-keys, and each of the sub-keys corresponds to one of the authorized parties; obtaining the A plurality of said subkeys uploaded by an authorized party; a plurality of said subkeys are spliced by a preset algorithm to obtain a second key; the second key is matched with the first key, When the matching is successful, the authorized data packet is decrypted and authorized to the authorized party.

In order to achieve the above object, according to one aspect of the present application, a multi-party authorization device based on blockchain technology is provided. The device includes a first obtaining unit for obtaining an authorization request uploaded by an authorized party, wherein the The authorization request is associated with multiple authorized parties; the second obtaining unit is configured to, in response to the authorization request, obtain the authorization data package uploaded by the primary authorized party among the multiple authorized parties, wherein the uploaded The authorization data packet is encrypted using a first key, and the first key includes a plurality of subkeys, and each of the subkeys corresponds to one of the authorized parties; the third obtaining unit is configured to obtain the A plurality of said sub-keys uploaded by the authorized party; a splicing unit for splicing a plurality of said sub-keys by a preset algorithm to obtain a second key; a matching unit for combining the second secret The key is matched with the first key, and when the match is successful, the authorized data packet is decrypted and authorized to the authorized party.

In order to achieve the foregoing objective, according to one aspect of the present application, a computer non-volatile storage medium is provided. The storage medium includes a stored program. When the program is running, the device where the storage medium is located is controlled to execute the foregoing Multi-party authorization method of blockchain technology.

In order to achieve the above objective, according to one aspect of the application, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and running on the processor, and the processor executes all The computer program implements the steps of the above-mentioned multi-party authorization method based on blockchain technology.

In this solution, multiple sub-keys obtained by splitting the keys are sent to the authorized party through the sub-key manager (that is, the authorized party). When all the sub-keys are spliced together, the second key Only when the key can unlock the data packet encrypted by the first key can the authorized party obtain the data, thereby improving the security of the data in the blockchain.

【Explanation of drawings】

In order to explain the technical solutions of the embodiments of the present application more clearly, the following will briefly introduce the drawings needed in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, without creative labor, other drawings can be obtained from these drawings.

Fig. 1 is a flowchart of an optional multi-party authorization method based on blockchain technology provided by an embodiment of the present application;

2 is a schematic diagram of an optional multi-party authorization device based on blockchain technology provided by an embodiment of the present application;

Fig. 3 is a schematic diagram of an optional computer device provided by an embodiment of the present application.

【Detailed ways】

In order to better understand the technical solutions of the present application, the following describes the embodiments of the present application in detail with reference to the accompanying drawings.

It should be clear that the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

The terms used in the embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to limit the present application. The singular forms of "a", "said" and "the" used in the embodiments of the present application and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.

It should be understood that the term "and/or" used in this article is only an association relationship describing associated objects, which means that there can be three relationships. For example, A and/or B can mean that there is A alone, and both A and B, there are three cases of B alone. In addition, the character "/" in this text generally indicates that the associated objects before and after are in an "or" relationship.

It should be understood that although the terms first, second, third, etc. may be used to describe terminals in the embodiments of the present application, these terminals should not be limited to these terms. These terms are only used to distinguish terminals from each other. For example, without departing from the scope of the embodiments of the present application, the first obtaining unit may also be referred to as the second obtaining unit, and similarly, the second obtaining unit may also be referred to as the first obtaining unit.

Depending on the context, the word "if" as used herein can be interpreted as "when" or "when" or "in response to determination" or "in response to detection". Similarly, depending on the context, the phrase "if determined" or "if detected (statement or event)" can be interpreted as "when determined" or "in response to determination" or "when detected (statement or event) )" or "in response to detection (statement or event)".

Fig. 1 is a flowchart of a multi-party authorization method based on blockchain technology according to an embodiment of the present application. As shown in Fig. 1, the method includes:

Step S101: Obtain an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorized parties.

Step S102, in response to the authorization request, obtain the authorization data package uploaded by the main authorizer among the multiple authorization parties, where the uploaded authorization data package is encrypted using a first key, and the first key includes multiple subkeys, Each subkey corresponds to an authorized party.

Step S103: Obtain multiple subkeys uploaded by the authorized party.

In step S104, a plurality of sub-keys are spliced by a preset algorithm to obtain a second key.

In step S105, the second key is matched with the first key. When the matching is successful, the authorization data packet is decrypted and authorized to the authorized party.

In this solution, multiple sub-keys obtained by splitting the keys are sent to the authorized party through the sub-key manager (that is, the authorized party). When all the sub-keys are spliced together, the second key When the key can unlock the data packet encrypted by the first key, the authorized party can obtain the data, thereby improving the security of the data in the blockchain.

Understandably, if a certain authorized party's subkey is missing or a certain subkey is incorrect among the multiple subkeys, the second key that matches the first key cannot be restored. For example, the call of a certain contract document requires multiple approvers to authorize. After the main custodian of the contract document is authorized, the remaining approvers need to authorize their subkeys to the caller one by one. After the caller collects the subkeys, Only then can the called contract file be opened.

Optionally, before obtaining the authorization data package uploaded by the main authorizer among the multiple authorizers in response to the authorization request, the method includes: in response to the authorization request, generating a first key; the first key includes a plurality of subkeys , The subkey is a hash value obtained by hashing the identity information of an authorized party; each subkey in the first key is marked with an identifier corresponding to an authorized party. In this embodiment, the authorizing party's identity information may be the authorizing party's name, ID identification, mailbox, and other unique identity information bound to the authorizing party.

Hashing, also called hashing, is to transform an input of any length into a fixed-length output through a hashing algorithm, and the output is the hash value. According to the length of the hash operation result, the hash operation can be divided into multiple types, such as 16-bit hash operation, 32-bit hash operation, and 128-bit hash operation. In this embodiment, each subkey is a 32-bit hash value. For example, the first key is a 128-bit hash sequence, which is divided into a first subkey of 1 to 32 bits and a first subkey of 33 to 64 bits. Two subkeys, a third subkey of 65 to 96 bits, and a fourth subkey of 97 to 128 bits.

In other embodiments, the subkey includes a shared hash value and a private hash value. For example, the subkey is a 32-bit hash value, where the first 16 bits of the hash value are the shared hash value, and the last 16 bits of the hash value are the private hash value obtained by hashing the identity information of each authorized party. The shared hash value is a hash value obtained by hashing the identity information of the authorization data packet. For example, the number of the contract to be authorized, or the name of the document to be authorized. By setting the shared hash value, after decryption, it can be consistent with the data to be authorized to avoid packet loss or authorization errors in the authorized data.

Optionally, the hash operation includes any one of a message digest algorithm and a standard algorithm for secure messy information, all of which have good compressibility, collision resistance, and modification resistance, and are easy to calculate. It can be understood that because the hash operation has the irreversible feature, that is, the original string before the operation cannot be recovered through the hash sequence. Therefore, the third party cannot obtain the identity information of multiple authorized parties of the authorized data package, and cannot steal the authorized data package through private authorization, thereby protecting the security of the authorized data package.

Optionally, the method of concatenating multiple subkeys to obtain the second key by using a preset algorithm includes:

It is determined whether the number of subkeys uploaded by the authorized party is the same as the number of subkeys in the first key; if they are the same, the uploaded subkeys are spliced according to the identifier of the authorized party to obtain the second key.

In this embodiment, the subkey uploaded by the authorized party is provided with an identifier, and the subkey is matched with the subkey with the same identifier in the first key according to this identifier. For example, the complete sequence of the first key is A (first subkey) + B (second subkey) + C (third subkey) + D (fourth subkey), then according to the subkey The sequence of the key identifiers is to splice the sub-keys. If C is missing, then the complete hash sequence cannot be spliced. If the sequence is inconsistent, the first key and the second key cannot be matched successfully. During the sub-key matching process, A (first sub-key) matches the sequence of part A in the complete sequence of the first key. If the matching is successful, it means that the authorization of the authorized party is successful. When the subkeys of the four authorized parties of A, B, C, and D are all matched successfully, the authorization data packet can be decrypted and authorized successfully.

Optionally, before obtaining multiple subkeys uploaded by the authorized party, the method further includes:

Use the public key of the authorizing party to encrypt the subkeys corresponding to the authorizing party in the first key one by one; send the second encrypted first key to each authorizing party, where the authorizing party will be able to The subkey decrypted with the private key is sent to the authorized party, and the private key and the public key are a pair of asymmetric keys of the authorized party. Understandably, when the system distributes the sub-key in the first key, the sub-key to be distributed is encrypted with the public key of the recipient, so even if the sub-key is acquired by other nodes This subkey cannot be opened to obtain the correct hash sequence. Only the party who owns the private key paired with the public key can decrypt the subkey and obtain the correct hash sequence.

In an embodiment, after the multiple subkeys of the first key are respectively encrypted by corresponding public keys, the encrypted complete first key can be sent to each authorized party, or the first key can be The subkey associated with the authorizing party ID is sent to the authorizing party separately. Understandably, in the above-mentioned sub-key distribution method, the authorized party can only use the private key to decrypt one of the sub-keys, thereby further ensuring the security of the authorized data package.

Optionally, before obtaining the authorization data package uploaded by the main authorizer among the multiple authorizers in response to the authorization request, the method further includes: in response to the authorization request, generating the first key K ₁ , and the first key K ₁ Used to encrypt the authorization data package uploaded by the main authorizer; take n random numbers a ₀ ,..., a _n-1 , and construct a linear polynomial a(x) = a ₀ + a ₁ x + a ₂ x ² +…+a _n-1 x ^n-1 , where a ₀ =K ₁ , x takes the value [1,n+1], and x and n are integers greater than or equal to 1; randomly select a prime number p, p > K ₁ , let the remainder function f(x)=a(x)mod(p), and sequentially bring x into the preset function to obtain f(x ₁ ),..., f(x _n+1 ); The sub-keys (x ₁ , f(x ₁ )), ..., the sub-keys (x _n+1 , f(x _n+1 )) are distributed to n+1 authorized parties.

Among them, the remainder function is the remainder operation on the prime number p after calculating the result of the linear polynomial, and each subkey can be calculated by the specific value of x. For example: x ₁ is 1, x ₂ is 2, x ₃ is 3, then f(x ₁ ) is (a ₀ +a ₁ )mod(p), f(x ₂ ) is (a ₀ +2a ₁ )mod (p), f(x ₃ ) is (a ₀ +3a ₁ +9a ₂ ) mod(p).

In this embodiment, random numbers, prime numbers, and preset calculation methods are used to automatically generate the required number of sub-keys for the first key K _{1. The} generated sub-keys are highly secure and difficult to be cracked, thereby guaranteeing authorized data Security of the package.

Optionally, the method of splicing multiple sub-keys through a preset algorithm to obtain the second key includes: recovering the multiple sub-keys by using a Lagrangian interpolation formula to obtain the second key.

The embodiment of the application provides a multi-party authorization device based on blockchain technology. The device is used to execute the above-mentioned multi-party authorization method based on blockchain technology. As shown in FIG. 2, the device includes: a first obtaining unit 10, The second acquiring unit 20, the third acquiring unit 30, the splicing unit 40, and the matching unit 50.

The first obtaining unit 10 is configured to obtain an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorized parties;

The second acquiring unit 20 is configured to, in response to the authorization request, acquire the authorization data package uploaded by the main authorizer among the multiple authorization parties, where the uploaded authorization data package is encrypted using a first key, and the first key includes Multiple sub-keys, each sub-key corresponds to an authorized party;

The third obtaining unit 30 is configured to obtain multiple subkeys uploaded by the authorized party;

The splicing unit 40 is used for splicing multiple sub-keys using a preset algorithm to obtain a second key;

The matching unit 50 is configured to match the second key with the first key. When the matching is successful, the data packet is authorized to be decrypted and authorized to the authorized party.

Optionally, the device further includes: a first generating unit and a labeling unit.

The first generating unit is configured to generate a first key in response to the authorization request before obtaining the authorization data package uploaded by the main authorizer among the multiple authorized parties. The first key includes multiple sub-keys, and the sub-keys are A hash value obtained by hashing the identity information of an authorizing party; the labeling unit is used to label each subkey in the first key with an identity of the authorizing party. In this embodiment, the authorizing party's identity information may be the authorizing party's name, ID identification, mailbox, and other unique identity information bound to the authorizing party.

In other embodiments, the subkey includes a shared hash value and a private hash value. For example, the subkey is a 32-bit hash value, where the first 16-bit hash value is a shared hash value, and the last 16-bit hash value is a private hash value obtained by hashing the identity information of each authorized party. The shared hash value is a hash value obtained by hashing the identity information of the authorization data packet. For example, the number of the contract to be authorized, or the name of the document to be authorized. By setting the shared hash value, after decryption, it can be consistent with the data to be authorized to avoid packet loss or authorization errors in the authorized data.

Optionally, the hash operation includes any of the information-digest algorithm 5, the information-digest algorithm 4, and the standard algorithm for secure messy information, all of which have good compressibility, collision resistance, and modification resistance, and are easy to calculate . It can be understood that because the hash operation has the irreversible feature, that is, the original string before the operation cannot be recovered through the hash sequence. Therefore, the third party cannot obtain the identity information of multiple authorized parties of the authorized data package, and cannot steal the authorized data package through private authorization, thereby protecting the security of the authorized data package.

Optionally, the splicing unit 40 includes a determining subunit and a matching subunit.

The determining sub-unit is used to determine whether the number of sub-keys uploaded by the authorized party is the same as the number of sub-keys in the first key; the matching sub-unit is used to upload the sub-keys according to the identifier of the authorized party if they are the same. The keys are spliced to obtain the second key.

Optionally, the device further includes an encryption unit and a sending unit.

The encryption unit is used to use the public key of the authorized party to perform secondary encryption on the sub-keys corresponding to the authorized party in the first key one by one before obtaining the multiple sub-keys uploaded by the authorized party; the sending unit uses Send the second encrypted first key to each authorized party, where the authorized party sends the sub-key that can be decrypted with the private key to the authorized party, and the private key and public key are a pair of asymmetrical Key.

Understandably, when the system distributes the sub-key in the first key, the sub-key to be distributed is encrypted with the public key of the recipient, so even if the sub-key is acquired by other nodes This subkey cannot be opened to obtain the correct hash sequence. Only the party who owns the private key paired with the public key can decrypt the subkey and obtain the correct hash sequence.

Optionally, the device further includes a second generating unit, a construction unit, a setting unit, and a distribution unit.

The second generating unit is used to generate the first key K ₁ in response to the authorization request, the first key K _{1 is} used to encrypt the authorization data package uploaded by the main authorizer; the construction unit is used to take n Random numbers a ₀ ,..., a _n-1 , and construct a linear polynomial a(x)=a ₀ +a ₁ x+a ₂ x ² +...+a _n-1 x ^n- ¹ , where a ₀ ＝K ₁ , X takes the value [1,n+1], n is an integer greater than 1; the setting unit is used to randomly select a prime number p, p>K ₁ , and let the remainder function f(x)=a(x)mod( p), and sequentially bring x into the remainder function to obtain f(x ₁ ),..., f(x _n+1 ); the distribution unit is used to transfer the subkey (x ₁ , f(x ₁ )) ,..., subkeys (x _n+1 , f(x _n+1 )) are allocated to n+1 authorized parties.

Among them, the remainder function is the remainder operation on the prime number p after calculating the result of the linear polynomial, and each subkey can be calculated by the specific value of x. For example: x ₁ is 1, x ₂ is 2, x ₃ is 3, then f(x ₁ ) is (a ₀ +a ₁ )mod(p), f(x ₂ ) is (a ₀ +2a ₁ )mod (p), f(x ₃ ) is (a ₀ +3a ₁ +9a ₂ )mod(p).

The embodiment of the present application provides a computer non-volatile storage medium, the storage medium includes a stored program, wherein the device where the storage medium is located is controlled to perform the following steps when the program runs:

Obtain the authorization request uploaded by the authorized party, where the authorization request is associated with multiple authorizers; in response to the authorization request, obtain the authorization data package uploaded by the main authorizer among the multiple authorized parties, where the uploaded authorization data package uses The first key performs encryption processing. The first key includes multiple sub-keys, and each sub-key corresponds to an authorized party; obtains multiple sub-keys uploaded by the authorized party; performs multiple sub-keys through a preset algorithm Splice to obtain the second key; match the second key with the first key, and when the matching is successful, the authorization data packet is decrypted and authorized to the authorized party.

Optionally, when the program is running, the device where the storage medium is located is controlled to perform the following steps: before obtaining the authorization data package uploaded by the primary authorizer among the multiple authorizers in response to the authorization request, generate the first key in response to the authorization request ; The first key includes a plurality of sub-keys, the sub-key is a hash value obtained through a hash operation of the identity information of an authorized party; each sub-key in the first key is associated with the identity of the corresponding authorized party United.

Optionally, when the program is running, the device where the storage medium is located is controlled to perform the following steps: the hash operation includes any one of the information-digest algorithm 5, the information-digest algorithm 4, and the standard algorithm for secure messy information.

Optionally, when the program is running, controlling the device where the storage medium is located to execute the splicing of multiple subkeys using a preset algorithm to obtain the second key includes the following steps: determining the number of subkeys uploaded by the authorized party and the first key Whether the number of sub-keys in is the same; if they are the same, the uploaded sub-keys are spliced according to the identifier of the authorized party to obtain the second key.

Optionally, when the program is running, the device where the storage medium is located is controlled to perform the following steps: before obtaining multiple sub-keys uploaded by the authorized party, use the public key of the authorized party to pair the first key corresponding to the authorized party The sub-keys of, are re-encrypted one by one; the first key after the second encryption is sent to each authorized party, where the authorized party sends the sub-key that can be decrypted with the private key to the authorized party, and the private key is The public key is a pair of keys of the authorized party.

Fig. 3 is a schematic diagram of a computer device provided by an embodiment of the present application. As shown in FIG. 3, the computer device 100 of this embodiment includes a processor 101, a memory 102, and a computer program 103 that is stored in the memory 102 and can run on the processor 101. When the computer program 103 is executed by the processor 101, To implement the multi-party authorization method based on blockchain technology in the embodiment, in order to avoid repetition, it will not be repeated here. Alternatively, when the computer program is executed by the processor 101, the function of each model/unit in the multi-party authorization device based on the blockchain technology in the embodiment is realized. To avoid repetition, it will not be repeated here.

The computer device 100 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. The computer device may include, but is not limited to, a processor 101 and a memory 102. Those skilled in the art can understand that FIG. 3 is only an example of the computer device 100 and does not constitute a limitation on the computer device 100.

The so-called processor 101 may be a central processing unit (Central Processing Unit, CPU), other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.

The memory 102 may be an internal storage unit of the computer device 100, such as a hard disk or memory of the computer device 100. The memory 102 may also be an external storage device of the computer device 100, such as a plug-in hard disk equipped on the computer device 100, a smart memory card (Smart Media Card, SMC), a Secure Digital (SD) card, and a flash memory card (Flash). Card) and so on. Further, the memory 102 may also include both an internal storage unit of the computer device 100 and an external storage device. The memory 102 is used to store computer programs and other programs and data required by the computer equipment. The memory 102 can also be used to temporarily store data that has been output or will be output.

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process of the above-described system, device, and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, 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 may be combined Or it can be integrated into 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 indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.

The above-mentioned integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The above-mentioned software functional unit is stored in a storage medium and includes several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (Processor) execute the method described in each embodiment of the present application Part of the steps. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code .

The above are only the preferred embodiments of this application and are not intended to limit this application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included in this application Within the scope of protection.

Claims

A multi-party authorization method based on blockchain technology, characterized in that the method includes:

Obtaining an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorized parties;

In response to the authorization request, obtain the authorization data package uploaded by the primary authorizer among the multiple authorization parties, wherein the uploaded authorization data package is encrypted using a first key, and the first secret The key includes multiple sub-keys, and each of the sub-keys corresponds to one of the authorized parties;

Acquiring a plurality of said subkeys uploaded by said authorized party;

Concatenate the multiple sub-keys by a preset algorithm to obtain a second key;

The second key is matched with the first key, and when the matching is successful, the authorized data packet is decrypted and authorized to the authorized party.
The method according to claim 1, characterized in that, before the obtaining the authorization data package uploaded by the primary authorizer among the plurality of authorizers in response to the authorization request, the method comprises:

In response to the authorization request, the first key is generated, the first key includes a plurality of the sub-keys, and the sub-key is obtained by hashing the identity information of the authorized party Hash value

Each of the sub-keys in the first key is labeled with an identifier corresponding to the authorized party.
The method according to claim 2, wherein the hash operation includes any one of a message digest algorithm and a standard algorithm for secure messy information.
The method according to claim 2, wherein said concatenating a plurality of said sub-keys through a preset algorithm to obtain a second key comprises:

Determining whether the number of subkeys uploaded by the authorized party is the same as the number of subkeys in the first key;

If they are the same, the uploaded subkeys are spliced according to the identifier of the authorized party to obtain the second key.
The method according to claim 1, wherein before said obtaining the plurality of said subkeys uploaded by said authorized party, said method further comprises:

Use the public key of the authorizing party to perform secondary encryption on the subkeys corresponding to the authorizing party in the first key one by one;

Send the re-encrypted first key to each of the authorized parties, where the authorized party sends the subkey that can be decrypted with the private key to the authorized party, and the private key is the same as the authorized party. The public key is a pair of asymmetric keys of the authorized party.
The method according to claim 1, characterized in that, before the obtaining the authorization data package uploaded by the primary authorizer among the plurality of authorizers in response to the authorization request, the method further comprises:

In response to the authorization request, generating the first key K1, where the first key K1 is used to encrypt the authorization data package uploaded by the primary authorizer;

Take n random numbers a0,...,an-1, and construct a linear polynomial a(x)=a0+a1x+a2x2+...+an-1xn-1, where a0=K1, x takes the value [1,n+1 ], and x and n are integers greater than or equal to 1;

Randomly take a prime number p, p>K1, set the remainder function f(x)=a(x)mod(p), and bring x into the remainder function in turn to obtain f(x1),...,f(xn +1);

The subkeys (x1, f(x1)),..., the subkeys (xn+1, f(xn+1)) are distributed to n+1 authorized parties.
The method according to claim 6, wherein the method of concatenating a plurality of the sub-keys through a preset algorithm to obtain the second key comprises:

A Lagrangian interpolation formula is used to recover a plurality of the subkeys to obtain the second key.
A multi-party authorization device based on blockchain technology, characterized in that the device includes:

The first obtaining unit is configured to obtain an authorization request uploaded by an authorized party, wherein the authorization request is associated with multiple authorized parties;

The second acquiring unit is configured to, in response to the authorization request, acquire the authorization data package uploaded by the primary authorizer among the multiple authorization parties, wherein the uploaded authorization data package is encrypted with a first key Processing, the first key includes a plurality of subkeys, and each of the subkeys corresponds to one of the authorized parties;

The third obtaining unit is configured to obtain the multiple sub-keys uploaded by the authorized party;

A splicing unit, configured to splice a plurality of said sub-keys using a preset algorithm to obtain a second key;

The matching unit is configured to match the second key with the first key. When the matching is successful, the authorized data packet is decrypted and authorized to the authorized party.
The device according to claim 8, wherein the device further comprises a first generating unit and a labeling unit;

The first generating unit is configured to generate the first key in response to the authorization request before obtaining the authorization data package uploaded by the main authorizer among the plurality of authorized parties, and the first key The key includes a plurality of the subkeys, and the subkey is a hash value obtained by a hash operation of the identity information of the authorized party;

The labeling unit is configured to label each of the subkeys in the first key with an identifier corresponding to one of the authorized parties.
The device according to claim 9, wherein the hash operation includes any one of a message digest algorithm and a standard algorithm for secure messy information.
The device according to claim 9, wherein the splicing unit includes a determining subunit and a matching subunit;

The determining subunit is used to determine whether the number of subkeys uploaded by the authorized party is the same as the number of subkeys in the first key;

The matching subunit is configured to splice the uploaded subkeys according to the identifier of the authorized party if they are the same to obtain the second key.
The device according to claim 8, wherein the device further comprises an encryption unit and a sending unit;

The encryption unit is configured to use the public key of the authorizing party to pair the child corresponding to the authorizing party in the first key before obtaining the plurality of sub-keys uploaded by the authorized party. The key is encrypted twice one by one;

The sending unit is configured to send the second-encrypted first key to each of the authorized parties, where the authorized party sends the sub-key that can be decrypted with the private key to the authorized party, so The private key and the public key are a pair of asymmetric keys of the authorized party.
A computer device comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, wherein the processor implements the following steps when the processor executes the computer program:

Obtaining an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorized parties;

In response to the authorization request, obtain the authorization data package uploaded by the primary authorizer among the multiple authorization parties, wherein the uploaded authorization data package is encrypted using a first key, and the first secret The key includes multiple sub-keys, and each of the sub-keys corresponds to one of the authorized parties;

Acquiring a plurality of said subkeys uploaded by said authorized party;

Concatenate the multiple sub-keys by a preset algorithm to obtain a second key;

The second key is matched with the first key, and when the matching is successful, the authorized data packet is decrypted and authorized to the authorized party.
The computer device according to claim 13, wherein the execution of the computer program by the processor further implements the following steps:

Before the obtaining the authorization data package uploaded by the primary authorizer among the plurality of authorizing parties in response to the authorization request, the first key is generated in response to the authorization request, and the first The key includes a plurality of the sub-keys, and the sub-key is a hash value obtained by a hash operation of the identity information of the authorized party; and each of the sub-keys in the first key is The key is marked with an identifier corresponding to one of the authorized parties.
The computer device according to claim 14, wherein the execution of the computer program by the processor to realize the splicing of the plurality of sub-keys through a preset algorithm to obtain the second key comprises the following steps:

Determine whether the number of subkeys uploaded by the authorized party is the same as the number of subkeys in the first key; if they are the same, splice the uploaded subkeys according to the identifier of the authorized party , Get the second key.
The computer device according to claim 13, wherein the processor further implements the following steps when executing the computer program:

Before obtaining the plurality of subkeys uploaded by the authorized party, perform one-by-one operation on the subkeys corresponding to the authorized party in the first key using the public key of the authorized party Secondary encryption; sending the second-encrypted first key to each of the authorized parties, where the authorized party sends a subkey that can be decrypted with a private key to the authorized party, the The private key and the public key are a pair of asymmetric keys of the authorized party.
A computer non-volatile readable storage medium, the storage medium including a stored program, characterized in that, when the program is running, the device where the storage medium is located is controlled to perform the following steps:

Obtaining an authorization request uploaded by an authorized party, where the authorization request is associated with multiple authorized parties;

In response to the authorization request, obtain the authorization data package uploaded by the primary authorizer among the multiple authorization parties, wherein the uploaded authorization data package is encrypted using a first key, and the first secret The key includes multiple sub-keys, and each of the sub-keys corresponds to one of the authorized parties;

Acquiring a plurality of said subkeys uploaded by said authorized party;

Concatenate the multiple sub-keys by a preset algorithm to obtain a second key;

The second key is matched with the first key, and when the matching is successful, the authorized data packet is decrypted and authorized to the authorized party.
The computer non-volatile readable storage medium according to claim 17, wherein the device where the storage medium is located is controlled to perform the following steps when the program is running:

Before the obtaining the authorization data package uploaded by the primary authorizer among the plurality of authorizing parties in response to the authorization request, the first key is generated in response to the authorization request, and the first The key includes a plurality of the sub-keys, and the sub-key is a hash value obtained by a hash operation of the identity information of the authorized party; and each of the sub-keys in the first key is The key is marked with an identifier corresponding to one of the authorized parties.
The computer non-volatile readable storage medium according to claim 18, wherein when the program is running, the device in which the storage medium is located is controlled to execute the multiple of the subkeys through a preset algorithm. The splicing to obtain the second key includes the following steps:

Determine whether the number of subkeys uploaded by the authorized party is the same as the number of subkeys in the first key; if they are the same, splice the uploaded subkeys according to the identifier of the authorized party , Get the second key.
The computer non-volatile readable storage medium according to claim 17, wherein the device where the storage medium is located is controlled to perform the following steps when the program is running:

Before obtaining the plurality of subkeys uploaded by the authorized party, perform one-by-one operation on the subkeys corresponding to the authorized party in the first key using the public key of the authorized party Secondary encryption; sending the second-encrypted first key to each of the authorized parties, where the authorized party sends a subkey that can be decrypted with a private key to the authorized party, the The private key and the public key are a pair of asymmetric keys of the authorized party.