CN112990775A - Method for candidate of unknown nomination - Google Patents
Method for candidate of unknown nomination Download PDFInfo
- Publication number
- CN112990775A CN112990775A CN202110449836.XA CN202110449836A CN112990775A CN 112990775 A CN112990775 A CN 112990775A CN 202110449836 A CN202110449836 A CN 202110449836A CN 112990775 A CN112990775 A CN 112990775A
- Authority
- CN
- China
- Prior art keywords
- nomination
- candidate
- node
- chinese character
- chinese
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- 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
Abstract
The invention relates to the technical field of anonymous voting, in particular to a method for an unknown nominated candidate, which comprises the following steps: pretreatment: formulating and disclosing a Chinese character table; and (3) naming single words: each nomination node uses the Chinese character serial number to exponentiate m as a representative number, the representative number is divided into m random addends, the nomination nodes respectively sum and then obtain the final sum, the m representative numbers are deduced reversely, and the Chinese characters corresponding to the representative numbers are disclosed; chinese character collection: multiple naming single characters are obtained to obtain multiple groups of Chinese characters; chinese character sorting: generating a ranking number by a nomination node corresponding to the Chinese character, and finally reversely deducing the ranking number with a non-default value, namely obtaining the offset of the Chinese character; obtaining a nomination: and moving the Chinese characters according to the offset, namely aligning the Chinese characters, and obtaining the complete names of a plurality of candidate persons after aligning. The substantial effects of the invention are as follows: by formulating a Chinese character table, digits are used for replacing submitted Chinese characters, and anonymous nomination is achieved.
Description
Technical Field
The invention relates to the technical field of anonymous voting, in particular to a method for announcing candidates.
Background
The traditional voting mode can not meet the current voting requirements, namely the voting requirements of dozens of people and tens of thousands of people, and if the traditional voting mode is used, the defects of low speed, trivial process, high error rate and the like can occur. Electronic voting techniques have been developed, and electronic voting refers to electronic voting and also to a method of counting the number of votes electronically. The voting efficiency is accelerated, and errors are few. However, electronic voting leaves various information in the communication process, so that electronic voting requiring network communication is difficult to realize anonymous voting. Although some published technical documents provide technical solutions for anonymous electronic voting, the technical solutions can only perform anonymous voting within a given candidate range, and cannot realize anonymous nomination of candidates at a candidate-free stage. Since the nominator is exposed once the candidate's name is submitted, such as during a communication or registration store. For partial nominations, such as worst-performer voting, the nominator does not want to expose which candidates are nominated.
Chinese patent CN102007506A, published 2011, 4/6, a method for conducting electronic voting in a questionnaire, comprising: a step of broadcasting the proposal of the electronic voting service to a plurality of communication terminals; a step of transmitting a request including information for authenticating the voter from the communication terminal of the voter to a remote server; a step of verifying the voter by comparing the received authentication information with the recorded information associated with the voter; a step of transmitting the voter's vote to the communication terminal participating in the vote when the voter passes the authentication; a step of sending a vote to a server, the former having a response to a questionnaire and a vote to participate in the vote, the method being characterized in that it comprises two anonymous steps, the first step ensuring that the participation vote sent by the server to the voter is anonymous, the second step ensuring that the communication terminal sending the response to the vote to the server is anonymous, the participation vote comprising at least one piece of data associated with the profile of the voter. But it does not enable anonymous nomination of uncertain candidates.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the technical scheme of anonymously nominating candidates is lacked at present. The method can realize the anonymous candidate nomination by the nominator, and protect the privacy of the nominator.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows: a method for anonymous nomination of candidates at a node comprising a nomination receiving node and a server
Candidate nomination is carried out in a network of nomination nodes, and the method comprises the following steps: pretreatment: formulating and disclosing a Chinese character table, and searching the Chinese character table by a nomination node to obtain a Chinese character serial number of a candidate name to be nominated; and (3) naming single words: each nomination node uses Chinese character serial number pair
Exponentiation is taken as a representative number, final sum is obtained by summing unknown names of the representative numbers, and the nominated receiving node is deduced from the final sum
The representative numbers randomly sort and disclose the Chinese characters corresponding to the representative numbers, and each nomination node memorizes the order of the nomination node; chinese character collection: executing the step of nominating single characters for multiple times to obtain multiple groups of Chinese characters, and traversing each Chinese character in each group to execute Chinese character sequencing; chinese character sorting: the nomination nodes corresponding to the Chinese characters generate ranking numbers, other nomination nodes use default values as the ranking numbers, the final sum is obtained by summing unnamed ranking numbers, and the ranking numbers with non-default values are deduced reversely from the final sum, namely the offset of the Chinese characters is obtained; obtaining a nomination: and moving the Chinese characters according to the offset, namely aligning the Chinese characters, and obtaining the complete names of a plurality of candidate persons after aligning. The technical effect of hiding the addend source, namely hiding the nominator, is realized by adding the numbers representing the candidate name Chinese characters and then restoring the addend. However, the technical scheme only applies the Chinese character list to the condition that the initials of the candidates are different, namely the condition that the candidates to be nominated are few, and the technical scheme is applied to the condition that the initials of the candidates are differentThe desired effect can be achieved although the enclosure is small. When in use
Larger values result in an excessively large value for the representative number. The method comprises the steps of dividing a plurality of nomination nodes into a plurality of groups, wherein each group is provided with a preset number of nomination nodes, and summarizing nomination results of each group after nomination is finished, so that the problem can be effectively solved
A major problem.
Preferably, in the step of naming the single character, the method for obtaining the final sum by summing the unknown representative numbers comprises the following steps: splitting a representative number into
And distributing the random addends to the nomination nodes, and respectively summing the nomination nodes to obtain the final sum. The representative number can be effectively hidden by splitting the representative number into addends, respectively summing the addends and then summarizing the addends again to obtain the final sum.
Preferably, in the preprocessing step, each Chinese character is represented by a plurality of numerical coordinates, the step of naming the single character is executed once to obtain one coordinate of the single character, the step of naming the single character is executed for a plurality of times to obtain a plurality of groups of coordinates, each coordinate in each group is traversed for sorting, and the sorted coordinates form the complete coordinates of the plurality of Chinese characters. For example, using three coordinates to represent Chinese characters, using a maximum of
Can be realized by the sequence of
The expression of each Chinese character is that the common Chinese character is about 2 thousand characters, then partial surname Chinese characters are added, enough to include the common names in the Chinese character list, so that the name-proposing candidate in the method can not directly submit the name of the Chinese character, but uses numbers for substitution, thereby creating conditions for realizing anonymous name proposition.
Has good effectAnd selecting the nomination nodes corresponding to the Chinese characters to generate the ranking number, wherein the method comprises the following steps: in the single character nomination step, when randomly ordering the Chinese characters corresponding to the representative numbers, the same Chinese characters are arranged in close proximity, and then the same Chinese characters in the current group are arranged in close proximity and traversed word by word; the nomination receiving node broadcasts the current Chinese character, if the current Chinese character belongs to the Chinese character in the name of the candidate to be nominated, the nomination node generates the ranking number, the ranking number is the offset pair
The right deviation is defined as positive, and if the deviation is negative, the deviation is added
The default value is 1, and the ranking number is split into
And the encrypted random addend is distributed to the nomination node. The sorting mode used by the optimal technical scheme hides the source of the offset, can ensure that the nominator is not revealed, and simultaneously realizes the nomination of partial or all candidates with duplicate names.
Preferably, the method for obtaining the offset of the Chinese characters by the ordinal number comprises the following steps: counting the number of characters of the same Chinese characters traversed currently, if the number of the same characters is 1 and only one non-default ranking number exists, the non-default ranking number is the offset of the Chinese characters, if the number of the same characters is more than 1 and the non-default ranking number is the same as the number of the same characters, respectively allocating the offset to each same character, and if the number of the same characters is more than 1 than the non-default ranking number, adding a zero offset and allocating the offset to the same characters. The nomination of a plurality of candidates with the same character or even with duplicate names is completed by counting the number of the same character compared with the ranking number of a non-default value.
Preferably, after the first nomination, the steps of Chinese character collection, Chinese character sorting and nomination obtaining are carried out again, and the nomination node nominates a second candidate in the second execution. The second candidate can be nominated by performing the method again.
Preferably, the Chinese character table includes placeholders, the nomination receiving node designates a plurality of nomination nodes, the nomination nodes participate in the nomination process of the candidate no matter whether the nomination nodes carry out candidate nomination, and if no candidate needs nomination, the nomination nodes nominate placeholders every time. By appointing a plurality of nodes which always participate in nomination, the real nomination nodes can be effectively helped to hide themselves, and privacy data are prevented from being revealed.
Preferably, in the nomination single-word step, the method for allocating the random addend to the nomination node comprises the following steps: the nomination node reserves a random number and remains
The random numbers are respectively the rest
The public key of each nomination node is broadcasted after being encrypted, the nomination node tries to decrypt by using the private key after receiving the broadcasted encrypted random number, if the decryption is successful, the random number is reserved, and when no random number is broadcasted within the preset time, the random number is distributed to the nodes
And (4) a nomination node.
The substantial effects of the invention are as follows: 1) by formulating the Chinese character table, the nomination candidate in the method does not directly submit the Chinese character name, but uses numbers for substitution, thereby creating conditions for realizing anonymous nomination and effectively protecting the privacy of the nomination party; 2) the representative numbers are split and distributed to the nomination nodes, and then summation is carried out, so that the nomination source can be hidden, and the privacy of the nomination party is protected; 3) the addition is restored after the summation of the representative numbers, so that the nomination of the Chinese characters can be quickly and secretly completed, and the nomination efficiency is improved.
Drawings
FIG. 1 is a schematic flow chart of a candidate nomination method according to an embodiment;
fig. 2 is a flowchart illustrating a method for sorting addends by a nomination node according to an embodiment.
Detailed Description
The following provides a more detailed description of the present invention, with reference to the accompanying drawings.
The first embodiment is as follows:
referring to fig. 1, a method for renaming a candidate includes the following steps: the method comprises the following steps: pretreatment: formulating and disclosing a Chinese character table, and searching the Chinese character table by a nomination node to obtain a Chinese character serial number of a candidate name to be nominated; and (3) naming single words: each nomination node uses Chinese character serial number pair
Exponentiation is taken as a representative number, and the representative number is split into
Random addend, distributing the random addend to nomination nodes, summing the nomination nodes respectively, obtaining the final sum, and deducing the final sum
The representative numbers randomly sort and disclose the Chinese characters corresponding to the representative numbers, and each nomination node memorizes the order of the nomination node; chinese character collection: executing the step of nominating single characters for multiple times to obtain multiple groups of Chinese characters, and traversing each Chinese character in each group to execute Chinese character sequencing; chinese character sorting: the nomination nodes corresponding to the Chinese characters generate the ranking numbers, other nomination nodes take the default values as the ranking numbers, and the ranking numbers are split into
Distributing random addends to nomination nodes, respectively summing the nomination nodes, then obtaining the final sum, and reversely deducing the ranking number of the non-default value from the final sum to obtain the offset of the Chinese character; obtaining a nomination: and moving the Chinese characters according to the offset, namely aligning the Chinese characters, and obtaining the complete names of a plurality of candidate persons after aligning.
Specifically, the pretreatment step comprises:
step A) formulating and disclosing a Chinese character table, in the embodiment, Chinese character groups
In the way of
And column (1)
Location, i.e. coordinates
Specifying nominated receiving nodes
Receiving node of nomination
Statistical nomination node
Quantity, quantity is recorded as
Receiving node of nomination
Disclosure of arrays
，
Is not less than
In this embodiment, the whole number of
Node for nominating
Looking up the Chinese character table to obtain the coordinates of the candidate name to be nominated
，
Indicating the order of the characters in the name,
，
the Chinese character table contains placeholders for the upper limit of the number of the preset name words.
And (3) naming single words:
step B) name-giving node
Generating random numbers
、
And
respectively satisfy
、
And
，
has an initial value of 1.
Step C) name-giving node
Will be provided with
、
And
secret distribution to
A nomination node
Reserve one by oneself
Will remain
An
Use the rest separately
Each nomination node
After encrypted, the public key of the node broadcasts and nominates
Trying to decrypt by using a private key of the user after receiving the broadcasted encrypted random number, if the decryption is successful, keeping the random number, and finishing the decryption after no random number is broadcasted within preset time
Secret distribution to
A nomination node; will be provided with
And
secret distribution to
Method for naming node
Secret distribution to
A nomination node, which is respectively to be executed
Is replaced by
And
and (4) finishing. Received by each nomination node
The sum of the random numbers is recorded as
、
And
as disclosed hereinafter.
Chinese character collection step:
step D) nomination receiving node
Computing
Each nomination node
A sum of,
And
and are each independently denoted as
、
And
from
、
And
each reversely pushed out
A plurality of addends, three groups of addends are respectively
、
And
. Nomination receiving node
Computing
Each nomination node
、
And
the method of (1) comprises: nomination node
Disclosed is a
、
And
then, the signature of the receiving node is associated with the receiving node
Collect all nomination nodes
Of signatures
、
And
while respectively in pairs
、
And
the summation is performed.
Chinese character sorting step:
step E) if
If the value is 1, the receiving node is nominated
To pair
An
Are sorted and then
Each nomination node pair
And
is ordered to
Alignment, if present
If the value is not 1, then
Each nomination node pair
、
And
is ordered to
Alignment, obtained after alignment
A coordinate, i.e.
First of personal candidate name
Coordinates of individual Chinese characters.
Obtaining a nomination step:
In the step E) of the process,
each nomination node pair
And
is ordered to
The corresponding method comprises the following steps: referring to FIG. 2, step E1) nominating the receiving node
To pair
An
When sorting is performed, the values are the same
Closely arranged, step E2) nominating the receiving node
Will be provided with
Randomly ordered and made to be equal in value
Are arranged next to each other
Initialization offset
(ii) a Step E3) nomination receiving node
Broadcast in sequence according to the order
With the current being broadcast
Are equal to
Is counted as
，
The nominated node receiving the broadcast
Then, the broadcast is judged
Whether to match the name of the candidate person who nominates himself
The line coordinates of the words are the same, if the line coordinates of the words are the same, the node is nominated
Computing
Is offset amount of
，
To be positive to indicate a shift to the right,
is negative indicating a shift to the right if
If it is negative, then order
Self-adding
Node for nominating
Generating random numbers
Satisfy the following requirements
If broadcast
And nomination node
Name of candidate for nomination
If the line coordinates of the words are different, then the node of nomination is given
Generating random numbers
Satisfy the following requirements
(ii) a Step E4) nomination node
Will be provided with
Secret distribution to
Each nomination node, each nomination node received
A sum of random numbers is recorded as
Post-publishing, nominating receiving node
Computing
Each nomination node
And
from
Back push out
Number of summers
If, if
Then amount of deviation
If, if
And add the number
Therein is provided with
If the value of each is greater than 1, then respectively match
Addend taking with value greater than 1
Logarithm of (i.e. offset)
Wherein
If, if
And add the number
Therein is provided with
If the value of each is greater than 1, then respectively match
Addend taking with value greater than 1
Is then supplemented with an offset of 0 to obtain
An offset amount
Will be
An offset amount
Assigned to the current broadcast
And following it
Each having the same value
Is allocated to the immediately following
Each having the same value
According to the current broadcast
The offset amount is corrected in accordance with each relative position of
Shift amount of
Is completed immediately
Sorting of (1); step E5) will
Change to
Performing step E2) to step E4) to complete
The order of (a). The sorting mode used by the optimal technical scheme hides the source of the offset, can ensure that the nominator is not revealed, and simultaneously realizes the nomination of partial or all candidates with duplicate names.
Example two:
a method for calling candidates without remembering names requires that the candidates are from known people, the number of people is small, a character-taking range of the names of the candidates can be obtained, the required Chinese character table size does not exceed 30 Chinese characters optimally, and the calling efficiency can be greatly improved. For example, among several judges, two judges are nominated to participate in the best evaluation in the year. In this embodiment, in step a), the Chinese characters used by the names of the people in the known crowd, that is, the Chinese characters used by all names of judges are listed, and the used Chinese characters are arranged in sequence to be used as a Chinese character table, and the Chinese characters are arranged in sequence, so that the rows of the Chinese characters are arranged
And column (1)
All take value as 1, group of Chinese characters
Numeric Chinese character sequence
I.e. coordinates
In step B), nominating the node
Generating random numbers
Satisfy the following requirements
In step D), from
Back push out
By adding several, the sum can be determined
A Chinese character, in step E), if
If the value is 1, the receiving node is nominated
To pair
Randomly ordering the Chinese characters if the current one
If the value is not 1, then
Each nomination node pair
Is ordered to
The alignment is carried out in a way that the alignment,
self-adding 1, repeating the step until
Upper limit of word number of candidate name
Namely, the names of all the nominated candidates are obtained. The technical scheme has faster nomination efficiency.
Example three:
the present embodiment further describes the present technical solution with reference to a specific application scenario. For example, a league chain formed by a plurality of judicial institutions voters with the worst performance in the year are voted in an electronic voting mode. Because lawyers are large in number and names relate to a large number of Chinese characters, the number of names is two, three or even four. Such as two lawyers named Wangshuan and who Shi. As shown in table 1, an example of the kanji table disclosed in this embodiment is shown. The coordinates of three Chinese characters are (1,2,3), (2,1,3) and (2,2,3) respectively when the name is Wangshuan. When the name of the Chinese character is changed, the coordinates corresponding to the three Chinese characters are (1,1,3), (2,1,3) and (2,1, 5).
Table 1 embodiment a chinese character table
TABLE 1
In the embodiment, there are 4 nomination nodes in total, two of which
And
the other two nomination nodes are not nominated. As shown in Table 1, the first character coordinates of the two Chinese characters, namely Wang (1,2,3) and He (1,1,3), are first submitted after the name of Wangshuan and He shidai is proposed, and the number sequence is
Node for nominating
Generating
、
And
node for nominating
Generating
、
And
and the other nodes do not nominate candidates, and each Chinese character is nominated (1,1, 1). When the name of the candidate is two characters, and when other name-giving nodes give names to the third character, the name is given (1,1,1), namely, the placeholder. In this way,
when the temperature of the water is higher than the set temperature,
、
and
respectively to be separately provided with
、
And
when the 4 sums are inversely solved, because
Not less than
Carry-out does not occur during summing, so
、
And
the 4 addends only have one combination, so the addends can be recovered from the sum, but the sequence of the addends cannot be recovered, the source of the addends can be hidden, and the privacy of the nominated node can be protected. Such as when the poorest team member votes, the nominator has a hidden need.
In the present embodiment, the first and second electrodes are,
：1 1 1 1，
：1 1 1 2，
: 1133, first
Randomly ordered, 4 nominated nodes respectively claim one
In the claimed order:
、
、
and
. Wherein the content of the first and second substances,
and
two nominated nodes which are not nominated are referred to. The claim ordering of each nomination node is stored by itself and is not disclosed. Even in case of conflict, i.e. conflict
And
all claim the first
Second one of
No one claims, and no influence on follow-up
And
the result of the sorting. First in the claimed order:
、
、
and
the technical scheme is convenient to understand.
Then sorting
First, broadcast
，
、
、
And
respectively generate
Then broadcasts the second
And the third one
Finally broadcast
，
、
、
And
respectively generate
Can be obtained 4 times
Respectively as follows:
，
，
，
for the first one
Belong to "
And add the number
Therein is provided with
If the value of each is greater than 1 ″, then the two are respectively aligned
Addend taking with value greater than 1
The logarithm of (d), i.e. the offset: 1,2,3, assigning 1,2,3 to the first
And 2 followed by
And for the last two
CorrectionBy subtracting 1 and 2 from the offset, three are obtained
The offset amounts of (A) are respectively: 1,1=2-1,1=3-2, the number of subtractions being the correction amount obtained from the position, since the second and third
Is relative to the first
With offsets of 1 and 2, respectively. Since each one is
Are assigned an offset, and thus are second to broadcast
And the third one
The generated offset can be directly discarded without operation. For the
Belong to "
Then amount of deviation
", get
It is known that
Is 1. Reordering according to resulting offset
To obtain a rowSerial number
：2 1 1 1。
Then sorting
First, broadcast
，
、
The nominated column coordinate is 3, thus producing
Are all 0 in the total number of the components,
and
then respectively generate
To obtain
Is broadcast again
. Then broadcast
Offset amount of
Is broadcast again
。
For the first one
Belong to
And add the number
Therein is provided with
Each is greater than 1, and the amount of deviation is respectively
And
is assigned to
And then one
To obtain the two
Are respectively offset by
And
for the second one
Skipping directly. For the first one
Respectively offset the amounts
And
is assigned to
And then one
To obtain the two
Are respectively offset by
And
get sequenced
：3 3 1 1。
After sorting
：1 1 1 1，
：2 1 1 1，
: 3311, four kanji coordinates are obtained by column, respectively (1,2,3), (1,1,3), (1,1,1) and (1,1,1), respectively corresponding to the kanji: king, what, placeholder.
Order to
All nomination nodes nominate the second Chinese character, and the three coordinates of the second Chinese character are all equal to those of the first character
And (4) aligning. The second Chinese character is obtained as follows: a "s", a "placeholder". Order to
All nomination nodes nominate the third Chinese character, and the three coordinates of the third Chinese character are all equal to those of the first character
And (4) aligning. The second Chinese character is obtained as follows: chuan, talent, placeholder. Four names can be obtained: joss, who, placeholder. Finally, two nominated candidates are obtained.
When a conflict is claimed, it is assumed
And
all claim the first
Second one of
No one claims, and no influence on follow-up
And
the result of the sorting. Because in the ordering
When it is first broadcast
，
、
、
And
respectively generate
Belong to "
And add the number
Therein is provided with
Each value is greater than 1 and is respectively corresponding to
Addend taking with value greater than 1
Is added with an offset of 0 to obtain the first
The offset of (a) is: 0,2,3, are allocated to three
First, second and third
The offset is respectively: 0,1,1. Broadcasting
To obtain
An offset of 1, reordering
Timely nominating receiving node
Will find the first one
And
all occupy the first position, conflict occurs, and the nomination receiving node at the moment
Will be the first
And
arbitrarily ordered and then disclosed
Comprises the following steps: 1211. corresponding nomination node
And
according to the disclosure
And adjusting the claim position of the user.
The maximum value of the embodiment is
Array of (2), implementation
The expression of each Chinese character is that the common Chinese character is about 2 thousand characters, then partial surname Chinese characters are added, and the common names are included in the Chinese character list, so that the name-proposing candidate in the method can use numbers instead of directly submitting the Chinese character names, and conditions are created for realizing anonymous name proposition. The technical effect of hiding the addend source, namely hiding the nominator, is realized by adding the numbers representing the candidate name Chinese characters and then restoring the addend. Due to the fact that
Is not less than
When is an integer of
When it is larger, it will result in
、
And
too large a value of (c). A plurality of nomination nodes are divided into a plurality of groups, each group is provided with a preset number of nomination nodes, and nomination results of each group are collected after nomination is completed. Nomination receiving node
Specifying a number of nomination nodes
No matter nomination node
If the candidate is not named, the candidate participates in the candidate name-proposing process, and if no candidate needs to be nominated, the nomination node
Placeholders are nominated each time. By appointing a plurality of nodes which always participate in nomination, the real nomination nodes can be effectively helped to hide themselves, and privacy data are prevented from being revealed.
The above-described embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention in any way, and other variations and modifications may be made without departing from the spirit of the invention as set forth in the claims.
Claims (8)
1. A method for anonymous nomination of candidates at a node comprising a nomination receiving node and a server
Candidate nomination is carried out in a network of nomination nodes, which is characterized in that,
the method comprises the following steps:
pretreatment: formulating and disclosing a Chinese character table, and searching the Chinese character table by a nomination node to obtain a Chinese character serial number of a candidate name to be nominated;
and (3) naming single words: each nomination node uses Chinese character serial number pair
Exponentiation is taken as a representative number, final sum is obtained by summing unknown names of the representative numbers, and the nominated receiving node is deduced from the final sum
The representative numbers randomly sort and disclose the Chinese characters corresponding to the representative numbers, and each nomination node memorizes the order of the nomination node;
chinese character collection: executing the step of nominating single characters for multiple times to obtain multiple groups of Chinese characters, and traversing each Chinese character in each group to execute Chinese character sequencing;
chinese character sorting: the nomination nodes corresponding to the Chinese characters generate ranking numbers, other nomination nodes use default values as the ranking numbers, the final sum is obtained by summing unnamed ranking numbers, and the ranking numbers with non-default values are deduced reversely from the final sum, namely the offset of the Chinese characters is obtained;
obtaining a nomination: and moving the Chinese characters according to the offset, namely aligning the Chinese characters, and obtaining the complete names of a plurality of candidate persons after aligning.
2. The method of claim 1 wherein the candidate is an anonymous nomination candidate,
in the preprocessing step, each Chinese character is represented by a plurality of digital coordinates, one coordinate of the single character is obtained by executing the single character nomination step once, a plurality of groups of coordinates are obtained by executing the single character nomination step for a plurality of times, each coordinate in each group is traversed for sequencing, and the sequenced coordinates form the complete coordinates of the plurality of Chinese characters.
3. The method of claim 1 or 2, wherein the candidate is an anonymous nominated candidate,
the method for generating the ranking number by the nomination node corresponding to the Chinese character comprises the following steps:
in the single character nomination step, when randomly ordering the Chinese characters corresponding to the representative numbers, the same Chinese characters are arranged in close proximity, and then the same Chinese characters in the current group are arranged in close proximity and traversed word by word;
the nomination receiving node broadcasts the current Chinese character, if the current Chinese character belongs to the Chinese character in the name of the candidate to be nominated, the nomination node generates the ranking number, the ranking number is the offset pair
The right deviation is defined as positive, and if the deviation is negative, the deviation is added
The default value is 1, and the ranking number is split into
And the encrypted random addend is distributed to the nomination node.
4. The method of claim 3 wherein the candidate is an anonymous nomination candidate,
the method for obtaining the offset of the Chinese characters by the ordinal number comprises the following steps:
counting the number of characters of the same Chinese characters traversed currently, if the number of the same characters is 1 and only one non-default ranking number exists, the non-default ranking number is the offset of the Chinese characters, if the number of the same characters is more than 1 and the non-default ranking number is the same as the number of the same characters, respectively allocating the offset to each same character, and if the number of the same characters is more than 1 than the non-default ranking number, adding a zero offset and allocating the offset to the same characters.
5. The method of claim 1 or 2, wherein the candidate is an anonymous nominated candidate,
and after the first nomination is finished, the steps of Chinese character collection, Chinese character sorting and nomination obtaining are carried out again, and nomination nodes nominate a second candidate in the second execution.
6. The method of claim 1 or 2, wherein the candidate is an anonymous nominated candidate,
the Chinese character table comprises placeholders, the nomination receiving node designates a plurality of nomination nodes, the nomination nodes participate in the nomination process of a candidate no matter whether the nomination nodes carry out the nomination of the candidate, and if no candidate needs nomination, the nomination nodes carry out the nomination of the placeholders every time.
7. The method of claim 1 or 2, wherein the candidate is an anonymous nominated candidate,
in the single-character nomination step, the method for distributing the random addend to the nomination node comprises the following steps:
name-lifting festivalThe dots retain a random number and will remain
The random numbers are respectively the rest
The public key of each nomination node is broadcasted after being encrypted, the nomination node tries to decrypt by using the private key after receiving the broadcasted encrypted random number, if the decryption is successful, the random number is reserved, and when no random number is broadcasted within the preset time, the random number is distributed to the nodes
And (4) a nomination node.
8. The method of claim 1 or 2, wherein the candidate is an anonymous nominated candidate,
in the step of naming the single character, the method for obtaining the final sum by summing the unknown names of the representative numbers is as follows: splitting a representative number into
And distributing the random addends to the nomination nodes, and respectively summing the nomination nodes to obtain the final sum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110449836.XA CN112990775B (en) | 2021-04-25 | 2021-04-25 | Method for candidate of unknown nomination |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110449836.XA CN112990775B (en) | 2021-04-25 | 2021-04-25 | Method for candidate of unknown nomination |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112990775A true CN112990775A (en) | 2021-06-18 |
| CN112990775B CN112990775B (en) | 2021-08-13 |
Family
ID=76340126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110449836.XA Active CN112990775B (en) | 2021-04-25 | 2021-04-25 | Method for candidate of unknown nomination |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112990775B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102456108A (en) * | 2011-06-22 | 2012-05-16 | 中标软件有限公司 | Encryption method for ibus pinyin code table |
| CN107533777A (en) * | 2015-01-21 | 2018-01-02 | 塞萨尔·雷蒙·约翰·科雷亚·帕克 | The electronic voting method and system implemented in portable equipment |
| CN112466032A (en) * | 2020-11-23 | 2021-03-09 | 深圳前海微众银行股份有限公司 | Electronic voting method and device and electronic equipment |
| CN112487468A (en) * | 2020-12-21 | 2021-03-12 | 暨南大学 | Traceable complete anonymous electronic voting method and system based on block chain |
-
2021
- 2021-04-25 CN CN202110449836.XA patent/CN112990775B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102456108A (en) * | 2011-06-22 | 2012-05-16 | 中标软件有限公司 | Encryption method for ibus pinyin code table |
| CN107533777A (en) * | 2015-01-21 | 2018-01-02 | 塞萨尔·雷蒙·约翰·科雷亚·帕克 | The electronic voting method and system implemented in portable equipment |
| CN112466032A (en) * | 2020-11-23 | 2021-03-09 | 深圳前海微众银行股份有限公司 | Electronic voting method and device and electronic equipment |
| CN112487468A (en) * | 2020-12-21 | 2021-03-12 | 暨南大学 | Traceable complete anonymous electronic voting method and system based on block chain |
Non-Patent Citations (1)
| Title |
|---|
| JAMILEH BAHRI: "《Electronic voting through DE-PBFT consensus and》", 《9TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE 2019)》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112990775B (en) | 2021-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Coulter | Measuring inequality: A methodological handbook | |
| US20200313884A1 (en) | Smart contract execution using distributed coordination | |
| US11394773B2 (en) | Cryptographic currency block chain based voting system | |
| CN112910631B (en) | Efficient privacy set intersection calculation method and system based on cloud server assistance | |
| Hanteer et al. | From interaction to participation: The role of the imagined audience in social media community detection and an application to political communication on twitter | |
| Singh et al. | A survey and taxonomy of consensus protocols for blockchains | |
| CN101916256A (en) | Community discovery method for synthesizing actor interests and network topology | |
| CN106603231A (en) | Distributed SM2 digital signature generation method and system based on de-secrecy | |
| Larriba et al. | Distributed trust, a blockchain election scheme | |
| Calvao et al. | Stylized facts in Brazilian vote distributions | |
| CN112990775B (en) | Method for candidate of unknown nomination | |
| Doka et al. | k-Anonymization by freeform generalization | |
| Venugopalan et al. | Always on voting: A framework for repetitive voting on the blockchain | |
| US20220278854A1 (en) | Unity Protocol Consensus | |
| US20140172517A1 (en) | Random sample elections | |
| CN116170162B (en) | Selective consensus method, computer storage medium, and terminal device | |
| Warshaw et al. | Local representation in the United States: a new comprehensive dataset of elections | |
| US20210336789A1 (en) | Deterministic sparse-tree based cryptographic proof of liabilities | |
| Masood et al. | Distributed ledger technology for closed environment | |
| CN112328626B (en) | Searchable encryption method facing cloud environment and supporting fuzzy keyword sequencing | |
| EBADIAN et al. | Boosting Sortition via Proportional Representation | |
| CN109034938B (en) | Information rapid screening and matching method and device, electronic equipment and storage medium | |
| Mamageishvili et al. | Mechanism design and blockchains | |
| Chu et al. | Decentralized private information sharing protocol on social networks | |
| Park | Support for democracy in Korea: Its trends and determinants |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |