Threshold ring signature generation method and device

By generating the responses of vectors containing t elements and signature ring members, the problem that existing ring signature technology cannot generate signatures from multiple parties in distributed cryptographic application scenarios is solved, and the multi-party joint signature and threshold cryptography characteristics are realized, which is suitable for Distributed cryptography application scenarios and reduce signature size and transmission overhead.

CN119070991APending Publication Date: 2024-12-03HUAWEI TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202310629059.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-31
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

Existing ring signature technologies, such as AOS ring signature and DualRing ring signature, do not have the characteristics of threshold passwords, and cannot jointly generate signatures in distributed password application scenarios, and cannot be suitable for distributed password application scenarios.

Method used

By obtaining the random numbers and challenges of signature ring members and non-signature ring members in ring members, a vector containing t elements is generated, which is used to determine the challenges of signature ring members, and the response of signature ring members and the challenges of ring members are generated using the response of signature ring members and the challenges of ring members. Threshold ring signature realizes multi-party joint signature and has threshold cryptography characteristics.

Benefits of technology

It realizes that multiple ring members jointly generate signatures representing the entire ring, with threshold cryptography characteristics, and is suitable for distributed cryptography application scenarios, reducing the size and transmission overhead of threshold ring signatures, and improving security.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119070991A_ABST
    Figure CN119070991A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a threshold ring signature generation method and device, which can be suitable for a distributed password application scene. The method comprises the following steps: acquiring a random number corresponding to each signature ring member in t signature ring members in n ring members, and acquiring a first challenge corresponding to each non-signature ring member in n-t non-signature ring members in the n ring members; obtaining a first vector based on to-be-signed information, the random number corresponding to each signature ring member and the first challenge corresponding to each non-signature ring member; determining a first challenge corresponding to each signature ring member based on the first vector; and generating a threshold ring signature by using the response corresponding to each signature ring member and the first challenges corresponding to the n ring members.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of information technology, and in particular to a method and device for generating a threshold ring signature. Background Art

[0002] Ring signature is a cryptographic technology that can hide the identity of the signer. After the signature is generated, the verifier only knows that the signature comes from this ring, but does not know who the real signer is. Therefore, ring signature is widely used in privacy protection scenarios that require identity privacy, such as electronic voting and privacy-preserving cryptocurrency. However, the current ring signature method based on the Commercial Secret Algorithm No. 2 (SM2) and Commercial Secret Algorithm No. 9 (SM9) can only generate a signature representing the entire ring by a single ring member, and does not have the characteristics of threshold cryptography, that is, multiple parties cannot jointly generate a ring signature, and is not suitable for distributed cryptographic application scenarios. Summary of the invention

[0003] The embodiments of the present application provide a threshold ring signature generation method and device, which can be applicable to distributed cryptographic application scenarios.

[0004] In a first aspect, a threshold ring signature generation method is provided, the method comprising: obtaining a random number corresponding to each signature ring member of t signature ring members among n ring members, and obtaining a first challenge corresponding to each non-signature ring member of nt non-signature ring members among the n ring members; wherein 1<t<n, and the first challenge corresponding to each non-signature ring member is randomly selected by at least one signature ring member among the t signature ring members; obtaining a first vector based on information to be signed, the random number corresponding to each signature ring member, and the first challenge corresponding to each non-signature ring member, wherein the first vector includes t elements; determining the first challenge corresponding to each signature ring member based on the first vector; generating a threshold ring signature using a response corresponding to each signature ring member and the first challenge corresponding to the n ring members, wherein the response corresponding to the first signature ring member is determined by the first signature ring member based on the first challenge corresponding to the first signature ring member, a private key, and the random number, and the first signature ring member is any one of the signature ring members.

[0005] In the embodiment of the present application, the first vector obtained by the information to be signed, the random number corresponding to each signature ring member and the challenge corresponding to each non-signature ring member can be used to determine the first challenge corresponding to the t signature ring members, and then the response corresponding to each signature ring member can be obtained based on the first challenge corresponding to the signature ring member, and the threshold ring signature can be generated based on the response corresponding to each signature ring member and the challenge corresponding to n ring members. It can be seen that the embodiment of the present application can allow multiple ring members to jointly initiate a signature representing the entire ring, achieve the effect of multi-party joint signature, and enable the ring signature to have the characteristics of threshold cryptography, which can be applicable to distributed cryptographic application scenarios.

[0006] In a possible implementation manner, determining the first challenge corresponding to each signature ring member based on the first vector complies with the following formula:

[0007]

[0008] Where t is the number of signature ring members, n is the number of ring members, h1,h2,…,h t is the element in the first vector, c n is the challenge corresponding to the nth ring member. In the above technical solution, the equation group constructed in the above manner can make the unknown number have a solution, so that the first challenge corresponding to each signature ring member can be calculated.

[0009] In a possible implementation, obtaining a first vector based on the information to be signed, a random number corresponding to each signature ring member, and a first challenge corresponding to each non-signature ring member includes: obtaining a first commitment based on the random number corresponding to each signature ring member, a public key corresponding to each non-signature ring member, and the first challenge, wherein the public key corresponding to each non-signature ring member belongs to a public key set, and the public key set is a set formed by the public keys corresponding to the n ring members; and performing a hash operation on the information to be signed, the first commitment, the public key set, and t to obtain the first vector.

[0010] In the above technical scheme, a commitment ring R (first commitment) can be formed by the random numbers corresponding to the signature ring members, the public keys corresponding to the non-signature ring members and the first challenge, and t challenge rings C can be obtained by performing a hash operation on the commitment ring R, and t elements constituting the first vector can be obtained, so that the missing t first challenges can be calculated based on these t elements.

[0011] In a possible implementation, generating a threshold ring signature using responses corresponding to each signature ring member and first challenges corresponding to the n ring members includes: merging responses corresponding to the t signature ring members; and generating the threshold ring signature using the merged responses and first challenges corresponding to the n ring members.

[0012] In the above technical solution, merging t responses can reduce the size of the threshold ring signature, thereby reducing the transmission overhead of the threshold ring signature.

[0013] In a possible implementation, before generating a threshold ring signature using the responses respectively corresponding to each signature ring member and the first challenges respectively corresponding to the n ring members, the method further includes: sending a first request to each signature ring member, where the first request is used to request a response, and the first request sent to the first signature ring member includes a first challenge corresponding to the first signature ring member; and receiving a response from each signature ring member.

[0014] In the above technical solution, since the private key of each ring member is not public, and the generated threshold ring signature needs to utilize the private key of the signature ring member, the calculated first challenge can be sent to the corresponding signature ring member to obtain a response for generating the threshold ring signature.

[0015] In a possible implementation, the method further includes: compressing the first challenges corresponding to the n ring members respectively using a zero-knowledge proof algorithm; generating a threshold ring signature using the responses corresponding to each signature ring member and the first challenges corresponding to the n ring members respectively, including: generating a threshold ring signature using the responses corresponding to each signature ring member and the compressed first challenge.

[0016] In the above technical solution, the n first challenges are compressed using a zero-knowledge proof algorithm, so that the accumulator does not need to be involved in the signing process, which helps to improve the security of the threshold ring signature. And the n first challenges are compressed using a zero-knowledge proof algorithm to reduce the size of the threshold ring signature, thereby reducing the transmission overhead of the threshold ring signature.

[0017] In a second aspect, a threshold ring signature generation device is provided, and the threshold ring signature generation device is used to implement the above-mentioned first aspect or any one of the methods in the first aspect. The threshold ring signature generation device includes corresponding functional modules, which are respectively used to implement the steps in the above method. The functions can be implemented by hardware, or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions.

[0018] In a third aspect, an embodiment of the present application provides a computing device cluster, the computing device cluster comprising at least one computing device, each computing device comprising a processor and a memory;

[0019] The processor of the at least one computing device is used to execute instructions stored in the memory of the at least one computing device, so that the computing device cluster executes any possible method as described in the first aspect.

[0020] In a fourth aspect, an embodiment of the present application provides a computer program product comprising instructions, which, when executed by a computing device cluster, enables the computing device cluster to execute any possible method as described in the first aspect.

[0021] In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, which includes computer program instructions. When the computer program instructions are executed by a computing device cluster, the computing device cluster executes any possible method as in the first aspect.

[0022] In a sixth aspect, an electronic device is provided, comprising: one or more processors; one or more memories; wherein the one or more memories store one or more computer instructions, and when the one or more computer instructions are executed by the one or more processors, the electronic device executes a method as described in any one of the above-mentioned first aspects.

[0023] In a seventh aspect, the present application provides a chip, comprising a processor, wherein the processor is coupled to a memory and is used to read and execute a software program stored in the memory to implement any of the methods described in the first aspect above.

[0024] For the beneficial effects of the second to seventh aspects above, please refer to the beneficial effects of the first aspect and will not be repeated. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 This is a structural diagram of an AOS ring signature;

[0026] Figure 2 It is a structural diagram of an elliptical ring signature;

[0027] Figure 3 A schematic diagram of the structure of a signature system provided in an embodiment of the present application;

[0028] Figure 4 A schematic diagram of the structure of another signature system provided in an embodiment of the present application;

[0029] Figure 5 A flowchart of a threshold ring signature generation method provided in an embodiment of the present application;

[0030] Figure 6 A flowchart of another method for generating a threshold ring signature provided in an embodiment of the present application;

[0031] Figure 7 A structural block diagram of a threshold ring signature generation device provided in an embodiment of the present application;

[0032] Figure 8 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application;

[0033] Fig. 9 A computing device provided in an embodiment of the present application;

[0034] Fig.10 A computing device cluster provided in an embodiment of the present application;

[0035] Fig.11 Another computing device cluster provided in an embodiment of the present application. DETAILED DESCRIPTION

[0036] The technical scheme in the embodiment of the present application will be described below in conjunction with the accompanying drawings in the embodiment of the present application. The embodiment of the present application can be applied to distributed cryptographic application scenarios such as blockchain. For ease of understanding, some terms in the embodiment of the present application are explained below.

[0037] (1) Ring signature: Each member in a ring signature is called a ring member. Each ring member has a pair of secret keys, including a public key and a private key. The public key can be made public and used to verify the signature, while the private key is kept by the ring member and used for signing. Ring signatures include: AOS ring signature, elliptical ring (DualRing) ring signature, etc.

[0038] (2) AOS ring signature. The structure of AOS ring signature is as follows Figure 1 As shown in the figure, the AOS ring signature is obtained by first calculating n-1 "pseudo-signatures" in sequence, and then using the private key of the signature ring member to create a real signature, resulting in n signatures included in the AOS ring signature. The mathematical theory used by the AOS ring signature to form a ring is: x =H(m,z x-1 *G+c x-1 *pk x-1 ). Where c is the challenge, z is the response, m is the message to be signed, G is the base point on the elliptic curve, and pk is the public key.

[0039] AOS ring signature can be constructed based on two types of signatures: type-h (one-way hash type, such as RSA signature) and type-t (three-step type, such as Schnorr signature). Among them, type-t signature involves the following three functions in the signing process: commitment function A, used to output commitment R; hash function H, used to output challenge C; response function Z, used to output response z. Taking the construction of AOS signature based on type-t signature as an example, the signature ring member (for example, the jth ring member) can generate an AOS ring signature through the following steps:

[0040] S11: Signature ring member j selects a random number r j , and generate commitment R through commitment function A j .

[0041] S12: Signature ring member j uses hash function H according to commitment R j Calculate the j+1th challenge c j+1 .

[0042] S13: For i=j+1,…,n,1,…,j-1, signature ring member j can use the verification function V according to the public key pk corresponding to the i-th ring member. i and the response z corresponding to the i-th ring member randomly selected by signature ring member j i Reconstruct the i-th commitment R i , and use the hash function H based on R i Calculate the i+1th challenge c i+1 .

[0043] S14: Signature ring member j uses response function Z according to its private key sk j 、c j and r j Calculate z j Among them, the AOS ring signature consists of a challenge c and n responses (z1, z2, ..., z n ), for example, the final generated AOS ring signature is (c1, z1, z2, …, z n ).

[0044] (3) DualRing signature. The structure of DualRing signature is as follows: Figure 2 As shown, the DualRing ring signature includes two rings, a commitment ring R and a challenge ring C. The DualRing ring signature can be constructed based on the type-t signature, and before constructing based on the type-t signature, the verification function V in the type-t signature can be decomposed as follows:

[0045] V(pk,z,c)=V1(z)⊙V2(pk,c)

[0046] Among them, V1 is verification function 1, V2 is verification function 2, and ⊙ is a group operation (for example, including modular multiplication and modular addition).

[0047] A signature ring member (for example, the jth ring member) can generate a DualRing signature by following the steps below:

[0048] S21: Signature ring member j selects a random number r j .

[0049] S22: Signature ring member j selects n-1 challenges c1, c2, …, c j-1 , c j+1 , …, c n . Where n is the number of ring members.

[0050] S23: Signature ring member j uses verification function 2 and commitment function A to perform group operation to form R ring. The formula for forming R ring is as follows:

[0051] R=A(r j )⊙V2(pk j+1 ,c j+1 )⊙…⊙V2(pk n ,c n )⊙V2(pk1,c1)⊙…⊙V2(pk j-1 ,c j-1 )

[0052] S24: Signature ring member j uses group operation Form a C ring and calculate the missing challenge c by the following formula j :

[0053]

[0054] in, for PK is the inverse operation of n ring members, where PK is the public key set formed by the public keys of n ring members.

[0055] S25: Signature ring member j uses response function Z according to its private key sk j 、c j and r j Calculate z j Among them, the DualRing ring signature consists of a response z and n challenges c (c1, c2, ..., c n ), for example, the final generated DualRing signature is (z j , c1, c2, …, c n ).

[0056] (4) Signature ring member refers to the ring member that initiates the ring signature. In the embodiment of the present application, in order to have the characteristics of threshold cryptography, the threshold ring signature can be initiated by at least two ring members. The threshold ring signature requires that the total number of signature ring members is greater than a preset threshold. The preset threshold is used to indicate the number of signature participants. The present application does not limit its specific number. For example, the preset threshold is 3. And the ring members that do not participate in initiating the threshold ring signature are non-signature ring members.

[0057] (5) Threshold ring signature (TRS) refers to a ring signature generated by multiple signature ring members using their own private keys for the same message. When generating a threshold ring signature, the number of ring members and the number of signature ring members are public.

[0058] (6) Accumulators can accumulate all elements in a set and efficiently provide proof of (non-)membership of any element, that is, whether the element exists in the set. Accumulators can be applied to scenarios such as group signatures, ring signatures, anonymous credentials, timestamps, and outsourced data verification. When accumulators are applied to generate threshold ring signatures, accumulators can compress multiple public keys into one value to reduce the size of the signature.

[0059] (7) Zero-knowledge proof refers to the ability of the prover to convince the verifier that a certain assertion is correct without providing any useful information to the verifier. Zero-knowledge proof is a probability-based verification method. The verifier asks the prover questions based on a certain degree of randomness. If the prover can give the correct answer, it means that the prover has the "knowledge" he claims with a high probability. Zero-knowledge proof is not a proof in the mathematical sense, because it has a small probability of error, and a cheating prover may deceive the verifier through false statements. In other words, zero-knowledge proof is a probabilistic proof rather than a deterministic proof, but there are also technologies that can reduce the error to a negligible value. Zero-knowledge proof includes interactive zero-knowledge proof and non-interactive zero-knowledge proof. Among them, for interactive zero-knowledge proof, the prover and the verifier need to interact multiple times. The verifier will continue to ask questions to challenge the prover, and the prover must continue to respond to these challenges until the verifier is convinced. For non-interactive zero-knowledge proof, the prover only needs to send a proof to the verifier for the first time. The verifier can verify the proof information at any time, and only needs to verify it once to decide whether to choose to believe the prover.

[0060] (8) The terms "system" and "network" in the embodiments of the present application can be used interchangeably. "At least one" means one or more, and "plurality" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and subsequent associated objects are in an "or" relationship. The following at least one item (items) or similar expressions refer to any combination of these items, including any combination of single items (items) or plural items (items). For example, at least one item (items) of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple.

[0061] Unless otherwise specified, ordinal numbers such as "first" and "second" in the embodiments of the present application are used to distinguish multiple objects and are not used to limit the order, timing, priority or importance of multiple objects.

[0062] In addition, the terms "including" and "having" in the embodiments, claims and drawings of the present application are not exclusive. For example, a process, method, system, product or device including a series of steps or modules is not limited to the listed steps or modules, and may also include steps or modules that are not listed.

[0063] At present, the existing ring signature technologies (such as AOS ring signature and DualRing ring signature) do not have the characteristics of threshold cryptography and cannot be applied to the application scenarios of distributed cryptography. Therefore, in order to make the ring signature have the characteristics of threshold cryptography, the embodiment of the present application proposes a technical solution for threshold ring signature. In the embodiment of the present application, the t signature ring members participating in the signature can select corresponding random numbers for themselves respectively, and select the challenges corresponding to each non-signature ring member for the nt non-signature ring members not participating in the signature. Based on the message to be signed, the random numbers corresponding to the signature ring members and the challenges corresponding to the non-signature ring members, a vector containing t parameters can be obtained, and then the challenges corresponding to each signature ring member can be obtained. According to the process of generating the DualRing ring signature, after obtaining the challenges corresponding to the signature ring members, the responses corresponding to the signature ring members can be determined according to the challenges, and the responses corresponding to the signature ring members and the challenges corresponding to all ring members can generate a complete signature to obtain the threshold ring signature.

[0064] Please refer to Figure 3 , a signature system provided in an embodiment of the present application, the signature system includes multiple ring members. Any of the multiple ring members can generate a threshold ring signature, and optionally, the multiple ring members can communicate with each other.

[0065] The multiple ring members may be implemented by software or hardware. Taking one of the ring members as an example, the implementation of the ring member is introduced.

[0066] When the ring member is implemented by software, the ring member can be a process, application or code block running on a computing device. The computing device can be at least one of a physical host (or physical machine), a virtual machine, and a container. For example, the ring member can be an application running on multiple hosts / virtual machines / containers. The multiple hosts / virtual machines used to run the application can be distributed in the same availability zone (AZ) or in different AZs; or, the multiple hosts / virtual machines / containers used to run the application can be distributed in the same region (region) or in different regions, where a region can generally include multiple AZs; or, the multiple hosts / virtual machines used to run the application can be distributed in the same virtual private cloud (VPC) or in multiple VPCs. A region can generally include multiple VPCs, and a VPC can include multiple AZs.

[0067] When the ring member is implemented by hardware, the ring member may include at least one computing device, and the at least one computing device included in the ring member may be distributed in the same AZ or in different AZs; or, the at least one computing device included in the ring member may be distributed in the same region or in different regions; or, the at least one computing device included in the ring member may be distributed in the same VPC or in multiple VPCs. Optionally, the ring member may also be a device implemented using an application-specific integrated circuit (ASIC) and / or a programmable logic device (PLD). Among them, the PLD may be a complex programmable logical device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL) or any combination thereof.

[0068] Please refer to Figure 4, is another signature system provided in an embodiment of the present application, the signature system includes a server and multiple ring members. The server can generate a threshold ring signature, and the server can communicate with the multiple ring members, and the multiple ring members can communicate with each other.

[0069] The server and the multiple ring members may be implemented by software or hardware, and the server and the multiple ring members may be implemented by software or hardware. Figure 3 The manner in which the ring members are implemented by software or hardware is not described in detail here.

[0070] Optionally, when the server and multiple ring members are implemented by software, the server and multiple ring members can be run in different virtual machines in the same physical host to achieve isolation in the virtual machine dimension. Alternatively, the server and multiple ring members can also be run on different physical hosts to achieve isolation in the physical host dimension.

[0071] The method provided in the embodiment of the present application is introduced below in conjunction with the drawings of the specification.

[0072] Please refer to Figure 5 , is a flow chart of a method for generating a threshold ring signature provided in an embodiment of the present application, which can be performed by Figure 3 or Figure 4 The signature system shown in FIG. Figure 4 The signature system implementation shown is taken as an example.

[0073] S501: The server obtains a random number corresponding to each of t signature ring members among n ring members, and obtains a first challenge corresponding to each of nt non-signature ring members among n ring members.

[0074] Optionally, the threshold ring signature function of the server can be activated when it is determined that a threshold ring signature needs to be generated. For example, when any one of the n ring members receives a message to be signed, it can initiate the process of generating a threshold ring signature. After perceiving the process, other ring members can decide whether to participate in the signature. If they decide to participate, they can make a declaration of participation in the signature.

[0075] The server can monitor the signature statement. If the number of signature ring members participating in the signature statement is greater than the threshold, indicating that a threshold ring signature can be generated, the server can activate the threshold ring signature function to generate a threshold ring signature.

[0076] When the threshold ring signature function is activated, each of the t signature ring members that initiate the threshold ring signature process can select a random number r for itself. For example, each signature ring member can randomly select a number as its corresponding r based on Δr. Δr is used to indicate the range of r that can be selected.

[0077] Since non-signature ring members do not participate in signing, they cannot provide parameters for generating threshold ring signatures, such as random challenges (the random challenge may also be referred to as the first challenge c in the following embodiments). Therefore, at least one of the t signature ring members may also randomly select c corresponding to each non-signature ring member according to Δc. Δc is used to indicate the selectable range of c.

[0078] The t signature ring members may negotiate to determine at least one signature ring member for selecting c corresponding to each non-signature ring member, and determine a selection method for selecting c corresponding to each non-signature ring member. If the t signature ring members negotiate to determine that multiple signature ring members select c corresponding to each non-signature ring member, the multiple signature ring members may also negotiate to determine a selection method for selecting c corresponding to each non-signature ring member. The multiple signature ring members may be part or all of the t signature ring members. The selection method may include, for example, the following methods:

[0079] Mode 1: Each signature ring member selects a corresponding c for at least one non-signature ring member, and the c corresponding to a non-signature ring member is selected by only one signature ring member. For example, signature ring member 1 may select corresponding c for non-signature ring member a and non-signature ring member b, and signature ring member 2 may select corresponding c for non-signature ring member d and non-signature ring member e.

[0080] Method 2: Each signature ring member selects a corresponding c for at least one non-signature ring member, and the c corresponding to a non-signature ring member can be jointly selected by multiple signature ring members. For example, signature ring members 1 and 2 can select a corresponding c for non-signature ring member a, and signature ring members 1 and 3 can select a corresponding c for non-signature ring member b.

[0081] If the corresponding c is selected for each non-signed ring member through the above method 2, the server can also merge the c corresponding to each non-signed ring member. The merging can be, for example, summing, or product, or other merging methods, and the embodiment of the present application does not limit the merging method.

[0082] The signature ring member used for performing the merging operation may be designated by negotiation of the t signature ring members; or may be designated by negotiation of the at least one signature ring member; or may be determined by negotiation of at least two signature ring members who select c for the same non-signature ring member.

[0083] If the signature ring member used for the merge operation is designated by negotiation of t signature ring members, or designated by negotiation of at least one signature ring member, then after each signature ring member selects the corresponding c for the non-signature ring member, the c selected for each non-signature ring member can be directly sent to the designated signature ring member, and the designated signature ring member merges multiple c corresponding to the same non-signature ring member. Taking the example in mode 2 as an example, after signature ring member 1 and signature ring member 2 select the corresponding c for non-signature ring member a, signature ring member 1 and signature ring member 2 can directly send the c selected for non-signature ring member a to the designated signature ring member. And, signature ring member 1 and signature ring member 3 can send the c selected for non-signature ring member b to the designated signature ring member. Optionally, the c sent by each signature ring member to the designated signature ring member also includes the index of the non-signature ring member, so that the designated signature ring member can merge the c corresponding to the same index based on the index to obtain the c corresponding to each non-signature ring member. Among them, the index can be used to indicate the position of the ring member in the ring, for example, the index can be the serial number of the ring member.

[0084] If the signature ring member used for the merge operation is determined by negotiation of at least two signature ring members that select c for the same non-signature ring member, then after each signature ring member selects the corresponding c for the non-signature ring member, it can also negotiate with other signature ring members for the signature ring member used for the merge operation. Continuing with the example in mode 2, after signature ring member 1 and signature ring member 2 select the corresponding c for non-signature ring member a, signature ring member 1 can negotiate with signature ring member 2 on who will merge the c corresponding to the non-signature ring member a. And after signature ring member 1 and signature ring member 3 select the corresponding c for non-signature ring member b, signature ring member 1 can negotiate with signature ring member 3 on who will merge the c corresponding to the non-signature ring member b. If signature ring member 1 and signature ring member 2 negotiate that signature ring member 1 merges the c corresponding to non-signature ring member a, and signature ring member 1 and signature ring member 3 negotiate that signature ring member 3 merges the c corresponding to non-signature ring member b, then signature ring member 2 can send the c selected by it for the non-signature ring member to signature ring member 1, signature ring member 1 can merge the c from signature ring member 2 and the c selected by it for non-signature ring member a to obtain the c corresponding to non-signature ring member a, and signature ring member 1 can send the c selected by it for non-signature ring member b to signature ring member 3, and signature ring member 3 can merge the c from signature ring member 1 and the c selected by it for non-signature ring member b to obtain the c corresponding to non-signature ring member b.

[0085] After each signature ring member selects a corresponding r for itself, and at least one of the t signature ring members selects a corresponding c for each of the nt non-signature ring members, the server may further send first information to the t signature ring members, for requesting to obtain r's corresponding to the t signature ring members, respectively, and c's corresponding to the nt non-signature ring members.

[0086] S502: The server obtains a first vector based on the information to be signed, a random number corresponding to each signature ring member, and a first challenge corresponding to each non-signature ring member.

[0087] The server can obtain the first commitment based on r corresponding to each signature ring member, the first challenge and the public key corresponding to each non-signature ring member. The first commitment is a commitment ring R, that is, an elliptic function. Taking nt = p as an example, assume that the index set S corresponding to t signature ring members = {s1, s2, ..., s t}, the index set U corresponding to the p non-signature ring members is U={u1,u2,…,u p}, the server can calculate the first commitment R according to the following formula:

[0088]

[0089] Among them, A is the commitment function, V2 is the verification function 2, pk is the public key, is the random number corresponding to the jth signature ring member among the t signature ring members, is the public key corresponding to the i-th non-signature ring member among the p non-signature ring members, is the first challenge corresponding to the i-th non-signature ring member, and ⊙ is a commutative group operation (eg, including modular multiplication and modular addition).

[0090] After obtaining the first commitment R, the server can perform a hash operation on the signature information m, R, the public key set (PK) and t to obtain the first vector. The public key set refers to the set of public keys corresponding to n ring members, that is, the public key set PK = {pk1, pk2, ..., pk n The server performs a hash operation on the signature message m, R, PK, and t to obtain the first vector Contains t elements, that is

[0091] S503: The server determines a first challenge corresponding to each signature ring member based on the first vector.

[0092] In the embodiment of the present application, the structure of the threshold ring signature consists of a response and n challenges. The response can be obtained by the private key, the first challenge and the random number corresponding to the signature ring member. According to the above steps, the private key and the random number corresponding to the signature ring member are known parameters. Therefore, in order to obtain the final threshold ring signature, it is also necessary to determine the first challenge corresponding to the signature ring member. Optionally, the server determines that the first challenge c corresponding to each signature ring member can conform to the following formula:

[0093]

[0094] For example, the server can solve the above formula in the following way:

[0095]

[0096]

[0097] According to formula A S c S =b s The c corresponding to the t signature ring members can be calculated. For example, the c corresponding to the t signature ring members are

[0098] Optionally, since the private key of each ring member is not public, and the private key of the signature ring member is needed to generate the threshold ring signature, the server can also execute S504 to S506 after obtaining c corresponding to each signature ring member.

[0099] S504: The server sends a first request to each signature ring member, the first request is used to request a response, and the first request sent by the server to the first signature ring member includes a first challenge corresponding to the first signature ring member. Accordingly, each signature ring member receives the first request from the server.

[0100] After obtaining c corresponding to t signature ring members, the server can send c for determining the response to each signature ring member. For example, the first request sent by the server to the signature ring member with index s1 includes The first request sent to the signature ring member with index s2 includes Optionally, the server may also send c corresponding to the t signature ring members to each signature ring member. After receiving the t c from the server, each signature ring member may determine the corresponding c based on its own index. The c corresponding to the t signature ring members are respectively For example, the signature ring member with index s2 can determine its corresponding c based on its own index (i.e. ).

[0101] S505: Each signature ring member determines a corresponding response based on the corresponding first challenge, private key and random number.

[0102] Optionally, each signature ring member can use the response function Z to calculate the corresponding response based on the corresponding c, private key and random number. For example, the c corresponding to the signature ring member with index s1 is The private key is The random number is The response calculated by the signature ring member with index s1 is

[0103] S506: Each signature ring member sends a response corresponding to each signature ring member to the server. Correspondingly, the server receives a response from each signature ring member.

[0104] S507: The server generates a threshold ring signature using the responses corresponding to each signature ring member and the first challenges corresponding to the n ring members.

[0105] Optionally, after receiving z corresponding to t signature ring members, the server can also merge t z and use the merged z (for example, z S ) and c corresponding to n ring members constitute a threshold ring signature. The threshold ring signature is, for example, (zS , c1,…,c n ). The merging method is, for example, summing, product, concatenation, etc. The embodiment of the present application does not limit the merging method of z. c1, ..., c n are c corresponding to the n ring members respectively.

[0106] After generating the threshold ring signature, the server may also send the generated threshold ring signature to a receiving device, such as the recipient of the message to be signed. Optionally, before sending the threshold ring signature to the receiving device, the server may also use a non-interactive zero-knowledge proof to compress n cs to a size of O(logn) to reduce the transmission overhead of the threshold ring signature.

[0107] Before the server sends the generated threshold ring signature to the receiving device, it can also verify whether the threshold ring signature is valid through the verifier. Optionally, the verifier can obtain the second commitment R based on the threshold ring signature. ′ , for example, the verifier obtains the R ′ It can meet the following formula:

[0108]

[0109] Among them, V1 is verification function 1, and V2 is verification function 2.

[0110] In obtaining R ′ Afterwards, the verifier can ′ , the public key set PK, the information to be signed m and the number of ring members n are hashed to obtain the second vector Right now The verifier can use this second vector Calculate the second challenge c corresponding to n ring members ′ , get n c ′ , and determine n c ′ Whether it is the same as the n c in the threshold ring signature, if it is the same, the signature is valid, otherwise the signature is invalid.

[0111] For ease of understanding, the following Figure 6 Introducing an embodiment, Figure 6 The embodiment shown is Figure 5 An example of a method for generating a threshold ring signature introduced in the illustrated embodiment.

[0112] Please refer to Figure 6 ,for Figure 5 The illustrated embodiment provides an example of a method for generating a threshold ring signature.

[0113] Figure 6In the illustrated embodiment, there are 10 ring members (i.e., n=10), of which 3 ring members initiate the process of generating a threshold ring signature, namely, there are 3 signature ring members, the corresponding indexes of the 3 signature ring members are 2, 5, and 7, respectively, and there are 7 non-signature ring members, the corresponding indexes of the 7 non-signature ring members are 1, 3, 4, 6, 8, 9, and 10, respectively. Each ring signature member can randomly select a number as its corresponding r according to Δr, and the corresponding r of the 3 signature ring members are r2, r5, and r7, respectively. And at least one of the 3 signature ring members can also select a corresponding c for each of the 7 non-signature ring members. Taking the example of the 3 signature ring members negotiating that the ring signature member 2 selects the corresponding c for each non-signature ring member, the signature ring member 2 can randomly select 7 numbers according to Δc as the corresponding c of the 7 non-signature ring members, which are c1, c3, c4, c6, c8, c9, c10, c11, c12, c13, c14, c15, c16, c17, c18, c19, c19, c20, c21, c22, c23, c24, c25, c26, c27, c28, c29, c30, c31, c32, c33, c34, c35, c36, c37, c38, c39, c40, c41, c42, c43, c44, c45, c46, c47, c48, c49, c50, c51, c52, c53, c54, c55, c56, c57, c58, c59, c6 10 .

[0114] After completing the random number r and the first challenge c, the signature ring members can send their selected parameters (hereinafter referred to as signature parameters) to the server. For example, signature ring member 2 can send r2 and c1, c3, c4, c6, c8, c9, c 10 , signature ring member 5 can send r5 to the server, and signature ring member 7 can send r7 to the server. Among them, r2 and c1, c3, c4, c6, c8, c9, c 10 It can be sent through the same information or different information. For example, signature ring member 2 can send r2 through the first information and send c1, c3, c4, c6, c8, c9, c10, c111, c12, c13, c14, c15, c16, c17, c18, c19, c20, c21, c22, c23, c24, c25, c26, c27, c28, c29, c30, c31, c32, c33, c34, c35, c36, c37, c38, c39, c40, c41, c42, c43, c44, c45, c46, c47, c48, c49, c50, c51, c52, c53, c54, c55, c56, c57, c58, c59, c60, c6 10 Alternatively, signature parameters corresponding to different ring members may be sent through different messages, for example, r2 may be sent through a first message, c1 may be sent through a second message, c3 may be sent through a third message, etc. The embodiment of the present application does not limit the manner in which signature ring members send signature parameters to the server.

[0115] After receiving the signature parameters from the signature ring members (including r corresponding to the signature ring members and c corresponding to the non-signature ring members), the server can use the signature parameters and the public keys corresponding to the seven non-signature ring members to obtain the first commitment R (i.e. Figure 6 The ring members inside the R ring are signature ring members, and the ring members outside the R ring are non-signature ring members.

[0116] After the server obtains the R ring, it can perform a hash operation on the signature message m, R, PK, and 3 to obtain the first vector The server can use this The first formula in S504 is used to construct a system of equations, which is as follows:

[0117]

[0118] Among them, c1, c3, c4, c6, c8, c9, c 10 is known, that is, the equation group only includes three unknowns, c2, c5 and c7, so the server can obtain c2, c5 and c7 by solving the equation group. Among them, an equation is an elliptic function, and an elliptic function can form a ring (i.e. Figure 6 C ring in ).

[0119] After the server calculates the c corresponding to the signature ring member, it can send each c to the corresponding signature ring member. For example, the server sends c2 to signature ring member 2, c5 to signature ring member 5, and c7 to signature ring member 7.

[0120] After receiving c from the server, the signature ring member can use the formula shown in S506 to calculate a response based on c, its corresponding private key and r, and send the response to the server. The responses calculated by the three signature ring members are z2, z5 and z7 respectively.

[0121] The server can combine z2, z5 and z7 to get the response z corresponding to the signature ring member S , and use the combined z S and c corresponding to 10 ring members constitute a threshold ring signature (z S , c1,…,c 10 ).

[0122] In the above technical solution, multiple ring members can initiate a joint signature, so that the ring signature has the characteristics of threshold cryptography and can be applied to distributed cryptographic application scenarios. And the parameters used in the process of generating a threshold ring signature in the embodiment of the present application only include a random number randomly selected from a random number set by each signature ring member, a private key of each signature ring member, a public key corresponding to each ring member, and a random challenge randomly selected from a challenge set by at least one signature ring member for each non-signature ring member, and the challenges corresponding to n ring members are compressed by non-interactive zero-knowledge proof, without the need for an accumulator, thereby improving the security of the threshold ring signature.

[0123] Based on the same technical concept as the above-mentioned threshold ring signature generation method, the embodiment of the present application also provides a threshold ring signature generation device, which can be used to perform the above-mentioned Figure 5 The threshold ring signature generation method shown in FIG. Figure 7As shown, the threshold ring signature generation device includes a communication module 701 and a processing module 702. The aforementioned modules can be implemented by software, or by hardware executing corresponding software implementations. Specifically, in the threshold ring signature generation device, each module can be connected through a communication path.

[0124] The communication module 701 is used to obtain a random number corresponding to each signature ring member of t signature ring members among the n ring members, and obtain a first challenge corresponding to each non-signature ring member of nt non-signature ring members among the n ring members; wherein 1<t<n, and the first challenge corresponding to each non-signature ring member is randomly selected by at least one signature ring member among the t signature ring members;

[0125] The processing module 702 is configured to obtain a first vector based on the information to be signed, the random number corresponding to each signature ring member, and the first challenge corresponding to each non-signature ring member, wherein the first vector includes t elements; determine the first challenge corresponding to each signature ring member based on the first vector; and generate a threshold ring signature using the response corresponding to each signature ring member and the first challenge corresponding to the n ring members, wherein the response corresponding to the first signature ring member is determined by the first signature ring member based on the first challenge corresponding to the first signature ring member, a private key, and the random number, and the first signature ring member is any one of the signature ring members.

[0126] In a possible implementation manner, the processing module 702 determines the first challenge corresponding to each signature ring member based on the first vector, which complies with the following formula:

[0127]

[0128] Where t is the number of signature ring members, n is the number of ring members, h1,h2,…,h t is the element in the first vector, c n is the challenge corresponding to the nth ring member.

[0129] In a possible implementation, the processing module 702 is used to obtain the first vector in the following manner: obtain a first commitment based on the random number corresponding to each signature ring member, the public key corresponding to each non-signature ring member, and the first challenge, where the public key corresponding to each non-signature ring member belongs to a public key set, and the public key set is a set formed by the public keys corresponding to the n ring members; perform a hash operation on the signature information to be signed, the first commitment, the public key set, and t to obtain the first vector.

[0130] In a possible implementation, the processing module 702 is further configured to: merge responses respectively corresponding to the t signature ring members; and generate the threshold ring signature using the merged responses and the first challenges respectively corresponding to the n ring members.

[0131] In a possible implementation manner, before generating the threshold ring signature using the response corresponding to each signature ring member and the first challenge corresponding to the n ring members, the processing module 702 is further used to: control the communication module 701 to send a first request to each signature ring member and receive a response from each signature ring member, wherein the first request is used to request to obtain a response, and the first request sent to the first signature ring member includes a first challenge corresponding to the first signature ring member.

[0132] In a possible implementation, the processing module 702 is further used to: compress the first challenges corresponding to the n ring members respectively using a zero-knowledge proof algorithm; the processing module 702 is used to: generate a threshold ring signature using the responses corresponding to each signature ring member and the compressed first challenge.

[0133] The embodiment of the present application also provides an electronic device, which may have Figure 8 In the structure shown, the electronic device may be a computer device, or a chip or chip system that can support the computer device to implement the above method.

[0134] like Figure 8 The electronic device shown may include at least one processor 801, and the at least one processor 801 is used to couple with a memory, read and execute instructions in the memory to implement the steps of the threshold ring signature generation method provided in the embodiment of the present application. Optionally, the electronic device may also include a communication interface 802, which is used to support the electronic device to receive or send signaling or data. The communication interface 802 in the electronic device can be used to interact with other electronic devices. The processor 801 can be used to implement the electronic device to perform the following steps: Figure 5 Optionally, the electronic device may further include a memory 803 in which computer instructions are stored. The memory 803 may be coupled to the processor 801 and / or the communication interface 802 to support the processor 801 to call the computer instructions in the memory 803 to implement the following. Figure 5 The steps in the method shown; in addition, the memory 803 can also be used to store data involved in the embodiment of the method of the present application, for example, to store data and instructions necessary to support the communication interface 802 to implement interaction, and / or to store configuration information necessary for the electronic device to execute the method described in the embodiment of the present application.

[0135] The present application also provides a computing device 900. Fig. 9 As shown, the computing device 900 includes: a bus 901, a processor 902, a memory 903 and a communication interface 904. The processor 902, the memory 903 and the communication interface 904 communicate with each other through the bus 901. The computing device 900 can be a server or a terminal device. It should be understood that the present application does not limit the number of processors and memories in the computing device 900.

[0136] The bus 901 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig. 9 The bus 902 is represented by only one line, but it does not mean that there is only one bus or one type of bus. The bus 902 may include a path for transmitting information between various components of the computing device 900 (eg, the memory 903, the processor 902, and the communication interface 904).

[0137] The processor 902 may include any one or more of a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor (MP), or a digital signal processor (DSP).

[0138] The memory 903 may include a volatile memory, such as a random access memory (RAM). The processor 902 may also include a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD), or a solid state drive (SSD).

[0139] The memory 903 stores executable program codes, and the processor 902 executes the executable program codes to respectively implement the functions of the aforementioned communication module 701 and the processing module 702, thereby implementing a threshold ring signature generation method provided in an embodiment of the present application. That is, the memory 903 stores instructions for executing a threshold ring signature generation method provided in an embodiment of the present application.

[0140] The communication interface 904 uses a transceiver module such as, but not limited to, a network interface card or a transceiver to implement communication between the computing device 900 and other devices or a communication network.

[0141] The embodiment of the present application also provides a computing device cluster. The computing device cluster includes at least one computing device. The computing device can be a server, such as a central server, an edge server, or a local server in a local data center. In some embodiments, the computing device can also be a terminal device such as a desktop computer, a laptop computer, or a smart phone.

[0142] like Fig.10 As shown, the computing device cluster includes at least one computing device 900. The memory 903 in one or more computing devices 900 in the computing device cluster may store the same instructions for executing a threshold ring signature generation method provided in an embodiment of the present application.

[0143] In some possible implementations, the memory 903 of one or more computing devices 900 in the computing device cluster may also respectively store partial instructions for executing a method for generating a threshold ring signature provided in an embodiment of the present application. In other words, a combination of one or more computing devices 900 may jointly execute instructions for executing a method for generating a threshold ring signature provided in an embodiment of the present application.

[0144] It is understandable that the memory 903 in different computing devices 900 in the computing device cluster may store different instructions, which are respectively used to execute the functions of the aforementioned communication module 701 and processing module 702. That is, the instructions stored in the memory 903 in different computing devices 900 may implement the functions of one or more modules of the communication module 701 and the processing module 702.

[0145] In some possible implementations, one or more computing devices in the computing device cluster may be connected via a network, which may be a wide area network or a local area network. Fig.11 A possible implementation is shown. Fig.11 As shown, two computing devices 900A and 900B are connected via a network. Specifically, the network is connected via a communication interface in each computing device. In this type of possible implementation, the memory 903 in the computing device 900A stores instructions for executing the functions of the communication module 701. At the same time, the memory 903 in the computing device 900B stores instructions for executing the functions of the processing module 702.

[0146] Fig.11The connection mode between the computing device clusters shown can be that the functions implemented by the communication module 701 are handed over to the computing device 900A for execution, so it is considered that the functions implemented by the processing module 702 are handed over to the computing device 900B for execution.

[0147] It should be understood that Fig.11 The functions of the computing device 900A shown in FIG. 9A may also be completed by multiple computing devices 900. Similarly, the functions of the computing device 900B may also be completed by multiple computing devices 900.

[0148] The present application embodiment also provides another computing device cluster. The connection relationship between the computing devices in the computing device cluster can be similar to that of Fig.11 The connection mode of the computing device cluster. The difference is that the memory 903 in one or more computing devices 900 in the computing device cluster may store the same instructions for executing a threshold ring signature generation method provided in an embodiment of the present application.

[0149] In some possible implementations, the memory 903 of one or more computing devices 900 in the computing device cluster may also respectively store partial instructions for executing a method for generating a threshold ring signature provided in an embodiment of the present application. In other words, a combination of one or more computing devices 900 may jointly execute instructions for executing a method for generating a threshold ring signature provided in an embodiment of the present application.

[0150] The embodiment of the present application also provides a computer program product comprising instructions. The computer program product may be a software or program product comprising instructions that can be run on a computing device or stored in any available medium. When the computer program product is run on at least one computing device, the at least one computing device executes a threshold ring signature generation method provided in the embodiment of the present application.

[0151] The embodiment of the present application also provides a computer-readable storage medium. The computer-readable storage medium can be any available medium that can be stored by a computing device or a data storage device such as a data center containing one or more available media. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk). The computer-readable storage medium includes instructions that instruct the computing device to execute a threshold ring signature generation method provided in an embodiment of the present application.

