A digital signature group verification method, system, device and computer medium

Abstract

The present application discloses a digital signature group verification method, system, device and computer medium, which obtain multiple target digital signatures to be verified; determine the upper limit value of illegal signatures in the target digital signatures; construct a cross-sectional design based on the total number of target digital signatures and the upper limit value; determine the disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; group the target digital signatures according to the disjunctive matrix, perform group batch verification of the target digital signatures based on the aggregate signature theory, and determine the target digital signatures in the legal digital signature group as legal digital signatures; determine other target digital signatures other than legal digital signatures as illegal digital signatures. The present application constructs a cross-sectional design and groups the multiple target digital signatures to be verified, and screens out illegal digital signatures according to the legality of the digital signature group. It has good accuracy and high efficiency, and can quickly verify whether the digital signature is accurate.

Description

Technical Field

[0001] The present application relates to the field of data security technology, and more specifically, to a digital signature group verification method, system, device and computer medium. Background Art

[0002] With the continuous advancement of technologies such as wireless communication, sensors and artificial intelligence, various situational awareness networks are playing an increasingly important role in meteorological and hydrological monitoring, urban smart transportation, and online energy monitoring. While technological progress brings convenience, it also causes people to be restricted by technology. In particular, when the information of each node is stolen, impersonated or forged, it is easy to cause the situational awareness network to be unsmooth or even paralyzed. Therefore, signing the messages transmitted by the nodes to ensure the reliability, integrity and non-repudiation of the messages has become an important network security measure. Traditional digital signatures use a one-by-one verification method. When the number of signatures verified by the central node is small, the one-by-one verification method can still meet the requirements. However, when the number of signatures to be verified is huge, one-by-one verification takes a lot of time, resulting in a large number of messages being forced to be discarded due to failure to be verified in time. For example, the huge Internet of Vehicles system transmits messages in real time every 100-300ms. A large number of messages together with the attached signatures rush to the central node for immediate verification. If timely security confirmation cannot be obtained, the situation messages sent by each node will expire and become invalid.

[0003] In summary, how to quickly verify whether a digital signature is accurate is a problem that currently needs to be solved urgently by those skilled in the art. Summary of the invention

[0004] The purpose of this application is to provide a digital signature group verification method, which can solve the technical problem of how to quickly verify whether a digital signature is accurate to a certain extent. This application also provides a digital signature group verification system, device and computer-readable storage medium.

[0005] In order to achieve the above objectives, this application provides the following technical solutions:

[0006] A digital signature group verification method, comprising:

[0007] Obtain multiple target digital signatures to be verified;

[0008] Determining an upper limit value of illegal signatures in the target digital signature;

[0009] Constructing a cross-sectional design based on the total number of target digital signatures and the upper limit value;

[0010] Determine a disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents one of the digital signature groups, each column of the disjunctive matrix represents one of the target digital signatures, and a matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group;

[0011] The target digital signatures are grouped according to the disjunctive matrix, and group batch verification of the target digital signatures is performed based on the aggregate signature theory, and the target digital signatures in the legal digital signature group are determined as legal digital signatures;

[0012] The target digital signatures other than the legal digital signature are determined as illegal digital signatures.

[0013] Preferably, constructing a cross-sectional design based on the total value of the target digital signature and the upper limit value includes:

[0014] Determine the number of elements in the group of the cross-sectional design based on the total number of elements by a first calculation formula;

[0015] The sum of the upper limit value and 1 is determined as the block size value of the cross-sectional design;

[0016] By using the second operation formula, an orthogonal Latin square is constructed, wherein the order of the orthogonal Latin square is the value of the number of elements in the group;

[0017] constructing the cross-sectional design based on the orthogonal Latin square;

[0018] The first operation formula includes:

[0019]

[0020] Wherein, m represents the number of elements in the group; n represents the total number of elements; Indicates rounding up;

[0021] The second operation formula includes:

[0022] 1≤e≤k-2; 0≤i≤m-1; 0≤j≤m-1;

[0023] Among them, A (e) represents the e-th orthogonal Latin square; represents the matrix value of the i-th row and j-th column in the e-th orthogonal Latin square; k represents the upper limit value.

[0024] Preferably, constructing the cross-sectional design based on the orthogonal Latin square comprises:

[0025] Constructing an array of the upper limit value plus 1 orthogonal value based on the first matrix, the second matrix and the orthogonal Latin square, wherein the order of the array is the number of elements in the group;

[0026] constructing the cross-sectional design based on the array;

[0027] Among them, the first matrix is:

[0028]

[0029] The second matrix is:

[0030]

[0031] Preferably, the determining of the disjunction matrix of the cross-sectional design comprises:

[0032] determining a correlation matrix for the cross-sectional design;

[0033] The transposed matrix of the incidence matrix is ​​used as the disjunction matrix.

[0034] Preferably, after grouping the target digital signatures into digital signature groups based on the disjunctive matrix and before determining the target digital signatures in the legal digital signature group as legal digital signatures, the method further includes:

[0035] Determine the validity verification results of each of the digital signature groups.

[0036] Preferably, the determining the upper limit value of illegal signatures in the target digital signature includes:

[0037] Verify the legitimacy of all target digital signatures based on an aggregate signature algorithm;

[0038] If the legitimacy verification result indicates that there is an illegal target digital signature, the step of determining the upper limit value of the illegal signature in the target digital signature is performed.

[0039] Preferably, after determining the target digital signatures other than the legal digital signature as illegal digital signatures, the method further includes:

[0040] It is determined whether the number of the illegal digital signatures is less than or equal to the upper limit value, and if so, it is determined that the verification of the illegal digital signatures is correct.

[0041] A digital signature group verification system, comprising:

[0042] A first acquisition module, used to acquire multiple target digital signatures to be verified;

[0043] A first determination module, used to determine an upper limit value of illegal signatures in the target digital signature;

[0044] A first construction module, configured to construct a cross-sectional design based on the total number of target digital signatures and the upper limit value;

[0045] A first grouping module is used to determine a disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents one of the digital signature groups, each column of the disjunctive matrix represents one of the target digital signatures, and a matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group;

[0046] A second determination module is used to group the target digital signatures according to the disjunctive matrix, perform group batch verification of the target digital signatures based on the aggregate signature theory, and determine the target digital signatures in the legal digital signature group as legal digital signatures;

[0047] The third determination module is used to determine the target digital signatures other than the legal digital signature as illegal digital signatures.

[0048] A digital signature group verification device, comprising:

[0049] Memory for storing computer programs;

[0050] A processor is used to implement the steps of any of the above-mentioned digital signature group verification methods when executing the computer program.

[0051] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of any of the above-mentioned digital signature group verification methods are implemented.

[0052] The present application provides a digital signature group verification method, which obtains multiple target digital signatures to be verified; determines the upper limit value of illegal signatures in the target digital signatures; constructs a cross-sectional design based on the total number of target digital signatures and the upper limit value; determines the disjunctive matrix of the cross-sectional design, and groups the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents a digital signature group, each column of the disjunctive matrix represents a target digital signature, and the matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group; groups the target digital signatures according to the disjunctive matrix, performs group batch verification of the target digital signatures based on the aggregate signature theory, and determines the target digital signatures in the legal digital signature group as legal digital signatures; determines other target digital signatures other than legal digital signatures as illegal digital signatures. In the present application, a cross-sectional design is constructed for multiple target digital signatures to be verified, and the target digital signatures are grouped according to the disjunctive matrix of the cross-sectional design, and finally the illegal digital signatures are screened out according to whether the digital signature group is legal or not, which has good accuracy and high efficiency, and can quickly verify whether the digital signature is accurate. The digital signature group verification system, device and computer-readable storage medium provided in this application also solve the corresponding technical problems. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0054] Figure 1 A flowchart of a digital signature group verification method provided in an embodiment of the present application;

[0055] Figure 2 A schematic diagram of the structure of a digital signature group verification system provided in an embodiment of the present application;

[0056] Figure 3 A schematic diagram of the structure of a digital signature group verification device provided in an embodiment of the present application;

[0057] Figure 4 Another structural schematic diagram of a digital signature group verification device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0059] See also Figure 1 , Figure 1 A flowchart of a digital signature group verification method provided in an embodiment of the present application.

[0060] A digital signature group verification method provided in an embodiment of the present application may include the following steps:

[0061] Step S101: Acquire multiple target digital signatures to be verified.

[0062] In actual applications, multiple target digital signatures to be verified can be obtained first. The total number and type of target digital signatures can be determined according to actual needs. For example, the target digital signature can be the signature sent by each user to the signature authentication center, etc. This application does not make specific limitations here.

[0063] Step S102: Determine the upper limit value of illegal signatures in the target digital signature.

[0064] In practical applications, after obtaining multiple target digital signatures to be verified, the upper limit value of illegal signatures in the target digital signatures can be determined first, so that the upper limit value can be used as the block size value of the cross-sectional design to construct the cross-sectional design. It should be noted that the upper limit value of illegal signatures in this application refers to the maximum number of illegal target digital signatures in the target digital signatures. For example, if there are at most 5 illegal signatures in 10 target digital signatures, the upper limit value is 5.

[0065] Step S103: construct a cross-sectional design based on the total number of target digital signatures and the upper limit value.

[0066] In practical applications, after determining the upper limit value of illegal signatures in the target digital signature, a cross-sectional design can be constructed based on the total value and upper limit value of the target digital signature, so that the illegal target digital signature can be determined based on the constructed cross-sectional design.

[0067] Step S104: Determine a disjunctive matrix of a cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents a digital signature group, each column of the disjunctive matrix represents a target digital signature, and the matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group.

[0068] In practical applications, after constructing a cross-sectional design based on the total number and upper limit of the target digital signatures, it is necessary to determine the disjunctive matrix of the cross-sectional design and group the target digital signatures into digital signature groups based on the disjunctive matrix, so as to subsequently determine illegal digital signatures based on the digital signature groups and the disjunctive matrix.

[0069] It should be noted that the disjunctive matrix is ​​a type of binary superposition code that can be used as a mathematical model for group detection; and in this application, each row of the disjunctive matrix represents a digital signature group, each column of the disjunctive matrix represents a target digital signature, and the matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group. In specific application scenarios, the number of rows of the disjunctive matrix can be the product of the upper limit value and the number of elements in the group, and the number of columns of the disjunctive matrix can be the target digital signature after the final filling, etc. This application does not make specific restrictions here.

[0070] Step S105: grouping the target digital signatures according to the disjunctive matrix, performing group batch verification of the target digital signatures based on the aggregate signature theory, and determining the target digital signatures in the legal digital signature group as legal digital signatures.

[0071] Step S106: Determine other target digital signatures except the legal digital signature as illegal digital signatures.

[0072] In practical applications, after determining the disjunctive matrix of the cross-sectional design and grouping the target digital signatures into digital signature groups based on the disjunctive matrix, since each target digital signature in the legal digital signature group is legal, the target digital signatures can be grouped according to the disjunctive matrix, and the grouped batch verification of the target digital signatures can be performed based on the aggregate signature theory, and the target digital signatures in the legal digital signature group can be determined as legal digital signatures; other target digital signatures except the legal digital signatures can be determined as illegal digital signatures, so as to detect illegal digital signatures among multiple target digital signatures.

[0073] The present application provides a digital signature group verification method, which obtains multiple target digital signatures to be verified; determines the upper limit value of illegal signatures in the target digital signatures; constructs a cross-sectional design based on the total number of target digital signatures and the upper limit value; determines the disjunctive matrix of the cross-sectional design, and groups the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents a digital signature group, each column of the disjunctive matrix represents a target digital signature, and the matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group; groups the target digital signatures according to the disjunctive matrix, performs group batch verification of the target digital signatures based on the aggregate signature theory, and determines the target digital signatures in the legal digital signature group as legal digital signatures; determines other target digital signatures other than legal digital signatures as illegal digital signatures. In the present application, a cross-sectional design is constructed according to statistical characteristics such as the total number of multiple target digital signatures to be verified and the upper limit of their number of illegal signatures, and the target digital signatures are grouped according to the disjunctive matrix of the cross-sectional design, and finally the illegal digital signatures are screened out according to whether the digital signature group is legal or not, which has good accuracy and high efficiency, and can quickly verify whether the digital signature is accurate.

[0074] In a digital signature group verification method provided by the present application, in the process of constructing a cross-sectional design based on the total number value and the upper limit value of the target digital signature, the number of elements in the group of the cross-sectional design can be determined based on the total number value through a first calculation formula; the sum of the upper limit value and 1 is determined as the block size value of the cross-sectional design; an orthogonal Latin square is constructed through a second calculation formula, and the order of the orthogonal Latin square is the number of elements in the group; and a cross-sectional design is constructed based on the orthogonal Latin square;

[0075] The first operation formula includes:

[0076]

[0077] Where m represents the number of elements in the group, that is, the number of elements in each division in the cross-sectional design, or the number of elements in the group or the size of the group in the group test; n represents the total number of elements; Indicates rounding up;

[0078] The second operation formula includes:

[0079]

[0080] Among them, A (e) represents the e-th orthogonal Latin square; represents the matrix value of the i-th row and j-th column in the e-th orthogonal Latin square; k represents the upper limit value. It should be noted that in this process, if n≠m 2 , the target digital signature can be padded so that n = m 2, such as directly applying 0 to fill the target digital signature.

[0081] In a specific application scenario, in the process of constructing a cross-sectional design based on an orthogonal Latin square, an upper limit value plus 1 orthogonal array can be constructed based on the first matrix, the second matrix and the orthogonal Latin square, and the order of the array is the number of elements in the group;

[0082] Array-based construction of cross-sectional designs;

[0083] Among them, the first matrix is:

[0084]

[0085] The second matrix is:

[0086]

[0087] It should be noted that any subset family on a finite set X is a block design on X, denoted by X is called the base set of this design, and the subset family Subsets B i (i=1,…,t) is called the block group of this design.

[0088] If the block design If there is a partition of the basis set X (Among them, G j , j=1,…,k is called a group), and satisfies:

[0089] (1) For any Then |B|=k;

[0090] (2) For any Then |G j |=m;

[0091] (3) The number of encounters between different elements in the same group in X in the block group λ D (x,y) is always zero, and the number of encounters between two elements x and y belonging to different groups is λ D (x,y) is a constant that does not depend on x,y, that is, for any x,y∈X, x≠y, then

[0092]

[0093] It is called transversal design (TD), denoted as TD[k,λ;m].

[0094] It should be noted that the necessary and sufficient condition for the existence of TD[k,1;m] is the existence of a k-2 m-order orthogonal Latin square group. The proof process is as follows:

[0095] make is a TD[k,1;m]. According to the definition of TD, for any and any There is |B∩G j |=1, that is, any block group B is composed of one element from each group. Two different groups G 1 and G 2 (Each divided group contains m elements), because Each block in contains exactly one G 1 The middle element and a G 2 elements, and since λ=1, G 1 The elements and G 2 The elements in In each block of The number of blocks is equal to G 1 All elements and G 2 The total number of encounters of all elements, that is:

[0096]

[0097] therefore, There are m 2 Block groups, G 1 The m elements of G 2 The m elements of only meet once in each block group, so G 1 and G 2 Elements in Block Design The ordered number pairs {(g 1 ,g 2 )|g 1 ∈G 1 ,g 2 ∈G 2} appears only once and can be regarded as two orthogonal arrays on {1,…,m}, then G 1 ,…,G k Elements of Block Design The ordered pairs of numbers appear only once in {1,…,m}, which can be regarded as a pairwise orthogonal array on {1,…,m}. In addition to H and G, there must be k-2 orthogonal Latin squares.

[0098] On the contrary, if there are k-2 m-order orthogonal Latin squares, together with H and G, we can construct k pairwise orthogonal m-order array groups, in which each element pair appears only once. In this way, we can construct a TD[k,1;m].

[0099] It should be noted that not all orthogonal Latin squares of any order exist. Bose, Shrikhande and Parker worked together to prove that if n≠2,6, there must be a pair of Latin squares. From the conclusion of the above theorem, it can be seen that when constructing a transversal design, as many Latin squares as possible are needed. According to the finite field existence theorem, for any prime power p τ , there exists a τ elements. Obviously, the constraints of TD[k,1;m] are very similar to the characteristics of a finite field. The following introduces a method for constructing an orthogonal Latin square group through a finite field.

[0100] Let m = p τ is a prime power, F = {0, 1, ..., m-1}, F* ​​= F-{0}, |F| = m = p τ , construct A (1) ,A (2) ,…,A (m-1) for in (1≤e≤m-1, 0≤i,j≤m-1), then A (1) ,A (2) ,…,A (m-1) is a pairwise orthogonal Latin square group. The proof process is as follows:

[0101] For any certain 1≤e≤m-1, that is, e∈F*, when i and j respectively take m elements in F, then The corresponding set F is an m×m matrix When e takes all m-1 non-zero elements in F*, m-1 m×m matrices on the set F are given;

[0102] Let us first prove that each A (e) is an m-order Latin square, that is, the m elements in each row (column) are different from each other. Assume that A (e) In the i 1 The line (i 1 ,j 1 ) and (i 1 ,j 2 ) but So 1 =j 2 Assume A (e) In the j 1 Column (i 1 ,j 1 ) and (i 2 ,j 1 ) but Therefore e(i 1-i 2 )=0, and e≠0, then i 1 =i 2 ;

[0103] Let's prove A (1) ,A (2) ,…,A (m-1) Any two Latin squares and Orthogonal, assuming but Right now:

[0104]

[0105] Then (e 1 -e 2 )i=(e 1 -e 2 )k, due to e 1 ≠e 2 , so (e 1 -e 2 ) -1 , so i = k, substituting in j = l. In summary, A (1) ,A (2) ,…,A (m-1) is a set of pairwise orthogonal Latin squares.

[0106] It should be noted that in the above process, let S be an m-element set. If there is an m×m-order array (i.e., matrix) A whose elements are all on S, and each row and column of which is a full permutation of the set S, then A is called an m-order Latin square on S.

[0107] It should be noted that in the above process, let A = (a ij ) and B=(b ij ) are two m-order arrays on the sets S and S′ respectively. The ordered pair (a ij ,b ij )∈S×S′ is a pair of A and B at position (i,j). A and B are in all m 2 The set of all different pairs at positions is called the ordered pair set of A and B, denoted by |R(A,B)|=m 2 , that is, m 2 If the pairs at each position are different, the arrays A and B are said to be orthogonal, and are denoted by A⊥B.

[0108] In addition, if two Latin squares of order m A and B on the sets S and S′ are orthogonal under the above definition, then the Latin squares A and B are said to be orthogonal. 1 ,…,A tIf the two are orthogonal, then it is called an orthogonal Latin square group. Let H be the first matrix, G = H T is the second matrix, then H and G are orthogonal. If A is any m×m-order array on {1,…,m}, then the necessary and sufficient condition for A to be an m-order Latin square is that A and H and A and G are orthogonal.

[0109] In a digital signature group verification method provided by the present application, in the process of determining the disjunction matrix of the cross-sectional design, the correlation matrix of the cross-sectional design can be determined; and the transposed matrix of the correlation matrix is ​​used as the disjunction matrix.

[0110] That is, the transposed matrix of the association matrix M of the cross-sectional design TD[k,1;m] has the characteristics of a disjunctive matrix, that is, when λ=1 of the TD[k,λ;m] design, the transposed matrix M of its association matrix M T Lambda T is 0 or 1, then M T is a k-1 order disjunctive matrix. The following proves it:

[0111] When λ=1, the inner product of any two columns of the correlation matrix M corresponding to the TD block design is 1, that is, any two columns of M are "1" only once in the same position (row), and any two rows of M are "1" only once in the same position (column). The following is a proof by contradiction. Assume that any two rows of M are "1" at least twice in the same position (column), then any two columns of M are "1" at least twice in the same position (row), which contradicts λ=1. Therefore, the transposed matrix M of M is T Lambda T is 0 or 1, then at this time w = k, from Lemma 1 we know that M T is k-1 (i.e. w -1)-order disjunctive matrix.

[0112] It should be noted that in the 0-1 matrix M with t rows and n columns, C j represents the jth column vector, w j represents the jth column vector C j The weight, C j The number of "1" in ij Represents the column vector C i With C j The dot product of C i With C j The number of 1s on the same row, also called C i With C j Intersection Lambda ij Second-rate.

[0113] Lemma 1: If M is a t×n matrix, the minimum column vector weight is The maximum inner product of any two columns is Then M is a d-order disjunctive matrix, where The proof process is as follows: From the definition of , we can see that the maximum number of intersections between any two column vectors in the matrix M is So the column vector C j and does not contain C j The maximum number of intersections of the union of d column vectors is If the order but Also because w <w j ,but Represents C j and does not contain C j The maximum number of intersections of the union of d column vectors Less than C j The weight w j , so C j cannot be contained by the union of such d column vectors, so M is a d-order disjunctive matrix.

[0114] It should be noted that, corresponding to the block design Where X = {x 1 ,…,x n}and There exists a 0-1 matrix M t×n ={m ij}, (i = 1, ..., t; j = 1, ..., n), t represents the number of blocks, n represents the number of elements in the basis set X, Then it is called M t×n Correlation matrix for block design.

[0115] In a digital signature group verification method provided by the present application, after the target digital signatures are grouped into digital signature groups based on a disjunctive matrix, before the target digital signatures in the legal digital signature group are determined as legal digital signatures, the legality verification results of each digital signature group can also be determined. For example, an aggregate signature algorithm can be used to verify the legality of each digital signature group.

[0116] In a specific application scenario, in the process of determining the upper limit value of illegal signatures in the target digital signature, the legitimacy of all target digital signatures can be verified based on the aggregate signature algorithm; if the legitimacy verification result shows that there are illegal target digital signatures, the step of determining the upper limit value of illegal signatures in the target digital signature is executed; if the legitimacy verification result shows that there are no illegal target digital signatures, subsequent operations can be terminated, etc.

[0117] In a specific application scenario, after determining other target digital signatures other than legal digital signatures as illegal digital signatures, it is also possible to determine whether the number of illegal digital signatures is less than or equal to an upper limit value. If so, it is determined that the verification of the illegal digital signatures is correct. If not, the upper limit value can be adjusted up and the method of this application can be re-executed. The legitimacy of each target digital signature can also be verified in turn, etc. This application does not make specific limitations here.

[0118] For ease of understanding, 25 digital signatures are now verified. It is estimated that the number of illegal signatures contained in them does not exceed 2, so let n = m 2 =5 2 , d=k-1=2, then k=3, m=5, and the cross-sectional design is determined to be TD[3,1;5];

[0119] A 5th-order Latin square constructed using the method of this application is as follows:

[0120]

[0121] Together with H and G, it forms a cross-sectional design TD[3,1;5], and the correlation matrix is ​​M 25×15 , after transposition, we get a 15-row 25-column matrix (M T ) 15×25 , as shown below, we can see that M T It is a 2nd-order disjunctive matrix, and no more than 2 illegal objects can be identified for 25 digital signatures through 15 group detections.

[0122]

[0123] Assuming that the 3rd and 6th digital signatures are illegal, the above group detection is used to obtain the test result Y = (1,1,0,0,0,1,0,1,0,0,0,1,1,0,0) T , due to M 15×25 It is a 2nd-order disjunctive matrix. The “0” in Y indicates that all digital signatures in this group of tests are legal. The legal signatures x can be determined in turn by using the elimination method. 11 x 12 , x 13 , x 14 , x 15 , x 16 , x 17 , x 18 , x 19 , x 20 , x 21 , x 22 , x 23 , x 24 , x 24 , x 2 , x 7 , x4 , x 9 , x 5 , x 10 , x 1 , x 8 ; According to the properties of the disjunctive matrix, we know that the remaining signature x 3 , x 6 It is an illegal signature.

[0124] See also Figure 2 , Figure 2 A structural diagram of a digital signature group verification system provided in an embodiment of the present application.

[0125] A digital signature group verification system provided in an embodiment of the present application may include:

[0126] A first acquisition module 101 is used to acquire multiple target digital signatures to be verified;

[0127] A first determination module 102, used to determine an upper limit value of illegal signatures in the target digital signature;

[0128] A first construction module 103 is used to construct a cross-sectional design based on the total number of target digital signatures and the upper limit value;

[0129] A first grouping module 104 is used to determine a disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents a digital signature group, each column of the disjunctive matrix represents a target digital signature, and a matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group;

[0130] The second determination module 105 is used to group the target digital signatures according to the disjunctive matrix, perform group batch verification of the target digital signatures based on the aggregate signature theory, and determine the target digital signatures in the legal digital signature group as legal digital signatures;

[0131] The third determination module 106 is used to determine other target digital signatures except the legal digital signatures as illegal digital signatures.

[0132] An embodiment of the present application provides a digital signature group verification system, wherein the first construction module may include:

[0133] A first determining unit, used to determine the number of elements in the group of the cross-sectional design based on the total number of values ​​by using a first calculation formula;

[0134] The second determining unit is used to determine the sum of the upper limit value and 1 as the block size value of the cross-sectional design;

[0135] A first construction unit is used to construct an orthogonal Latin square by using a second operation formula, wherein the order of the orthogonal Latin square is the value of the number of elements in the group;

[0136] A second construction unit is used to construct a transverse design based on an orthogonal Latin square;

[0137] The first operation formula includes:

[0138]

[0139] Among them, m represents the number of elements in the group; n represents the total number of elements; Indicates rounding up;

[0140] The second operation formula includes:

[0141] 1≤e≤k-2; 0≤i≤m-1; 0≤j≤m-1;

