CN110400409A - Thresholding voting method, system and relevant device based on BLS signature algorithm - Google Patents
Thresholding voting method, system and relevant device based on BLS signature algorithm Download PDFInfo
- Publication number
- CN110400409A CN110400409A CN201910684684.4A CN201910684684A CN110400409A CN 110400409 A CN110400409 A CN 110400409A CN 201910684684 A CN201910684684 A CN 201910684684A CN 110400409 A CN110400409 A CN 110400409A
- Authority
- CN
- China
- Prior art keywords
- node
- ballot
- polling cycle
- public key
- voting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 75
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 57
- 238000002922 simulated annealing Methods 0.000 claims abstract description 25
- 230000005540 biological transmission Effects 0.000 claims abstract description 17
- 238000012790 confirmation Methods 0.000 claims abstract description 7
- 238000006116 polymerization reaction Methods 0.000 claims description 109
- 239000013598 vector Substances 0.000 claims description 67
- 230000002776 aggregation Effects 0.000 claims description 45
- 238000004220 aggregation Methods 0.000 claims description 45
- 238000003860 storage Methods 0.000 claims description 28
- 238000004590 computer program Methods 0.000 claims description 16
- 230000001360 synchronised effect Effects 0.000 claims description 10
- 239000011159 matrix material Substances 0.000 claims description 8
- 238000012795 verification Methods 0.000 claims description 7
- 238000012360 testing method Methods 0.000 claims description 2
- 230000000694 effects Effects 0.000 claims 1
- 230000008569 process Effects 0.000 abstract description 23
- 238000004364 calculation method Methods 0.000 description 10
- 239000000203 mixture Substances 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 238000000137 annealing Methods 0.000 description 5
- 235000013399 edible fruits Nutrition 0.000 description 5
- 241001269238 Data Species 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 229920002755 poly(epichlorohydrin) Polymers 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000737 periodic effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C13/00—Voting apparatus
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/0825—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
- H04L9/3252—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using DSA or related signature schemes, e.g. elliptic based signatures, ElGamal or Schnorr schemes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Time Recorders, Dirve Recorders, Access Control (AREA)
Abstract
Thresholding voting method, system and relevant device based on BLS signature algorithm, for saving the network system resources in thresholding voting process.Embodiment method can include: receive the signed data for node transmission of effectively voting in the current ballot period；If the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T, then confirmation is voted through, and A preferred nodes of the first preset number are selected from node of effectively voting in the current ballot period using simulated annealing, the A is no more than N and not less than the product of M and T；It is polymerize using the signed data that BLS signature algorithm sends preferred node all in the current ballot period, generates corresponding aggregate signature data；The identity information of the aggregate signature data and corresponding preferred node is sent to verifying node device.
Description
Technical field
The present invention relates to information security fields, more particularly to thresholding voting method, system and phase based on BLS signature algorithm
Close equipment.
Background technique
With the rapid development of network, network-based ballot mode is on a large scale instead of original paper ballot side
Formula.
Existing network voting mode, is often based on digital signature technology, by the private key pair of each ballot node itself
Vote information is digitally signed, and signing messages is sent to statistics node, finally by the digital signature of all ballot nodes
Verifying node is sent to be verified.
The digital signature data for needing aggregation to send all ballot nodes in existing scheme gives verifying node, especially
When applying to block chain network, it is also necessary to which block chain network stores the digital signature of all ballot nodes, waste bandwidth and storage
Resource.
Summary of the invention
The embodiment of the invention provides a kind of thresholding voting method, system and relevant devices based on BLS signature algorithm, use
Network system resources in saving thresholding voting process.
First aspect of the embodiment of the present invention provides a kind of thresholding voting method based on BLS signature algorithm, applies to gather
Close node device, this method can include:
Receive the signed data for node transmission of effectively voting in the current ballot period；
If the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T, really
Recognize and vote through, and the first preset number A is selected from node of effectively voting in the current ballot period using simulated annealing
A preferred node, the A is no more than N and not less than the product of M and T；
It is polymerize using the signed data that BLS signature algorithm sends preferred node all in the current ballot period,
Generate corresponding aggregate signature data；
The identity information of the aggregate signature data and corresponding preferred node is sent to verifying node device, so that
It verifies node device and verifies the aggregate signature data.
Optionally, as a kind of possible embodiment, in the embodiment of the present invention, it is described using simulated annealing from working as
It effectively votes in preceding polling cycle and selects A preferably nodes of the first preset number in node and include:
Number is effectively voted most from selecting in nearest W history polling cycle in node of effectively voting in the current ballot period
Preceding A more preferred nodes.
Optionally, as a kind of possible embodiment, described effective out of current ballot the period in the embodiment of the present invention
Most preceding A preferably node of number of effectively voting in nearest W history polling cycle is selected in ballot node includes:
According to the identity information for node of effectively voting in the current ballot period received construct first kind voting results to
Amount, wherein the corresponding first kind voting results vector of each polling cycle, each ballot node are tied in first kind ballot
A corresponding dimension values in fruit vector, the corresponding dimension values of all effective ballot nodes are identical, remaining corresponding dimension of node of voting
Angle value is identical；
The corresponding voting results vector of nearest W history polling cycle is preserved in aggregation equipment, forms M × W's
Matrix, mi,jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formula
The corresponding weight of each effectively ballot node is calculated, wherein all effective ballot nodes form set R, i in the current ballot period
∈R；
Weighted value the first preset number A in the top is determined preferably according to each effective corresponding weight of node of voting
Node.
Optionally, as a kind of possible embodiment, in the embodiment of the present invention, when verifying node device polymerize with described
It is stored with W identical history polling cycles in node device, the identity of the corresponding A preferred node of each history polling cycle
It is described that first preset number A is selected from node of effectively voting in the current ballot period using simulated annealing when information
It is preferred that node includes:
Judge in the W history polling cycle with the presence or absence of first object polling cycle, the first object ballot week
The set that all preferred nodes are formed in phaseWherein set Q is the set of node of effectively voting in the current ballot period；
The first object polling cycle if it exists, it is determined that the corresponding preferred node of the first object polling cycle is
Current ballot period corresponding preferred node；
The first object polling cycle if it does not exist then judges in the W history polling cycle with the presence or absence of second
Target polling cycle, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Multiple second target polling cycles if it exists then calculate the weight of each second target polling cycleAnd preferred polling cycle is selected according to the weight of each second target polling cycle, wherein with the current ballot period
The corresponding number k of the shorter polling cycle of time interval is smaller；
Select the destination node and the corresponding set R of the preferred polling cycle in the set Q2In node make
For current ballot period corresponding A preferred node, wherein the destination node and set R2In each node it is different.
Optionally, as a kind of possible embodiment, the thresholding ballot side of the BLS signature algorithm in the embodiment of the present invention
Method can also include:
The newest public key data of all ballot nodes is obtained, and judges whether newest public key data has update, if having
It updates, then newest public key data is synchronized to all verifying node devices, and determine the corresponding ballot section of the public key being not present
Point is used as and leaves node；
If there are the first history polling cycle in the W history polling cycle, in the first history polling cycle
The node that leaves is effective ballot node or the preferred node, then deletes described the stored in the aggregation equipment
The identity information of the identity information of all preferred nodes or all effective ballot nodes in one history polling cycle.
Second aspect of the embodiment of the present invention provides a kind of thresholding voting method based on BLS signature algorithm, applies to test
Node device is demonstrate,proved, is stored with the corresponding polymerization public key of W history polling cycle in the verifying node device, this method can wrap
It includes:
Receive the aggregate signature data in the current ballot period that aggregation equipment is sent and the body of corresponding preferred node
Part information；
From the corresponding polymerization public key of nearest W history polling cycle, section corresponding with the aggregate signature data is determined
The most like polymerization public key of point public key set is as optimal polymerization public key；
The division arithmetic of the multiplication and/or discrete logarithm that carry out discrete logarithm on the basis of the optimal polymerization public key obtains
The corresponding newest polymerization public key of node of effectively voting in the current ballot period, and according to the newest polymerization public key verifications
Aggregate signature data.
Optionally, as a kind of possible embodiment, described to vote week from nearest W history in the embodiment of the present invention
In phase corresponding polymerization public key, determine that the most like polymerization public key of node public key set corresponding with the aggregate signature data is made
Include: for optimal polymerization public key
The corresponding second class ballot of current ballot period is constructed according to the identity information of the preferred node in current ballot period
Result vector VR, wherein each polling cycle corresponds to a second class voting results vector, each ballot node is second
A corresponding dimension values in class voting results vector, the corresponding dimension values of all preferred nodes are identical, remaining ballot node is corresponding
Dimension values it is identical；
Calculate corresponding W the second class voting results vector V of W history polling cycle being locally storedkWith the VRThe Chinese
Prescribed distance, wherein 1≤k≤W, and the determining and VRThe smallest V of Hamming distancekPolymerization in corresponding history polling cycle
Public key is as optimal polymerization public key.
Optionally, as a kind of possible embodiment, the thresholding ballot side of the BLS signature algorithm in the embodiment of the present invention
Method can also include:
The newest public key data of all ballot nodes is synchronized, and judges whether the newest public key data has update, if having
It updates, then and the determining corresponding ballot node of public key being not present is used as and leaves node；
If there are the first history polling cycle in the W history polling cycle, in the first history polling cycle
The node that leaves is effective ballot node or the preferred node, then deletes described the stored in the verifying node device
The identity information of all preferred nodes and polymerization public key in one history polling cycle.
The third aspect of the embodiment of the present invention provides a kind of block catenary system, which is characterized in that the block catenary system packet
Include aggregation equipment and verifying node device, wherein
The aggregation equipment is used to execute the thresholding voting method of the BLS signature algorithm as described in any one of first aspect
Step in embodiment；
The verifying node device is used to execute the thresholding voting method of the BLS signature algorithm as described in any one of second aspect
Step in embodiment.
Fourth aspect of the embodiment of the present invention provides a kind of terminal device, and the terminal device includes memory and processing
Device is stored with the computer program that can be run on the processor on the memory, and the computer program is by the place
It manages and is realized when device executes as described in first aspect and any one of second aspect in the thresholding voting method embodiment of BLS signature algorithm
The step of.
Optionally, as a kind of possible embodiment, the terminal device in the embodiment of the present invention be composition CDN network or
The node of person's block chain network.
The 5th aspect of the embodiment of the present invention provides a kind of thresholding ballot system based on BLS signature algorithm, can wrap
It includes:
Receiving unit, for receiving the signed data for node transmission of effectively voting in the current ballot period；
Selecting unit, if the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than the first threshold
Value T, then confirmation is voted through, then it is pre- first to be selected from node of effectively voting in the current ballot period using simulated annealing
If A preferred nodes of number, the A is no more than N and not less than the product of M and T；
Polymerized unit, the signed data that preferred node all in the current ballot period is sent using BLS signature algorithm
It is polymerize, generates corresponding aggregate signature data；
Transmission unit, for the identity information of the aggregate signature data and corresponding preferred node to be sent to verifying section
Point device, so that verifying node device verifies the aggregate signature data.
The 6th aspect of the embodiment of the present invention provides a kind of computer readable storage medium, which is characterized in that the calculating
Computer program is stored on machine readable storage medium storing program for executing, the computer program can be executed by one or more processor, with
Realize the step in the thresholding voting method embodiment as described in first aspect and any one of second aspect based on BLS signature algorithm
Suddenly.
The 7th aspect of the embodiment of the present invention provides a kind of computer program product, which is characterized in that refers to including computer
It enables, when run on a computer, computer is allowed to execute any one of above-mentioned first aspect and second aspect base
Step in the thresholding voting method embodiment of BLS signature algorithm.
There is above know:
It, can be from working as after aggregation equipment determines voting through in the current ballot period in the embodiment of the present invention
It effectively votes in preceding polling cycle and selects the preferred node of the first preset number in node, and using BLS signature algorithm to current
The signed data that all preferred nodes are sent in polling cycle is polymerize, and corresponding aggregate signature data are generated, due to poly-
The sum of the occupied memory space of all signed datas that the occupied memory space of signed data is less than composition aggregate signature is closed,
The bandwidth and memory space that data transmission occupies can thus be saved.Secondly, using simulation during choosing preferred node
Annealing algorithm, the preferred node group which can choose global optimum close, save optimal polymerization public key with newest and polymerize public affairs
The public key aminated polyepichlorohydrin of key same composition member, and then reduce verifying node device and calculate current ballot period corresponding polymerization public affairs
The calculation amount of key.
Detailed description of the invention
Fig. 1 is a kind of thresholding voting method one embodiment schematic diagram based on BLS signature algorithm in the embodiment of the present invention；
Fig. 2 is a kind of another embodiment of thresholding voting method signal based on BLS signature algorithm in the embodiment of the present invention
Figure；
Fig. 3 is that a kind of thresholding voting method based on BLS signature algorithm one specific uses is implemented in the embodiment of the present invention
It illustrates and is intended to；
Another is specific with real for the thresholding voting method based on BLS signature algorithm a kind of in the embodiment of the present invention by Fig. 4
Illustration is applied to be intended to；
Fig. 5 is a kind of thresholding ballot system one embodiment schematic diagram based on BLS signature algorithm in the embodiment of the present invention；
Fig. 6 is a kind of one embodiment schematic diagram of terminal device in the embodiment of the present invention.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention.Based on the embodiments of the present invention, those of ordinary skill in the art are not before making creative work
Every other embodiment obtained is put, shall fall within the protection scope of the present invention.
The description and claims of this application and term " first ", " second ", " third ", " in above-mentioned attached drawing
The (if present)s such as four " are to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should manage
The data that solution uses in this way are interchangeable under appropriate circumstances, so that the embodiments described herein can be in addition to illustrating herein
Or the sequence other than the content of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, for example, containing the process, method, system, product or equipment of a series of steps or units need not limit
In step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, produce
The other step or units of product or equipment inherently.
It should be noted that the description for being related to " first ", " second " etc. in the present invention is used for description purposes only, and cannot
It is interpreted as its relative importance of indication or suggestion or implicitly indicates the quantity of indicated technical characteristic.Define as a result, " the
One ", the feature of " second " can explicitly or implicitly include at least one of the features.In addition, the skill between each embodiment
Art scheme can be combined with each other, but must be based on can be realized by those of ordinary skill in the art, when technical solution
Will be understood that the combination of this technical solution is not present in conjunction with there is conflicting or cannot achieve when, also not the present invention claims
Protection scope within.
Multi-signature is a kind of special Digital Signature Algorithm.On the basis of general digital signature, multi-signature is additional
It is required that different user can polymerize the signature of the same information.Signature size after polymerization should be less than all different users
Summation before signature polymerization, while verifying the signature after polymerization can make verifier believe that signature group is signed really.
In a multi-signature system, there are Three role, signer, polymerization person, verifiers.Signer includes multiple user's sections
Point, they have respectively different public keys, private key, and sign to a shared information.Polymerization person is often by some
User node undertakes, it is polymerize after collecting the signature from signer.Verifier may include any number of user's section
Point.Verifier determines whether that the signer of all participations all signs to the information by the signature after verifying polymerization.
Applicant have observed that during multi-signature algorithm being applied to network voting, such as can be by all ballots
The signed data of person carries out polymerization and generates aggregate signature data, needs the public key by all voters to polymerize in verification process
And according to the polymerization public key verifications aggregate signature data.Although however this mode can reduce the occupied network of signed data
Resource, but still have the space advanced optimized.For example, carry out signature polymerization using BLS aggregate signature algorithm, when there is N number of throwing
When ticket node, corresponding each verifying node in order to verify aggregate signature, each time verifying calculate require carry out about n times from
The multiplying of logarithm is dissipated to obtain polymerization public key, and when the value of N is huge, calculating polymerization public key all can in verification process each time
A large amount of computing resource and time are expended, then the wasting of resources is more serious for multiple authentication.
For ease of understanding, the detailed process in the embodiment of the present invention is described below, referring to Fig. 1, the present invention is real
Applying a kind of thresholding voting method one embodiment based on BLS signature algorithm in example includes:
101, the signed data for node transmission of effectively voting in the current ballot period is received；
In the embodiment of the present invention, when ballot node proposal information corresponding to polled data is agreed with during network voting
When, polled data can be carried out the corresponding signed data of signature generation and be sent to aggregation to set according to the private key of itself
Standby, the ballot node for sending signed data is exactly effective ballot node in the current ballot period, and aggregation equipment can connect
Receive the signed data that all effective ballot nodes are sent in the current ballot period.
If 102, the effectively ratio of the total number M of the number N of ballot node and all ballot nodes is more than first threshold T,
A preferred nodes of the first preset number are then selected from node of effectively voting in the current ballot period using simulated annealing；
After ballot is completed, aggregation equipment can count the number N and all ballots for calculating effectively ballot node
The ratio of the total number M of node illustrates ballot not by without carrying out if the ratio is not above preset first threshold T
Signed data polymerization, if the ratio is more than preset first threshold T, illustrates to vote through, needs to carry out signed data polymerization.
The number of node of effectively voting in practice is likely larger than the product of M and T, however applicant have observed that confirmation is voted through only
It needs to verify the authenticity of the signature of at least M*T nodes of effectively voting, such as T is set in 1000 ballot nodes and is
0.5, the number for node of effectively voting in the current ballot period is 800, then at least only needs to verify 500 effectively ballot nodes
Signature authenticity, polymerize without the signed data to all 800 ballots nodes.In view of this, the application is real
Apply in example that can to select the first preset number A from node of effectively voting in the current ballot period using simulated annealing excellent
Node is selected, A is no more than N and not less than the product of M and T.
Applicant have observed that effective ballot node in each of multiple voting process polling cycle is not complete
It is different, i.e., the effective ballot node set formed in voting process each time, the corresponding effective throwing of multiple history polling cycles
There are overlapping interval between ticket node set, between the forming member of the corresponding polymerization public key of multiple history polling cycles there is also
Overlapping.In view of this, can be saved using simulated annealing from effective ballot in the current ballot period in the embodiment of the present application
The selection ballot higher first preset number A of probability preferred nodes in point, and by A preferably the corresponding signed datas of node into
Row polymerization, so that the aggregate signature data in current ballot period corresponding polymerization public key and history polling cycle polymerize public key
Forming member's degree of overlapping is higher.
Specifically, simulated annealing is difficult to the problem of accurately finding out optimal solution for calculating.After finding out a solution, this
A to solve closer optimal solution, then the probability for receiving this solution is bigger.Meanwhile even if one solves far from optimal solution, still have small general
Rate receives this solution, falls into locally optimal solution for preventing from calculating.In embodiments of the present invention, because of each verifying node meter
Calculation, storage capacity are limited, only can retain nearest polymerization result several times, if the preferred node set difference mistake selected every time
Greatly, then it is contemplated that every wheel verifying node is intended to largely be calculated.Therefore, the aggregate signature data after not only guaranteeing polymerization
The degree of overlapping of corresponding polymerization public key and the forming member for polymerizeing public key for verifying the history polling cycle that node saves, is wanted simultaneously
Guarantee that the preferred node of selection and the preferred node that next round participates in ballot are close as far as possible.Aggregation equipment can be using simulation
Annealing algorithm effectively votes number most from selecting in nearest W history polling cycle in node of effectively voting in the current ballot period
Preceding A more preferred nodes.
Optionally, as a kind of possible embodiment, it is thrown using simulated annealing from current in the embodiment of the present invention
It effectively votes in the ticket period and selects number most preceding A preferred section of effectively voting in nearest W history polling cycle in node
It puts and includes:
According to the identity information for node of effectively voting in the current ballot period received construct first kind voting results to
Amount, wherein the corresponding first kind voting results vector of each polling cycle, each ballot node are tied in first kind ballot
A corresponding dimension values in fruit vector, the corresponding dimension values of all effective ballot nodes are identical, remaining corresponding dimension of node of voting
Angle value is identical；
The corresponding voting results vector of nearest W history polling cycle is preserved in aggregation equipment, forms M × W's
Matrix, mi,jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formula
The corresponding weight of each effectively ballot node is calculated, wherein all effective ballot nodes form set R, i in the current ballot period
∈R；
Weighted value the first preset number A in the top is determined preferably according to each effective corresponding weight of node of voting
Node.
It should be noted that being for preserving the corresponding number of nearest W history polling cycle in aggregation equipment
It is determined according to the time interval apart from the current ballot period, apart from the smaller corresponding number of the time interval in current ballot period
It is smaller.Calculating process refer to, generate a random number r, ifIt sets up, then corresponding mi,jProbability value
It is 1, if otherwiseIt sets up, then corresponding mi,jProbability value be 0.It can be understood that the weighted value in above-described embodimentIt is only exemplary, can be reasonably arranged according to actual needs, it is only necessary to meet simulated annealing principle.
Optionally, as a kind of possible embodiment, a when being stored with W in verifying node device and aggregation equipment
Identical history polling cycle, each history polling cycle it is corresponding A preferably the identity information of node when, the embodiment of the present invention
It is middle that the preferably node packet of first preset number A is selected from node of effectively voting in the current ballot period using simulated annealing
It includes:
Judge to whether there is first object polling cycle in W history polling cycle, own in first object polling cycle
It is preferred that the set that node is formedWherein set Q is the set of node of effectively voting in the current ballot period；
First object polling cycle if it exists, it is determined that the corresponding preferred node of first object polling cycle is current ballot
Period corresponding preferred node；
First object polling cycle if it does not exist then judges to vote in W history polling cycle with the presence or absence of the second target
In the period, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Multiple second target polling cycles if it exists then calculate the weight of each second target polling cycleAnd according to
The weight of each second target polling cycle selects preferred polling cycle, wherein shorter with current ballot periodic intervals
The corresponding number k of polling cycle is smaller；
A destination node and the corresponding set R of preferred polling cycle in set Q2In node as current ballot week
Phase corresponding A preferred node, wherein destination node and set R2In each node it is different.
Specifically, multiple second target polling cycles if it exists, then it can be according to the power of each second target polling cycle
WeightCalculate total weightIt generates random number r ∈ [0, weight], according to locating for r
Section determine preferred polling cycle, such asIt sets up, then selects the preferred polling cycle of k=1；It sets up, then selects the preferred polling cycle of k=2, and so on, the weight that each k is selected is proper
It is well percentage of its weight in total weight.
The second above-mentioned target polling cycle if it does not exist, can also further find third target polling cycle, this
There are the set that A-2 preferred nodes are formed in three target polling cyclesAnd so on may finally search out preferably
Polling cycle.
It is understood that the data of W history polling cycle of the preservation in verifying node device are set with aggregation
The data of W history polling cycle of standby middle preservation, although all using the number of same letter mark history polling cycle, it can
The data of the history polling cycle of different number to be arranged according to actual needs, i.e. the value of the two W can be different, tool
Body can according to actual needs and hardware resource is reasonably arranged, herein without limitation.
Optionally, the confidence level that ballot is improved in the embodiment of the present invention can choose multiple verifying node devices, example
If optional multiple node devices in block chain network are as verifying node device, specifically herein without limitation.
103, gathered using the signed data that BLS signature algorithm sends preferred node all in the current ballot period
It closes, generates corresponding aggregate signature data；
After determining preferred node all in the current ballot period, aggregation equipment can be calculated using BLS signature
The signed data that method sends preferred node all in the current ballot period polymerize, and generates corresponding aggregate signature number
According to.
Wherein, BLS signature algorithm is department of computer science, Stanford University Dan Boneh, Ben Lynn and Hovav
Tri- people of Shacham proposes that specific algorithm realizes that process is not repeated herein.
104, the identity information of aggregate signature data and corresponding preferred node is sent to verifying node device.
The identity information of aggregate signature data and corresponding preferred node can be sent to verifying section by aggregation equipment
Point device, so that verifying node device verifies aggregate signature data.
It is set it is understood that the identity information of the preferred node in the embodiment of the present invention can be corresponding ballot node
Standby unique number is also possible to the corresponding public key of node device of voting, specifically herein without limitation.
It, can be from working as after aggregation equipment determines voting through in the current ballot period in the embodiment of the present invention
It effectively votes in preceding polling cycle and selects the preferred node of the first preset number in node, and using BLS signature algorithm to current
The signed data that all preferred nodes are sent in polling cycle is polymerize, and corresponding aggregate signature data are generated, due to poly-
The sum of the occupied memory space of all signed datas that the occupied memory space of signed data is less than composition aggregate signature is closed,
The bandwidth and memory space that data transmission occupies can thus be saved.Secondly, using simulation during choosing preferred node
Annealing algorithm, the preferred node group which can choose global optimum close, save optimal polymerization public key with newest and polymerize public affairs
The public key aminated polyepichlorohydrin of key same composition member, and then reduce verifying node device and calculate current ballot period corresponding polymerization public affairs
The calculation amount of key.
Optionally, as a kind of possible embodiment, it on the basis of above-mentioned embodiment shown in FIG. 1, is carrying out often
Before primary polled data statistics, and judge whether newest public key data has update, if there is update, by newest public key
Data are synchronized to all verifying node devices, and the corresponding ballot node of the public key being not present surely is used as and leaves node；
If leaving node in the first history polling cycle there are the first history polling cycle in W history polling cycle
It is effective ballot node or preferred node, then deletes all excellent in the first history polling cycle stored in aggregation equipment
Select the identity information of node or the identity information of all effective ballot nodes.
It is illustrated below in conjunction with verifying process of the detailed process to the verifying node device side in the embodiment of the present invention.
It wherein verifies in node device and is stored with the corresponding polymerization public key of W history polling cycle, referring to Fig. 2, the embodiment of the present invention
A kind of another embodiment of the thresholding voting method of middle BLS signature algorithm can include:
201, the aggregate signature data in the current ballot period that reception aggregation equipment is sent and corresponding preferred node
Identity information；
202, from the corresponding polymerization public key of nearest W history polling cycle, section corresponding with aggregate signature data is determined
The most like polymerization public key of point public key set is as optimal polymerization public key；
Verifying node device can be from the corresponding polymerization public key of nearest W history polling cycle, determining and aggregate signature
The most like polymerization public key of the corresponding node public key set of data is specific to identify aggregate signature data pair as optimal polymerization public key
The method of the most like polymerization public key of the node public key set answered herein without limitation, such as can use simulated annealing meter
The public key degree of overlapping mark phase knowledge and magnanimity for participating in party are calculated, degree of overlapping is higher, and phase knowledge and magnanimity are higher.
Illustratively, verifying node device can construct current according to the identity information of the preferred node in current ballot period
The corresponding second class voting results vector V of polling cycleR；It is W second corresponding to calculate W history polling cycle being locally stored
Class voting results vector VkWith VRHamming distance, and determining and VRThe smallest V of Hamming distancekCorresponding history polling cycle
Interior polymerization public key is as optimal polymerization public key.
Specifically, when verifying node device receive current ballot period corresponding aggregate signature data and it is corresponding preferably
After the identity information of node, the verifying node device in the embodiment of the present invention can be according to the preferred node in current ballot period
Identity information construction current ballot period corresponding second class voting results vector VR, wherein each polling cycle corresponds to one
A second class voting results vector, each ballot node corresponding dimension values in the second class voting results vector, owns
It is preferred that the corresponding dimension values of node are identical, remaining corresponding dimension values of ballot node is identical.Illustratively, it is assumed that whole system is total
Have M ballot node, without loss of generality it is assumed that each node can be indicated with a serial number, each second class ballot knot
Fruit vector have M dimension values respectively with M ballot node one-to-one correspondence, wherein it is preferred that the corresponding dimension values of node are 1,
The dimension values of remaining node are 0, then the second class voting results vector of the corresponding M dimension of each polling cycle.Wherein, current to throw
Ticket period corresponding second class voting results vector VRIndicate, the corresponding second class voting results of other history polling cycles to
Amount uses VkIt indicates, wherein 1≤k≤W.
When verifying node device receives current ballot period corresponding aggregate signature data and corresponding preferred node
After identity information, it is only necessary to find out an optimal history polling cycle in the data of itself storage, the optimal history ballot
Period preferred node set and the similarity of the preferred node set in current ballot period are very big, are based on the history polling cycle pair
It is corresponding that the division arithmetic of multiplication and/or discrete logarithm that the polymerization public key answered can carry out discrete logarithm obtains the current ballot period
Newest polymerization public key, the calculation amount calculated in the current ballot period in signed data verification process can be further reduced.
Such as the preferred node serial number in current ballot period is respectively 1,3,5,7,9, verifies and is stored with history ballot week in node device
Phase corresponding polymerization public key E, the corresponding preferred node serial number of polymerization public key E are 1,3,5,7,8, then only need to polymerization public key
E carries out the division arithmetic (place removes the corresponding public key of preferred node 8) of time discrete logarithm, then carries out the multiplication of time discrete logarithm
Current ballot period corresponding newest polymerization public key can be obtained in operation (multiplied by the corresponding public key of preferred node 9).
Verifying in order to select an optimal history polling cycle from W history polling cycle, in the embodiment of the present invention
Node device can calculate corresponding W the second class voting results vector V of W history polling cycle being locally storedkWith it is newest
The Hamming distance of voting results vector, and determining and VRThe smallest V of Hamming distancekPolymerization in corresponding history polling cycle
Public key is as optimal polymerization public key.
203, the division arithmetic for the multiplication and/or discrete logarithm for carrying out discrete logarithm on the basis of optimal polymerization public key obtains
The corresponding newest polymerization public key of node of effectively voting in the current ballot period, and according to newest polymerization public key verifications aggregate signature
Data.
In the embodiment of the present invention, it is W second corresponding that verifying node device calculates W history polling cycle being locally stored
Class voting results vector VkWith the Hamming distance of newest voting results vector, and determining and VRThe smallest V of Hamming distancekIt is corresponding
History polling cycle in polymerization public key as optimal polymerization public key；Discrete logarithm is carried out on the basis of optimal polymerization public key
Multiplication and/or the division arithmetic of discrete logarithm obtain current ballot period corresponding newest polymerization public key, save optimal poly-
Public key and the newest public key aminated polyepichlorohydrin for polymerizeing public key same composition member are closed, verifying node device is reduced and calculates current ballot
The calculation amount of period corresponding polymerization public key.
In order to make it easy to understand, below in conjunction with specifically with example to the BLS signature algorithm in the embodiment of the present invention
Thresholding voting method, which is described, please refers to Fig. 3 and Fig. 4.
Referring to Fig. 3, assuming that whole system shares M ballot node, each node has public key known to the overall situation.When having
When arbitrary node changes public key, meeting the whole network synchronizes newest public key.Without loss of generality it is assumed that each node can be used a sequence
It number indicates.The result of each verifying node maintenance nearest W times different public key polymerization.The size of W depends on verifying section
The storage and computing capability of point, for example, being determined between 5 to 10 by each verifying node oneself, each node can be different.Often
Secondary result is all indicated using the 0 of a M-bit, 1 vector v.There are some public key in the result of public key polymerization, then vector is at this
It is 1 on public key corresponding position, is otherwise 0.
Result of the aggregation maintenance apart from current time nearest W times each node ballot.The result voted every time uses
0,1 vector of one M-bit indicates, if the node is voted, otherwise it is 0 that vector, which is 1 on the node corresponding position,.The W
A vector forms the matrix of a M × W together.Element m in matrixi,jIndicate the ballot node of serial number i in jth before
Whether vote in secondary effective ballot.
Whether newest aggregation first checks for public key when receiving ballot every time.If public key be not it is newest, explanation has
Node is dynamically added, leaves network.The ballot history for leaving node should be emptied, and is numbered and distributes to new addition network
Node.Then judge whether votes N is greater than tM.If it is less than tM, illustrates votes deficiency, exit this ballot.If N is big
In being equal to tM, tM node is selected from N number of ballot node using following simulated annealing and is polymerize.
Simulated annealing is difficult to the problem of accurately finding out optimal solution for calculating.After finding out a solution, this solution is got over
Close to optimal solution, then the probability for receiving this solution is bigger.Meanwhile even if one solves far from optimal solution, still there is small probability receiving
This solution, for preventing our calculating from falling into locally optimal solution.We the problem of in, we not only to guarantee polymerization after
As a result it is easy to calculate for verification result, while the node that guarantee that the node of selection participates in ballot with next round connects as far as possible
Closely.This is because each verifying node calculates, storage capacity is limited, nearest polymerization result several times only can be retained, if each R
Difference is excessive, then it is contemplated that every wheel verifying node is intended to largely be calculated.At the same time, which node of next round participates in throwing
Ticket is uncertain again.Thus, it is believed that closer to the ballot of epicycle, about close to optimal solution, and calculated with this thinking
The weight of each node, then selects optimal solution.
We indicate the set of effectively ballot node with R, and r is equally distributed random number in [0,1] range, and e is number
Constant is learned, then optional simulated annealing implementation can be with are as follows:
Calculating process is: when i be definite value when, calculate each node probability and WhereinThen corresponding probability P is 1, otherwise corresponding probability P is 0, selects the public key of tM node wherein in the top
Carry out signature aminated polyepichlorohydrin.Finally, the node serial number or public key being related in multi-signature and signature after aggregation polymerization
It is broadcast to all verifying nodes.
Referring to Fig. 4, after verifying the signature that node receives after polymerization, first according to the node serial number or public key received
List extracts the vector of a corresponding M-bit of current polymerization result, then successively calculate the vector and it is previously stored to
The Hamming distance (Hamming Distance) of amount.The calculation method of Hamming distance is as follows:
The vector of two M-bits can be considered as two M dimensional vectors, and each element in vector is 0 or 1.It is opened from the 1st dimension
Begin to M to tie up, if two vector corresponding position elements are different, Hamming distance+1.
After verifying node device calculates the vector of current polymerization result and the Hamming distance of previously stored vector, the Chinese is selected
The corresponding public key polymerization of the smallest vector of prescribed distance, then the polymerization of the public key is calculated as the calculation amount of current public key polymerization most
It is small.
In the present embodiment, by using simulated annealing, aggregation section of selection verifying in advance before being polymerize
The point the smallest public key set of calculation amount, so that needing the multiplication of n times discrete logarithm to calculate originally becomes very little, it is optimal to optimize
To the multiplication of 1 discrete logarithm.Degree of optimization depends on the dynamic factors such as Network status and nodes ' behavior.And simulated annealing is calculated
Method can preferably adapt to the network that the network of dynamic change, especially ballot node frequently pass in and out in view of calculating weight.When
New node enter network start ballot when, the historical record that this node is not voted much at aggregation, but simulate
Annealing algorithm is voted several times in view of the nearest minority of this node, can still allow the node to enter the set of public key polymerization, together
When timely update verifying node verifying set (verifying node verifying set depend on aggregation to public key aggregation
Selection).
Referring to Fig. 5, the embodiment of the invention also provides a kind of thresholding ballot systems of BLS signature algorithm comprising:
Receiving unit 501, for receiving the signed data for node transmission of effectively voting in the current ballot period；
Selecting unit 502, if the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than the
One threshold value T, then confirmation is voted through, then the is selected from node of effectively voting in the current ballot period using simulated annealing
The one preferred node of preset number A, A is no more than N and not less than the product of M and T；
Polymerized unit 503, the number of signature that preferred node all in the current ballot period is sent using BLS signature algorithm
According to being polymerize, corresponding aggregate signature data are generated；
Transmission unit 504, for the identity information of aggregate signature data and corresponding preferred node to be sent to verifying section
Point device, so that verifying node device verifies aggregate signature data.
It, can be from working as after aggregation equipment determines voting through in the current ballot period in the embodiment of the present invention
It effectively votes in preceding polling cycle and selects the preferred node of the first preset number in node, and using BLS signature algorithm to current
The signed data that all preferred nodes are sent in polling cycle is polymerize, and corresponding aggregate signature data are generated, due to poly-
The sum of the occupied memory space of all signed datas that the occupied memory space of signed data is less than composition aggregate signature is closed,
The bandwidth and memory space that data transmission occupies can thus be saved.Secondly, using simulation during choosing preferred node
Annealing algorithm, the preferred node group which can choose global optimum are closed, and then are reduced verifying node device and calculated current throw
The calculation amount of ticket period corresponding polymerization public key.
Optionally, as a kind of possible embodiment, the selecting unit in the embodiment of the present invention may further include:
Module is constructed, the first kind is constructed according to the identity information for node of effectively voting in the current ballot period received and is thrown
Ticket result vector, wherein each polling cycle corresponds to a first kind voting results vector, each ballot node is first
A corresponding dimension values in class voting results vector, the corresponding dimension values of all effective ballot nodes are identical, remaining node of voting
Corresponding dimension values are identical；
Computing module preserves the corresponding voting results vector of nearest W history polling cycle, shape in aggregation equipment
At the matrix of M × W, mi,jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formulaCalculate the corresponding weight of each effectively ballot node, wherein all effective ballots in the current ballot period
Node forms set R, i ∈ R；
Selecting module determines weighted value the first present count in the top according to the corresponding weight of each effective ballot node
A preferred nodes of mesh.
Optionally, as a kind of possible embodiment, it votes when being stored with identical W history in verifying node device
When period corresponding preferred node, the selecting unit in the embodiment of the present invention be may further include:
First judgment module, for judging in W history polling cycle with the presence or absence of first object polling cycle, the first mesh
Mark the set that all preferred nodes are formed in polling cycleWherein set Q is that effectively ballot saves in the current ballot period
The set of point；
First determining module, if it exists first object polling cycle, it is determined that first object polling cycle is corresponding preferably
Node is current ballot period corresponding preferred node；
Second judgment module, first object polling cycle, then judge to whether there is in W history polling cycle if it does not exist
Second target polling cycle, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Second confirmation module, multiple second target polling cycles, then calculate each second target polling cycle if it exists
WeightAnd preferred polling cycle is selected according to the weight of each second target polling cycle, wherein with the current ballot period
The corresponding number k of the shorter polling cycle of time interval is smaller；
Third confirmation module selects a destination node and the corresponding set R of preferred polling cycle in set Q2In
Node is as current ballot period corresponding A preferred node, wherein destination node and set R2In each node it is different.
Optionally, as a kind of possible embodiment, the thresholding of the BLS signature algorithm in the embodiment of the present invention, which is voted, is
Uniting to include:
Updating unit for obtaining the newest public key data of all ballot nodes, and judges whether that newest public key data is
It is no to have update, if there is update, newest public key data is synchronized to all verifying node devices, and delete the public key being not present
Corresponding history polled data.
Optionally, as a kind of possible embodiment, in the embodiment of the present invention BLS signature algorithm thresholding ballot system
Can also include:
Second receiving unit, for receiving the aggregate signature data in current ballot period of aggregation equipment transmission and right
The identity information for the preferred node answered；
Second construction unit, the identity information for the preferred node according to the current ballot period construct the current ballot period
Corresponding second class voting results vector VR, wherein the corresponding second class voting results vector of each polling cycle, each
A ballot node corresponding dimension values in the second class voting results vector, the corresponding dimension values of all preferred nodes are identical,
Remaining corresponding dimension values of ballot node is identical；
Second computing unit calculates corresponding W the second class voting results vector of W history polling cycle being locally stored
VkWith the Hamming distance of newest voting results vector, wherein 1≤k≤W, and determining and VRThe smallest V of Hamming distancekIt is corresponding
Polymerization public key in history polling cycle is as optimal polymerization public key；
Second polymerized unit carries out the multiplication and/or discrete logarithm of discrete logarithm on the basis of optimal polymerization public key
Division arithmetic obtains the corresponding newest polymerization public key of node of effectively voting in the current ballot period.
It is apparent to those skilled in the art that for convenience and simplicity of description, in the embodiment of the present invention
The specific work process of the system, apparatus, and unit of description, can refer to corresponding processes in the foregoing method embodiment, herein not
It repeats again.
Referring to Fig. 6, additionally providing a kind of terminal device in the present embodiment, terminal device 1 can be PC (Personal
Computer, PC), be also possible to smart phone, tablet computer, palm PC, portable computer, intelligent router,
Mine machine, network storage equipment terminal device.
The terminal device 1 can be the node of composition CDN network or block chain network.
The terminal device 1 may include memory 11, processor 12 and bus 13.When processor 11 executes computer program
Realize the step in the thresholding voting method embodiment of above-mentioned BLS signature algorithm shown in FIG. 1, such as step 101 shown in FIG. 1
To 104.Alternatively, processor realizes each module or the function of unit in above-mentioned each Installation practice when executing computer program.
In some embodiments of the present invention, processor is specifically used for realizing following steps:
Receive the signed data for node transmission of effectively voting in the current ballot period；
If the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T, really
Recognize and vote through, and the first preset number A is selected from node of effectively voting in the current ballot period using simulated annealing
A preferred node, A is no more than N and not less than the product of M and T；
It is polymerize using the signed data that BLS signature algorithm sends preferred node all in the current ballot period,
Generate corresponding aggregate signature data；
The identity information of aggregate signature data and corresponding preferred node is sent to verifying node device, so that verifying
Node device verifies aggregate signature data.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
Number is effectively voted most from selecting in nearest W history polling cycle in node of effectively voting in the current ballot period
Preceding A more preferred nodes.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
According to the identity information for node of effectively voting in the current ballot period received construct first kind voting results to
Amount, wherein the corresponding first kind voting results vector of each polling cycle, each ballot node are tied in first kind ballot
A corresponding dimension values in fruit vector, the corresponding dimension values of all effective ballot nodes are identical, remaining corresponding dimension of node of voting
Angle value is identical；
The corresponding voting results vector of nearest W history polling cycle is preserved in aggregation equipment, forms M × W's
Matrix, mi,jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formula
The corresponding weight of each effectively ballot node is calculated, wherein all effective ballot nodes form set R, i in the current ballot period
∈R；
Weighted value the first preset number A in the top is determined preferably according to each effective corresponding weight of node of voting
Node.
When being stored with W identical history polling cycles in verifying node device and aggregation equipment, each history is thrown
The ticket period corresponding A preferably the identity information of node when, optionally, in some embodiments of the present invention, processor can be with
For realizing following steps:
Judge to whether there is first object polling cycle in W history polling cycle, own in first object polling cycle
It is preferred that the set that node is formedWherein set Q is the set of node of effectively voting in the current ballot period；
First object polling cycle if it exists, it is determined that the corresponding preferred node of first object polling cycle is current ballot
Period corresponding preferred node；
First object polling cycle if it does not exist then judges to vote in W history polling cycle with the presence or absence of the second target
In the period, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Multiple second target polling cycles if it exists then calculate the weight of each second target polling cycleAnd according to
The weight of each second target polling cycle selects preferred polling cycle, wherein shorter with current ballot periodic intervals
The corresponding number k of polling cycle is smaller；
Select the destination node and the corresponding set R of preferred polling cycle in set Q2In node thrown as current
Ticket period corresponding A preferred node, wherein destination node and set R2In each node it is different.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The newest public key data of all ballot nodes is obtained, and judges whether newest public key data has update, if having
It updates, then newest public key data is synchronized to all verifying node devices, and determine the corresponding ballot section of the public key being not present
Point is used as and leaves node；
If leaving node in the first history polling cycle there are the first history polling cycle in W history polling cycle
It is effective ballot node or preferred node, then deletes all excellent in the first history polling cycle stored in aggregation equipment
Select the identity information of node or the identity information of all effective ballot nodes.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
Receive the aggregate signature data in the current ballot period that aggregation equipment is sent and the body of corresponding preferred node
Part information；
From the corresponding polymerization public key of nearest W history polling cycle, section corresponding with the aggregate signature data is determined
The most like polymerization public key of point public key set is as optimal polymerization public key；
The division arithmetic of the multiplication and/or discrete logarithm that carry out discrete logarithm on the basis of optimal polymerization public key is worked as
The corresponding newest polymerization public key of node of effectively voting in preceding polling cycle.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The corresponding second class ballot of current ballot period is constructed according to the identity information of the preferred node in current ballot period
Result vector VR, wherein each polling cycle corresponds to a second class voting results vector, each ballot node is second
A corresponding dimension values in class voting results vector, the corresponding dimension values of all preferred nodes are identical, remaining ballot node is corresponding
Dimension values it is identical；
Calculate corresponding W the second class voting results vector V of W history polling cycle being locally storedkWith VRHamming distance
From, wherein 1≤k≤W, and determining and VRThe smallest V of Hamming distancekPolymerization public key conduct in corresponding history polling cycle
Optimal polymerization public key.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The newest public key data of all ballot nodes is synchronized, and judges whether newest public key data has update, if there is update,
Then and the determining corresponding ballot node of public key being not present is used as and leaves node；
If leaving node in the first history polling cycle there are the first history polling cycle in W history polling cycle
It is effective ballot node or preferred node, then deletes all excellent in the first history polling cycle stored in verifying node device
Select the identity information and polymerization public key of node.
Wherein, memory 11 includes at least a type of readable storage medium storing program for executing, and readable storage medium storing program for executing includes flash memory, hard
Disk, multimedia card, card-type memory (for example, SD or DX memory etc.), magnetic storage, disk, CD etc..Memory 11 exists
It can be the internal storage unit of terminal device 1, such as the hard disk of the terminal device 1 in some embodiments.Memory 11 is another
It is also possible to the plug-in type hard disk being equipped on the External memory equipment of terminal device 1, such as terminal device 1 in some embodiments,
Intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash
Card) etc..Further, memory 11 can also both include the internal storage unit of terminal device 1 or set including external storage
It is standby.Memory 11 can be not only used for the application software and Various types of data that storage is installed on terminal device 1, such as computer program
01 code etc. can be also used for temporarily storing the data that has exported or will export.
Processor 12 can be in some embodiments a central processing unit (Central Processing Unit,
CPU), controller, microcontroller, microprocessor or other data processing chips, the program for being stored in run memory 11
Code or processing data, such as execute * * program 01 etc..
The bus 13 can be Peripheral Component Interconnect standard (peripheral component interconnect, abbreviation
PCI) bus or expanding the industrial standard structure (extended industry standard architecture, abbreviation EISA)
Bus etc..The bus can be divided into address bus, data/address bus, control bus etc..For convenient for indicating, in Fig. 6 only with one slightly
Line indicates, it is not intended that an only bus or a type of bus.
Further, terminal device can also include network interface 14, and network interface 14 optionally may include wired connects
Mouthful and/or wireless interface (such as WI-FI interface, blue tooth interface), commonly used in the terminal device 1 and other electronic equipments it
Between establish communication connection.
Optionally, the terminal device 1 can also include user interface, user interface may include display (Display),
Input unit such as keyboard (Keyboard), optional user interface can also include standard wireline interface and wireless interface.It can
Selection of land, in some embodiments, display can be light-emitting diode display, liquid crystal display, touch-control liquid crystal display and OLED
(Organic Light-Emitting Diode, Organic Light Emitting Diode) touches device etc..Wherein, display can also be appropriate
Referred to as display screen or display unit, for being shown in the information handled in terminal device 1 and for showing visual user
Interface.
Fig. 6 illustrates only the terminal device 1 with component 11-14 and computer program 01, and those skilled in the art can
With understanding, the structure shown in Fig. 6 does not constitute the restriction to terminal device 1, may include less or more than illustrating
Component, perhaps combine certain components or different component layouts.
The present invention also provides a kind of computer readable storage medium, calculating is stored on the computer readable storage medium
When computer program is executed by processor, following steps are may be implemented in machine program:
Receive the signed data for node transmission of effectively voting in the current ballot period；
If the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T, really
Recognize and vote through, and the first preset number A is selected from node of effectively voting in the current ballot period using simulated annealing
A preferred node, A is no more than N and not less than the product of M and T；
It is polymerize using the signed data that BLS signature algorithm sends preferred node all in the current ballot period,
Generate corresponding aggregate signature data；
The identity information of aggregate signature data and corresponding preferred node is sent to verifying node device, so that verifying
Node device verifies aggregate signature data.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
Number is effectively voted most from selecting in nearest W history polling cycle in node of effectively voting in the current ballot period
Preceding A more preferred nodes.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
According to the identity information for node of effectively voting in the current ballot period received construct first kind voting results to
Amount, wherein the corresponding first kind voting results vector of each polling cycle, each ballot node are tied in first kind ballot
A corresponding dimension values in fruit vector, the corresponding dimension values of all effective ballot nodes are identical, remaining corresponding dimension of node of voting
Angle value is identical；
The corresponding voting results vector of nearest W history polling cycle is preserved in aggregation equipment, forms M × W's
Matrix, mi,jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formula
The corresponding weight of each effectively ballot node is calculated, wherein all effective ballot nodes form set R, i in the current ballot period
∈R；
Weighted value the first preset number A in the top is determined preferably according to each effective corresponding weight of node of voting
Node.
When being stored with W identical history polling cycles in verifying node device and aggregation equipment, each history is thrown
The ticket period corresponding A preferably the identity information of node when, optionally, in some embodiments of the present invention, processor can be with
For realizing following steps:
Judge to whether there is first object polling cycle in W history polling cycle, own in first object polling cycle
It is preferred that the set that node is formedWherein set Q is the set of node of effectively voting in the current ballot period；
First object polling cycle if it exists, it is determined that the corresponding preferred node of first object polling cycle is current ballot
Period corresponding preferred node；
First object polling cycle if it does not exist then judges to vote in W history polling cycle with the presence or absence of the second target
In the period, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Multiple second target polling cycles if it exists then calculate the weight of each second target polling cycleAnd according to
The weight of each second target polling cycle selects preferred polling cycle, wherein shorter with current ballot periodic intervals
The corresponding number k of polling cycle is smaller；
Select the destination node and the corresponding set R of preferred polling cycle in set Q2In node thrown as current
Ticket period corresponding A preferred node, wherein destination node and set R2In each node it is different.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The newest public key data of all ballot nodes is obtained, and judges whether newest public key data has update, if having
It updates, then newest public key data is synchronized to all verifying node devices, and determine the corresponding ballot section of the public key being not present
Point is used as and leaves node；
If leaving node in the first history polling cycle there are the first history polling cycle in W history polling cycle
It is effective ballot node or preferred node, then deletes all excellent in the first history polling cycle stored in aggregation equipment
Select the identity information of node or the identity information of all effective ballot nodes.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
Receive the aggregate signature data in the current ballot period that aggregation equipment is sent and the body of corresponding preferred node
Part information；
From the corresponding polymerization public key of nearest W history polling cycle, section corresponding with the aggregate signature data is determined
The most like polymerization public key of point public key set is as optimal polymerization public key；
The division arithmetic of the multiplication and/or discrete logarithm that carry out discrete logarithm on the basis of optimal polymerization public key is worked as
The corresponding newest polymerization public key of node of effectively voting in preceding polling cycle.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The corresponding second class ballot of current ballot period is constructed according to the identity information of the preferred node in current ballot period
Result vector VR, wherein each polling cycle corresponds to a second class voting results vector, each ballot node is second
A corresponding dimension values in class voting results vector, the corresponding dimension values of all preferred nodes are identical, remaining ballot node is corresponding
Dimension values it is identical；
Calculate corresponding W the second class voting results vector V of W history polling cycle being locally storedkWith VRHamming distance
From, wherein 1≤k≤W, and determining and VRThe smallest V of Hamming distancekPolymerization public key conduct in corresponding history polling cycle
Optimal polymerization public key.
Optionally, in some embodiments of the present invention, processor can be also used for realizing following steps:
The newest public key data of all ballot nodes is synchronized, and judges whether newest public key data has update, if there is update,
Then and the determining corresponding ballot node of public key being not present is used as and leaves node；
If leaving node in the first history polling cycle there are the first history polling cycle in W history polling cycle
It is effective ballot node or preferred node, then deletes all excellent in the first history polling cycle stored in verifying node device
Select the identity information and polymerization public key of node.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or any combination thereof real
It is existing.When implemented in software, it can entirely or partly realize in the form of a computer program product.
The computer program product includes one or more computer instructions.Load and execute on computers the meter
When calculation machine program instruction, entirely or partly generate according to process or function described in the embodiment of the present invention.The computer can
To be general purpose computer, special purpose computer, computer network or other programmable devices.The computer instruction can be deposited
Storage in a computer-readable storage medium, or from a computer readable storage medium to another computer readable storage medium
Transmission, for example, the computer instruction can pass through wired (example from a web-site, computer, server or data center
Such as coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or wireless (such as infrared, wireless, microwave) mode to another website
Website, computer, server or data center are transmitted.The computer readable storage medium can be computer and can deposit
Any usable medium of storage either includes that the data storages such as one or more usable mediums integrated server, data center are set
It is standby.The usable medium can be magnetic medium, (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or partly lead
Body medium (such as solid state hard disk Solid State Disk (SSD)) etc.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the application
Portion or part steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
It should be noted that the serial number of the above embodiments of the invention is only for description, do not represent the advantages or disadvantages of the embodiments.And
The terms "include", "comprise" herein or any other variant thereof is intended to cover non-exclusive inclusion, so that packet
Process, device, article or the method for including a series of elements not only include those elements, but also including being not explicitly listed
Other element, or further include for this process, device, article or the intrinsic element of method.Do not limiting more
In the case where, the element that is limited by sentence "including a ...", it is not excluded that including process, device, the article of the element
Or there is also other identical elements in method.
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (13)
1. a kind of thresholding voting method based on BLS signature algorithm, which is characterized in that apply to aggregation equipment, the side
Method includes:
Receive the signed data for node transmission of effectively voting in the current ballot period；
If the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T, throwing is confirmed
Ticket passes through, and it is excellent to use simulated annealing to select the first preset number A from node of effectively voting in the current ballot period
Node is selected, the A is no more than N and not less than the product of M and T；
It is polymerize using the signed data that BLS signature algorithm sends preferred node all in the current ballot period, is generated
Corresponding aggregate signature data；
The identity information of the aggregate signature data and corresponding preferred node is sent to verifying node device, so that verifying
Node device verifies the aggregate signature data.
2. the method as described in claim 1, which is characterized in that described to be had out of current ballot the period using simulated annealing
A preferably nodes of the first preset number are selected in effect ballot node includes:
It is most from number of effectively voting in nearest W history polling cycle is selected in node of effectively voting in the current ballot period
Preceding A preferred nodes.
3. according to the method described in claim 2, it is characterized in that, described select from node of effectively voting in the current ballot period
Most preceding A preferably node of number of effectively voting in nearest W history polling cycle out include:
First kind voting results vector is constructed according to the identity information for node of effectively voting in the current ballot period received,
In the corresponding first kind voting results vector of each polling cycle, each ballot node is in first kind voting results vector
For one dimension values of middle correspondence to indicate whether ballot node votes, the corresponding dimension values of all effective ballot nodes are identical,
The corresponding dimension values of remaining ballot node are identical；
The corresponding first kind voting results vector of nearest W history polling cycle is preserved in aggregation equipment, forms M × W
Matrix, mI, jFor i-th of ballot node in jth time polling cycle corresponding dimension values, according to formulaCalculate the corresponding weight of each effectively ballot node, wherein all effective ballots in the current ballot period
Node forms set R, i ∈ R；
The weighted value preferred section of the first preset number A in the top is determined according to each effective corresponding weight of node of voting
Point.
4. the method as described in claim 1, which is characterized in that stored when in verifying node device and the aggregation equipment
Have a W identical history polling cycles, each history polling cycle it is corresponding A preferably the identity information of node when, it is described to adopt
Selecting A preferably nodes of the first preset number from node of effectively voting in the current ballot period with simulated annealing includes:
Judge to whether there is first object polling cycle in the W history polling cycle, in the first object polling cycle
The set that all preferred nodes are formedWherein set Q is the set of node of effectively voting in the current ballot period；
The first object polling cycle if it exists, it is determined that the corresponding preferred node of the first object polling cycle is current
The corresponding preferred node of polling cycle；
The first object polling cycle if it does not exist then judges in the W history polling cycle with the presence or absence of the second target
Polling cycle, there are the A-1 preferred set that are formed of nodes in the second target polling cycle
Multiple second target polling cycles if it exists then calculate the weight of each second target polling cycleAnd
Preferred polling cycle is selected according to the weight of each second target polling cycle, wherein between current ballot cycle time
It is smaller every the shorter corresponding number k of polling cycle；
Select the destination node and the corresponding set R of the preferred polling cycle in the set Q2In node as working as
The corresponding A preferred node of preceding polling cycle, wherein the destination node and set R2In each node it is different.
5. such as method of any of claims 1-4, which is characterized in that further include:
The newest public key data of all ballot nodes is obtained, and judges whether the newest public key data has update, if there is update,
Newest public key data is then synchronized to all verifying node devices, and determines the corresponding ballot node conduct of public key being not present
Leave node；
If described in the first history polling cycle there are the first history polling cycle in the W history polling cycle
Leaving node is effective ballot node or the preferred node, then deletes described first stored in the aggregation equipment and go through
The identity information of the identity information of all preferred nodes or all effective ballot nodes in history polling cycle.
6. a kind of thresholding voting method based on BLS signature algorithm, which is characterized in that apply to verify node device, it is described to test
The corresponding polymerization public key of W history polling cycle is stored in card node device, which comprises
Receive the aggregate signature data in the current ballot period that aggregation equipment is sent and the identity letter of corresponding preferred node
Breath；
From the corresponding polymerization public key of nearest W history polling cycle, determine that node corresponding with the aggregate signature data is public
The most like polymerization public key of key set is as optimal polymerization public key；
The division arithmetic of the multiplication and/or discrete logarithm that carry out discrete logarithm on the basis of the optimal polymerization public key is worked as
The corresponding newest polymerization public key of node of effectively voting in preceding polling cycle, and polymerize according to the newest polymerization public key verifications
Signed data.
7. according to the method described in claim 6, it is characterized in that, described from the corresponding polymerization of nearest W history polling cycle
In public key, determine that the most like polymerization public key of node public key set corresponding with the aggregate signature data is public as optimal polymerization
Key includes:
Current ballot period corresponding second class voting results are constructed according to the identity information of the preferred node in current ballot period
Vector VR, wherein the corresponding second class voting results vector of each polling cycle, each ballot node are thrown in the second class
A corresponding dimension values are to indicate whether ballot node votes in ticket result vector, the corresponding dimension values phase of all preferred nodes
Together, remaining corresponding dimension values of ballot node is identical；
Calculate corresponding W the second class voting results vector V of W history polling cycle being locally storedkWith the VRHamming distance
From, wherein 1≤k≤W, and the determining and VRThe smallest V of Hamming distancekPolymerization public key in corresponding history polling cycle
As optimal polymerization public key.
8. the method for claim 7, which is characterized in that further include:
The newest public key data of all ballot nodes is synchronized, and judges whether the newest public key data has update, if there is update,
Then and the determining corresponding ballot node of public key being not present is used as and leaves node；
If described in the first history polling cycle there are the first history polling cycle in the W history polling cycle
Leaving node is effective ballot node or the preferred node, then deletes described first stored in the verifying node device and go through
The identity information of all preferred nodes and polymerization public key in history polling cycle.
9. a kind of block catenary system, which is characterized in that the block catenary system include aggregation equipment and verifying node device,
Wherein,
The aggregation equipment is used to execute the thresholding based on BLS signature algorithm as described in any one of claims 1 to 5
Step in voting method；
The verifying node device is used to execute the thresholding based on BLS signature algorithm as described in any one of claim 6 to 8
Step in voting method.
10. a kind of terminal device, which is characterized in that the terminal device includes memory and processor, is deposited on the memory
The computer program that can be run on the processor is contained, is realized when the computer program is executed by the processor as weighed
Benefit requires the step in the thresholding voting method of any one of 1-8 BLS signature algorithm.
11. a kind of thresholding ballot system based on BLS signature algorithm characterized by comprising
Receiving unit, for receiving the signed data for node transmission of effectively voting in the current ballot period；
Selecting unit, if the ratio of the total number M of the number N of effectively ballot node and all ballot nodes is more than first threshold T,
Then confirmation is voted through, then selects the first present count from node of effectively voting in the current ballot period using simulated annealing
A preferred nodes of mesh, the A is no more than N and not less than the product of M and T；
Polymerized unit carries out the signed data that preferred node all in the current ballot period is sent using BLS signature algorithm
Polymerization, generates corresponding aggregate signature data；
Transmission unit is set for the identity information of the aggregate signature data and corresponding preferred node to be sent to verifying node
It is standby, so that verifying node device verifies the aggregate signature data.
12. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program, the computer program can be executed by one or more processor, to realize such as any one of claims 1 to 8 institute
The step in the thresholding voting method based on BLS signature algorithm stated.
13. a kind of computer program product, which is characterized in that including computer instruction, when run on a computer, so that
Computer can execute in the thresholding voting method described in any one of the claims 1 to 8 based on BLS signature algorithm
Step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910684684.4A CN110400409B (en) | 2019-07-26 | 2019-07-26 | Threshold voting method, system and related equipment based on BLS signature algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910684684.4A CN110400409B (en) | 2019-07-26 | 2019-07-26 | Threshold voting method, system and related equipment based on BLS signature algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110400409A true CN110400409A (en) | 2019-11-01 |
| CN110400409B CN110400409B (en) | 2022-02-22 |
Family
ID=68325181
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910684684.4A Active CN110400409B (en) | 2019-07-26 | 2019-07-26 | Threshold voting method, system and related equipment based on BLS signature algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110400409B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111443895A (en) * | 2020-03-12 | 2020-07-24 | 杭州泛链科技有限公司 | Verifiable random number generation method applied to block chain |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000021041A1 (en) * | 1998-10-06 | 2000-04-13 | Chavez Robert M | Digital elections network system with online voting and polling |
| JP2000207483A (en) * | 1998-11-11 | 2000-07-28 | Nippon Telegr & Teleph Corp <Ntt> | Electronic voting method, voting system and program recording medium |
| WO2003063055A2 (en) * | 2002-01-23 | 2003-07-31 | Amerasia International Technology, Inc. | Generation and verification of a digitized signature |
| EP1571777A1 (en) * | 2004-03-02 | 2005-09-07 | France Telecom | Electronic voting process using fair blind signatures |
| US20050269406A1 (en) * | 2004-06-07 | 2005-12-08 | Neff C A | Cryptographic systems and methods, including practical high certainty intent verification, such as for encrypted votes in an electronic election |
| US20110139872A1 (en) * | 2009-12-11 | 2011-06-16 | International Lottery and Totalizator Systems, Inc | System and Method for Capturing Write-In Selections on a Paper Ballot |
| CN102568073A (en) * | 2010-12-02 | 2012-07-11 | 微软公司 | Media asset voting |
| CN102629396A (en) * | 2012-04-09 | 2012-08-08 | 中科院成都信息技术有限公司 | Information encryption and quick processing method for alternative candidate-containing electronic votes |
| JP2014130436A (en) * | 2012-12-28 | 2014-07-10 | Musashi Eng Co Ltd | Voting paper classification device |
| CN103955984A (en) * | 2014-03-24 | 2014-07-30 | 广州华多网络科技有限公司 | Method, server, voting processing node and system for achieving interconnection network voting |
| CN106373251A (en) * | 2016-08-30 | 2017-02-01 | 中科院成都信息技术股份有限公司 | Electronic vote counting method based on secret sharing |
| CN107968708A (en) * | 2017-11-10 | 2018-04-27 | 财付通支付科技有限公司 | Generate method, apparatus, terminal and the server of signature |
| CN109360100A (en) * | 2018-11-13 | 2019-02-19 | 北京航空航天大学 | Transaction rapid acknowledgment method and device based on block chain technology |
| CN109522456A (en) * | 2018-11-14 | 2019-03-26 | 全链通有限公司 | The node availability detection generated based on block |
| CN109543075A (en) * | 2018-11-14 | 2019-03-29 | 全链通有限公司 | Block generation method and system |
| CN109816844A (en) * | 2019-01-30 | 2019-05-28 | 陕西师范大学 | A kind of quantum ballot system based on quantum homomorphism signature |
-
2019
- 2019-07-26 CN CN201910684684.4A patent/CN110400409B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2000021041A1 (en) * | 1998-10-06 | 2000-04-13 | Chavez Robert M | Digital elections network system with online voting and polling |
| JP2000207483A (en) * | 1998-11-11 | 2000-07-28 | Nippon Telegr & Teleph Corp <Ntt> | Electronic voting method, voting system and program recording medium |
| WO2003063055A2 (en) * | 2002-01-23 | 2003-07-31 | Amerasia International Technology, Inc. | Generation and verification of a digitized signature |
| EP1571777A1 (en) * | 2004-03-02 | 2005-09-07 | France Telecom | Electronic voting process using fair blind signatures |
| US20050269406A1 (en) * | 2004-06-07 | 2005-12-08 | Neff C A | Cryptographic systems and methods, including practical high certainty intent verification, such as for encrypted votes in an electronic election |
| US20110139872A1 (en) * | 2009-12-11 | 2011-06-16 | International Lottery and Totalizator Systems, Inc | System and Method for Capturing Write-In Selections on a Paper Ballot |
| CN102568073A (en) * | 2010-12-02 | 2012-07-11 | 微软公司 | Media asset voting |
| CN102629396A (en) * | 2012-04-09 | 2012-08-08 | 中科院成都信息技术有限公司 | Information encryption and quick processing method for alternative candidate-containing electronic votes |
| JP2014130436A (en) * | 2012-12-28 | 2014-07-10 | Musashi Eng Co Ltd | Voting paper classification device |
| CN103955984A (en) * | 2014-03-24 | 2014-07-30 | 广州华多网络科技有限公司 | Method, server, voting processing node and system for achieving interconnection network voting |
| CN106373251A (en) * | 2016-08-30 | 2017-02-01 | 中科院成都信息技术股份有限公司 | Electronic vote counting method based on secret sharing |
| CN107968708A (en) * | 2017-11-10 | 2018-04-27 | 财付通支付科技有限公司 | Generate method, apparatus, terminal and the server of signature |
| CN109360100A (en) * | 2018-11-13 | 2019-02-19 | 北京航空航天大学 | Transaction rapid acknowledgment method and device based on block chain technology |
| CN109522456A (en) * | 2018-11-14 | 2019-03-26 | 全链通有限公司 | The node availability detection generated based on block |
| CN109543075A (en) * | 2018-11-14 | 2019-03-29 | 全链通有限公司 | Block generation method and system |
| CN109816844A (en) * | 2019-01-30 | 2019-05-28 | 陕西师范大学 | A kind of quantum ballot system based on quantum homomorphism signature |
Non-Patent Citations (10)
| Title |
|---|
| MICHAŁPAWLAK: "Towards the intelligent agents for blockchain e-voting system", 《PROCEDIA COMPUTER SCIENCE》 * |
| REBECCA B.MORTON: "The dark side of the vote: Biased voters, social information, and information aggregation through majority voting", 《GAMES AND ECONOMIC BEHAVIOR》 * |
| 刘忆宁: "安全电子投票协议的设计与研究", 《桂林电子科技大学》 * |
| 张鹏: "同态签密方案及其在电子投票中的应用", 《深圳大学学报理工版》 * |
| 文毅玲: "聚合签名与数字签密技术研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
| 程润辉: "数字签名中盲性和匿名性理论及其应用研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 邹秀斌: "一种基于门限的电子投票方案", 《计算机科学》 * |
| 陈仁群: "对几种特殊门限签名方案的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 高天寒: "《基于PBC的下一代移动网络接入安全》", 31 December 2014 * |
| 黄福人: "电子投票的研究与设计", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111443895A (en) * | 2020-03-12 | 2020-07-24 | 杭州泛链科技有限公司 | Verifiable random number generation method applied to block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110400409B (en) | 2022-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110505064A (en) | Thresholding voting method, system and relevant device based on EC-Schnoor signature algorithm | |
| CN109862041A (en) | A kind of digital identification authentication method, unit, system and storage medium | |
| CN110300172A (en) | A kind of the common recognition method and relevant device of block chain data | |
| CN110505305A (en) | A kind of block chain sharding method, device and block catenary system | |
| CN110247774A (en) | A kind of the common recognition method and relevant device of block chain data | |
| Gong et al. | A remote attestation mechanism for the sensing layer nodes of the Internet of Things | |
| CN110288479A (en) | A kind of the common recognition method and relevant device of block chain data | |
| CN108428132A (en) | Fraudulent trading recognition methods, device, server and storage medium | |
| CN112689848B (en) | Method and related equipment for consensus of block chain data | |
| CN104331306B (en) | Content updating method, equipment and system | |
| CN105933316B (en) | The determination method and apparatus of network security level | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| WO2015173854A1 (en) | Information processing system and information processing method | |
| CN105430615A (en) | Location privacy protection method based on false locations under continuous location service requests | |
| CN110365479A (en) | Random digit generation method and device based on block chain | |
| CN109543947A (en) | Method, apparatus and terminal device based on the task distribution for surveying grid | |
| CN110401537A (en) | Thresholding voting method, system and relevant device based on BLS signature algorithm | |
| CN112085378A (en) | Resource allocation method, device, computer equipment and storage medium | |
| CN110399739A (en) | A kind of thresholding voting method and relevant apparatus based on block chain common recognition | |
| CN111428885B (en) | User indexing method in federated learning and federated learning device | |
| Jameel et al. | Optimizing blockchain networks with artificial intelligence: Towards efficient and reliable IoT applications | |
| CN110400409A (en) | Thresholding voting method, system and relevant device based on BLS signature algorithm | |
| CN110401541A (en) | Thresholding voting method, system and relevant device based on EC-Schnoor signature algorithm | |
| CN110515819A (en) | Performance test methods, electronic equipment, scheduling system and medium | |
| CN112765481B (en) | Data processing method, device, computer and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210909 Address after: 518000 21 / f-23 / F, block B, building 12, Shenzhen Bay science and technology ecological park, No. 18, South Keji Road, high tech community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: Xunlei Networking Technologies, Ltd. Applicant after: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. Address before: 518052 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Applicant before: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240620 Address after: 518000 Port Building 0610-E13, Maritime Center, No. 59, Linhai Avenue, Nanshan Street, Qianhai Shenzhen Hong Kong Cooperation Zone, Shenzhen, Guangdong Patentee after: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. Country or region after: China Address before: 518000 21 / f-23 / F, block B, building 12, Shenzhen Bay science and technology ecological park, No. 18, South Keji Road, high tech community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Patentee before: Xunlei Networking Technologies, Ltd. Country or region before: China Patentee before: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. |