[0152] An embodiment of the present application also provides a chip, which may include a processor, wherein the processor is coupled to a memory, and is used to read and execute a software program stored in the memory, and is used to complete the methods involved in the above-mentioned method embodiments and any possible implementation methods of the method embodiments, wherein "coupling" refers to the direct or indirect combination of two components with each other, and this combination may be fixed or movable.

[0153] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of computer instructions. When the computer instructions are loaded and executed on a computer, the process or function described in the embodiment of the present invention is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber) or wireless (e.g., infrared, wireless, microwave, etc.) mode. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.

[0154] The steps of the method or algorithm described in the embodiments of the present application can be directly embedded in the hardware, the software unit executed by the processor, or the combination of the two. The software unit can be stored in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM or other storage media of any form in the art. Exemplarily, the storage medium can be connected to the processor so that the processor can read information from the storage medium and can write information to the storage medium. Optionally, the storage medium can also be integrated into the processor. The processor and the storage medium can be arranged in an ASIC, and the ASIC can be arranged in a terminal device. Optionally, the processor and the storage medium can also be arranged in different components in the terminal device.

[0155] These computer instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

Claims

1. A threshold ring signature generation method, It is characterized in that The method comprises: Obtain a random number corresponding to each signature ring member of t signature ring members among the n ring members, and obtain a first challenge corresponding to each non-signature ring member of nt non-signature ring members among the n ring members; wherein 1<t<n, and the first challenge corresponding to each non-signature ring member is randomly selected by at least one signature ring member among the t signature ring members; Obtain a first vector based on the information to be signed, the random number corresponding to each signature ring member, and the first challenge corresponding to each non-signature ring member, wherein the first vector includes t elements; Determine a first challenge corresponding to each signature ring member based on the first vector; A threshold ring signature is generated by using the responses corresponding to each signature ring member and the first challenges corresponding to the n ring members, wherein the response corresponding to the first signature ring member is determined by the first signature ring member based on the first challenge corresponding to the first signature ring member, a private key and the random number, and the first signature ring member is any one of the signature ring members.