[0142] Among them, A (e) represents the e-th orthogonal Latin square; represents the matrix value of the i-th row and j-th column in the e-th orthogonal Latin square; k represents the upper limit value.

[0143] In a digital signature group verification system provided by an embodiment of the present application, the second construction unit is specifically used to: construct an upper limit value plus 1 orthogonal array based on the first matrix, the second matrix and the orthogonal Latin square, the order of the array is the number of elements in the group; construct a cross-sectional design based on the array;

[0144] Among them, the first matrix is:

[0145]

[0146] The second matrix is:

[0147]

[0148] In a digital signature group verification system provided by an embodiment of the present application, the second determination module may include:

[0149] a third determining unit, for determining a correlation matrix for a cross-sectional design;

[0150] The first setting unit is used to use the transposed matrix of the correlation matrix as the disjunction matrix.

[0151] A digital signature group verification system provided in an embodiment of the present application may also include:

[0152] The first verification module is used to determine the legitimacy verification result of each digital signature group after grouping the target digital signature into digital signature groups based on the disjunctive matrix and before determining the target digital signature in the legal digital signature group as a legal digital signature.

[0153] In a digital signature group verification system provided by an embodiment of the present application, the first determination module may include:

[0154] The first verification unit is used to verify the legitimacy of all target digital signatures based on the aggregate signature algorithm; if the legitimacy verification result shows that there are illegal target digital signatures, the step of determining the upper limit value of the illegal signatures in the target digital signatures is executed.

[0155] A digital signature group verification system provided in an embodiment of the present application may also include:

[0156] The first judgment module is used to judge whether the number of illegal digital signatures is less than or equal to the upper limit value after the third determination module determines other target digital signatures except the legal digital signatures as illegal digital signatures. If so, it is determined that the verification of the illegal digital signatures is correct.

[0157] The present application also provides a digital signature group verification device and a computer-readable storage medium, both of which have the corresponding effects of the digital signature group verification method provided in the embodiment of the present application. Figure 3 , Figure 3 A structural diagram of a digital signature group verification device provided in an embodiment of the present application.

[0158] A digital signature group verification device provided in an embodiment of the present application includes a memory 201 and a processor 202. The memory 201 stores a computer program. When the processor 202 executes the computer program, the steps of the digital signature group verification method described in any of the above embodiments are implemented.

[0159] See also Figure 4, another digital signature group verification device provided in the embodiment of the present application may also include: an input port 203 connected to the processor 202, used to transmit commands input from the outside to the processor 202; a display unit 204 connected to the processor 202, used to display the processing results of the processor 202 to the outside; a communication module 205 connected to the processor 202, used to realize the communication between the digital signature group verification device and the outside. The display unit 204 can be a display panel, a laser scanning display, etc.; the communication mode adopted by the communication module 205 includes but is not limited to mobile high-definition link technology (HML), universal serial bus (USB), high-definition multimedia interface (HDMI), wireless connection: wireless fidelity technology (WiFi), Bluetooth communication technology, low-power Bluetooth communication technology, and communication technology based on IEEE802.11s.

[0160] An embodiment of the present application provides a computer-readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, the steps of the digital signature group verification method described in any of the above embodiments are implemented.

[0161] The computer-readable storage medium involved in the present application includes random access memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disks, removable disks, CD-ROMs, or any other form of storage medium known in the technical field.

[0162] For the description of the relevant parts of the digital signature group verification system, device and computer-readable storage medium provided in the embodiments of the present application, please refer to the detailed description of the corresponding parts in the digital signature group verification method provided in the embodiments of the present application, which will not be repeated here. In addition, the parts of the above-mentioned technical solutions provided in the embodiments of the present application that are consistent with the implementation principles of the corresponding technical solutions in the prior art are not described in detail to avoid excessive elaboration.