2. The method according to claim 1, It is characterized in that Determining the first challenge corresponding to each signature ring member based on the first vector complies with the following formula: Among them, h 1 ,h 2 ,…,h t are the different elements in the first vector, c n is the challenge corresponding to the nth ring member.

3. The method according to claim 1, It is characterized in that Obtaining a first vector based on the information to be signed, the random number corresponding to each signature ring member, and the first challenge corresponding to each non-signature ring member, includes: Obtaining a first commitment based on the random number corresponding to each signature ring member, the public key corresponding to each non-signature ring member, and the first challenge, wherein the public key corresponding to each non-signature ring member belongs to a public key set, and the public key set is a set formed by the public keys corresponding to the n ring members; A hash operation is performed on the information to be signed, the first commitment, the public key set, and t to obtain the first vector.

4. The method according to claim 1, It is characterized in that Generating a threshold ring signature using the responses corresponding to each signature ring member and the first challenges corresponding to the n ring members, including: Merging responses corresponding to the t signature ring members respectively; The threshold ring signature is generated by using the combined response and the first challenges respectively corresponding to the n ring members.

5. The method according to any one of claims 1 to 4, It is characterized in that Before generating a threshold ring signature by using the responses respectively corresponding to each signature ring member and the first challenges respectively corresponding to the n ring members, the method further includes: Sending a first request to each of the signature ring members, where the first request is used to request a response, and the first request sent to the first signature ring member includes a first challenge corresponding to the first signature ring member; A response is received from each of the signing ring members.