[0163] It should also be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0164] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A digital signature group verification method, characterized in that: include: Obtain multiple target digital signatures to be verified; Determining an upper limit value of illegal signatures in the target digital signature; Constructing a cross-sectional design based on the total number of target digital signatures and the upper limit value; Determine a disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents one of the digital signature groups, each column of the disjunctive matrix represents one of the target digital signatures, and a matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group; The target digital signatures are grouped according to the disjunctive matrix, and group batch verification of the target digital signatures is performed based on the aggregate signature theory, and the target digital signatures in the legal digital signature group are determined as legal digital signatures; Determine the target digital signatures other than the legal digital signature as illegal digital signatures; Wherein, after grouping the target digital signatures into digital signature groups based on the disjunctive matrix and before determining the target digital signatures in the legal digital signature group as legal digital signatures, the method further includes: Determining the legitimacy verification results of each of the digital signature groups; Wherein, determining the upper limit value of illegal signatures in the target digital signature includes: Verify the legitimacy of all target digital signatures based on an aggregate signature algorithm; If the legitimacy verification result indicates that there is an illegal target digital signature, then executing the step of determining the upper limit value of the illegal signature in the target digital signature; After determining the target digital signatures other than the legal digital signature as illegal digital signatures, the method further includes: Determine whether the number of the illegal digital signatures is less than or equal to the upper limit value. If so, determine that the illegal digital signature verification is correct; if not, increase the upper limit value, return to execute the step of constructing a cross-sectional design based on the total number of target digital signatures and the upper limit value.

2. The method according to claim 1, characterized in that The constructing a cross-sectional design based on the total number of target digital signatures and the upper limit value includes: Determine the number of elements in the group of the cross-sectional design based on the total number of elements by a first calculation formula; The sum of the upper limit value and 1 is determined as the block size value of the cross-sectional design; By using the second operation formula, an orthogonal Latin square is constructed, wherein the order of the orthogonal Latin square is the value of the number of elements in the group; constructing the cross-sectional design based on the orthogonal Latin square; The first operation formula includes: Wherein, m represents the number of elements in the group; n represents the total number of elements; Indicates rounding up; The second operation formula includes: Among them, A (e) represents the e-th orthogonal Latin square; represents the matrix value of the i-th row and j-th column in the e-th orthogonal Latin square; k represents the upper limit value.

3. The method according to claim 2, characterized in that The constructing the cross-sectional design based on the orthogonal Latin square comprises: Constructing an array of the upper limit value plus 1 orthogonal value based on the first matrix, the second matrix and the orthogonal Latin square, wherein the order of the array is the number of elements in the group; constructing the cross-sectional design based on the array; Among them, the first matrix is: The second matrix is:

4. The method according to claim 3, characterized in that The step of determining a disjunctive matrix for the cross-sectional design comprises: determining a correlation matrix for the cross-sectional design; The transposed matrix of the incidence matrix is ​​used as the disjunction matrix.

5. A digital signature group verification system, characterized in that: include: A first acquisition module, used to acquire multiple target digital signatures to be verified; A first determination module, used to determine an upper limit value of illegal signatures in the target digital signature; A first construction module, configured to construct a cross-sectional design based on the total number of target digital signatures and the upper limit value; A first grouping module is used to determine a disjunctive matrix of the cross-sectional design, and group the target digital signatures into digital signature groups based on the disjunctive matrix; wherein each row of the disjunctive matrix represents one of the digital signature groups, each column of the disjunctive matrix represents one of the target digital signatures, and a matrix value in the disjunctive matrix represents whether the digital signature is in the digital signature group; A second determination module is used to group the target digital signatures according to the disjunctive matrix, perform group batch verification of the target digital signatures based on the aggregate signature theory, and determine the target digital signatures in the legal digital signature group as legal digital signatures; A third determination module, used for determining other target digital signatures except the legal digital signature as illegal digital signatures; Among them, it also includes: A first verification module, configured to determine the legitimacy verification result of each digital signature group after the target digital signatures are grouped into digital signature groups based on the disjunctive matrix and before the target digital signatures in the legal digital signature group are determined as legal digital signatures; Wherein, the first determining module includes: A first verification unit is used to verify the legitimacy of all the target digital signatures based on an aggregate signature algorithm; if the legitimacy verification result indicates that there are illegal target digital signatures, the step of determining the upper limit value of illegal signatures in the target digital signatures is executed; Among them, it also includes: The first judgment module is used to judge whether the number of the target digital signatures other than the legal digital signature is less than or equal to the upper limit value after the third determination module determines that the target digital signatures other than the legal digital signature are illegal digital signatures. If so, it is determined that the verification of the illegal digital signatures is correct; if not, the upper limit value is increased, and the step of constructing a cross-sectional design based on the total number of target digital signatures and the upper limit value is returned to be executed.

6. A digital signature group verification device, characterized in that: include: Memory for storing computer programs; A processor, configured to implement the steps of the digital signature group verification method as claimed in any one of claims 1 to 4 when executing the computer program.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the digital signature group verification method according to any one of claims 1 to 4 are implemented.

Images