6. The method according to any one of claims 1 to 4, It is characterized in that The method further comprises: Compressing the first challenges respectively corresponding to the n ring members by using a zero-knowledge proof algorithm; Generating a threshold ring signature using the responses corresponding to each signature ring member and the first challenges corresponding to the n ring members, including: A threshold ring signature is generated using the responses respectively corresponding to each signature ring member and the compressed first challenge.

7. A threshold ring signature generation device, It is characterized in that The device comprises: A communication module is used to obtain a random number corresponding to each signature ring member of t signature ring members among n ring members, and obtain a first challenge corresponding to each non-signature ring member of nt non-signature ring members among the n ring members; wherein 1<t<n, and the first challenge corresponding to each non-signature ring member is randomly selected by at least one signature ring member among the t signature ring members; The processing module is configured to obtain a first vector based on information to be signed, a random number corresponding to each signature ring member, and a first challenge corresponding to each non-signature ring member, wherein the first vector includes t elements; determine the first challenge corresponding to each signature ring member based on the first vector; and generate a threshold ring signature using a response corresponding to each signature ring member and the first challenges corresponding to the n ring members, wherein the response corresponding to the first signature ring member is determined by the first signature ring member based on the first challenge corresponding to the first signature ring member, a private key, and the random number, and the first signature ring member is any one of the signature ring members.

8. The device according to claim 7, It is characterized in that The processing module determines the first challenge corresponding to each signature ring member based on the first vector, which complies with the following formula: Where t is the number of signature ring members, n is the number of ring members, and h 1 ,h 2 ,…,h t is the element in the first vector, c k is the challenge corresponding to the kth ring member.

9. The device according to claim 7, It is characterized in that When the processing module obtains the first vector based on the information to be signed, the random number corresponding to each signature ring member, and the first challenge corresponding to each non-signature ring member, the processing module is specifically used to: Obtaining a first commitment based on the random number corresponding to each signature ring member, the public key corresponding to each non-signature ring member, and the first challenge, wherein the public key corresponding to each non-signature ring member belongs to a public key set, and the public key set is a set formed by the public keys corresponding to the n ring members; A hash operation is performed on the information to be signed, the first commitment, the public key set, and t to obtain the first vector.

10. The device according to claim 7, It is characterized in that When the processing module generates a threshold ring signature by using the response corresponding to each signature ring member and the first challenge corresponding to the n ring members, the processing module is specifically used to: Merging responses corresponding to the t signature ring members respectively; The threshold ring signature is generated by using the combined response and the first challenges respectively corresponding to the n ring members.

11. The device according to any one of claims 7 to 10, It is characterized in that Before generating the threshold ring signature, the processing module is also used to: Control the communication module to send a first request to each signature ring member and receive a response from each signature ring member, wherein the first request is used to request to obtain a response, and the first request sent by the communication module to the first signature ring member includes a first challenge corresponding to the first signature ring member.

12. The device according to any one of claims 7 to 10, It is characterized in that The processing module is also used for: Compressing the first challenges corresponding to the n ring members using a zero-knowledge proof algorithm; When the processing module generates a threshold ring signature by using the response corresponding to each signature ring member and the first challenge corresponding to the n ring members, the processing module is specifically used to: A threshold ring signature is generated using the responses respectively corresponding to each signature ring member and the compressed first challenge.

13. A computing device cluster, It is characterized in that comprising at least one computing device, each computing device comprising a processor and a memory; The processor of the at least one computing device is configured to execute instructions stored in the memory of the at least one computing device, so that the computing device cluster executes the method according to any one of claims 1 to 6.

14. A computer program product comprising instructions, It is characterized in that When the instructions are executed by a computing device cluster, the computing device cluster executes the method according to any one of claims 1 to 6.

15. A computer-readable storage medium, It is characterized in that The method comprises computer program instructions. When the computer program instructions are executed by a computing device cluster, the computing device cluster executes the method according to any one of claims 1 to 6.

Citation Information

Cited By

  • Threshold ring signature method and device, equipment and storage medium

    CN119519991A