CN105516132A - Method and apparatus for determining hit user in probability event - Google Patents
Method and apparatus for determining hit user in probability event Download PDFInfo
- Publication number
- CN105516132A CN105516132A CN201510894295.6A CN201510894295A CN105516132A CN 105516132 A CN105516132 A CN 105516132A CN 201510894295 A CN201510894295 A CN 201510894295A CN 105516132 A CN105516132 A CN 105516132A
- Authority
- CN
- China
- Prior art keywords
- user
- chosen
- identification information
- probability event
- verification
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 68
- 238000012795 verification Methods 0.000 claims abstract description 100
- 230000008569 process Effects 0.000 claims abstract description 31
- 238000004364 calculation method Methods 0.000 claims abstract description 9
- 230000001965 increasing effect Effects 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 10
- 230000001172 regenerating effect Effects 0.000 claims description 7
- 230000003247 decreasing effect Effects 0.000 claims description 6
- 108010001267 Protein Subunits Proteins 0.000 claims description 2
- 238000005516 engineering process Methods 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 54
- 238000004422 calculation algorithm Methods 0.000 description 24
- 150000003839 salts Chemical class 0.000 description 20
- 230000001276 controlling effect Effects 0.000 description 9
- 230000000875 corresponding effect Effects 0.000 description 5
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 230000002123 temporal effect Effects 0.000 description 2
- 238000000205 computational method Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000003292 diminished effect Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012067 mathematical method Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0442—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and an apparatus for determining a hit user in a probability event. The method comprises the following steps of: acquiring identity information of all users, participating in the probability event, within a time range set by the probability event; determining the hit user in a preset function by making use of the identity information of all the users, an interference factor preset by a sponsor of the probability event and a currently selected decryption factor, wherein the interference factor is used for controlling prejudging for the hit user, and the currently selected decryption factor is used for auxiliary verification for whether the calculation result of the preset function meets a check condition set in the preset function or not. The method and the apparatus solve the technical problem that a lottery drawing mode provided in relevant technologies has difficulty to give consideration to both fairness and impartiality, and cannot realize that the whole lottery drawing process is transparent to the people participating in lottery drawing.
Description
Technical field
The present invention relates to computer realm, in probability event, determine in particular to a kind of hit user method and device.
Background technology
Asymmetric encryption (asymmetriccryptography), is also called public key encryption (public-keycryptography), is a kind of cryptographic algorithm type.In this cryptography method, need pair of secret keys, wherein, claim disclosed key to be PKI, and covert key is private key.Be that mathematics is correlated with between these two keys, after specific user adopts the information of specific key to needs encryption to be encrypted, the decruption key of this user can only be used can be decrypted encrypted information.But, if only grasp PKI and private key one of them, can not another one be calculated.Therefore, if only disclose a key in pair of secret keys, the privacy of another one key can't be jeopardized.
Common public key encryption algorithm can include but not limited to: RSA, ElGamal, knapsack algorithm, ECC, wherein, the most widely used public key encryption algorithm is RSA Algorithm, its Fundamentals of Mathematics (one-way function) are large integer multiplication, up to the present, there is no effective mathematical method can carry out inverse operation and crack.
Rivest, shamir, adelman is used to realize digital signature, user can use encrypted private key one section of message, and oneself PKI and ciphertext are disclosed, although other people can use its PKI to be decrypted easily, but but cannot forge it or distort, therefore, it is possible to guarantee that this message/content must be that former user issues; Meanwhile, former user also cannot deny, because only have user can generating ciphertext.This type of digital signature can play the effect of anti-counterfeiting, anti-tamper and anti-repudiation simultaneously.
Hash function (HashFunction, also known as hash function) is a kind of method creating little numeral " fingerprint " from any one data.Message or data compression can be become summary by hash function, data volume is diminished, is fixed up by the form of data.Data can be upset mixing by this function, re-create the fingerprint that is called hashed value (hashvalues, hashcodes, hashsums, or hashes).Hashed value is usually used to represent the character string of a short random letters and numeral composition.
The perfect hash function of a design (comprising most of keyed Hash function) has real, uniform random output, can effectively prevent from often clashing or being cracked by malicious attacker.Although hash function is also an one-way function, but it is different from the one-way function that asymmetric encryption uses, hash function is irreversible often, do not need to reduce original information yet, therefore an important feature of hash function cannot to retrodict prime information from result, and its confidence level as summary is higher.
Common hash function has: MD series (MD, MD2, MD3, MD4, MD5), SHA series (SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512).Former popular hash function is MD5 algorithm, but cannot prevent collision owing to being proved afterwards, and main flow hash function transfers SHA-1 algorithm to by MD5 algorithm.Certainly, also have the application of many SHA-2 serial algorithms (namely after SHA four kinds) at present, in addition, new SHA-3 algorithm is also suggested.
At present, the drawing manner adopted in correlation technique can be divided into the following two kinds usually:
The first is the prize drawing based on trusting sponsor, and this type of prize drawing is comparatively common, and its flow process roughly can be summarized as following three steps: sponsor announces that prize drawing → user participation → sponsor announces award-winner.The concrete prize-winning process of this kind of drawing manner, not to user transparent, only can improve its fairness by notary third party.
The open defect of this kind of drawing manner is: drawing outcomes rests in sponsor's hand completely, user can only unidirectionally trust, but sponsor also exists obvious interests and forges prize-winning result to order about it and therefrom get a profit, even if introduce notary third party to be also difficult to tackle the problem at its root, fairness is poor.
The second is based on uncontrollable incident, its flow process and the first drawing manner above-mentioned similar, but, prize-winning voucher is by certain preassigned event, such as: some positions after next day Shanghai stock short-swing buy decimal after prize drawing registration terminates, then divided by total number of users, obtain award-winner.Because predicted events is uncontrollable, therefore, this kind of drawing manner is unlikely faked.
The open defect of this kind of drawing manner is: so-called " uncontrollable incident " non-fully are set up, and its basic reason is what this " uncontrollable incident " was not ensured by the objective things such as mathematics or physics; On the other hand, the result that this " uncontrollable incident " is guided out, is uniformly distributed from probability angle non-compliant, in other words, it probably causes the user's winning probability in particular range to be higher than user's winning probability within the scope of other, is difficult to the fairness guaranteeing sweepstake equally.
For above-mentioned problem, at present effective solution is not yet proposed.
Summary of the invention
Embodiments provide a kind of in probability event, determine to hit user method and device, being difficult to take into account fairness and fairness at least to solve the drawing manner provided in correlation technique, whole prize drawing process cannot being realized all to participating in the transparent technical problem of prize drawing personnel.
According to an aspect of the embodiment of the present invention, provide a kind of method of determining to hit user in probability event, comprising: the identification information obtaining the whole users participating in probability event in the time range of probability event setting; In preset function, adopt the identification information of whole user, interference factor that the sponsor of probability event presets and the current decryption factor chosen determine to hit user, wherein, interference factor is used for controlling to carry out anticipation to hit user, and whether the current decryption factor chosen meets for the result of calculation of aided verification preset function the verification condition set in preset function.
Further, in preset function, adopting the identification information of whole user, interference factor and decryption factor to determine, hit user comprises: the first combining step, the identification information of whole user and interference factor to be merged according to the first computation rule set in preset function, obtain intermediate object program sequence; Second combining step, according to the second computation rule set in preset function, intermediate object program sequence and the current decryption factor chosen to be merged, obtain verification sequence; Step 3, according to verification condition, verification sequence to be verified, if verification sequence does not meet verification condition, then regenerate decryption factor next time to be chosen, return the second combining step; If verification sequence meets verification condition, then determine according to the total number of persons of verification condition and whole user the identification information hitting user.
Further, one of in such a way decryption factor next time to be chosen is regenerated: with the current decryption factor chosen for benchmark, increasing or decreasing N, generates decryption factor next time to be chosen, and wherein, N is positive integer; The decryption factor that stochastic generation is next time to be chosen, wherein, decryption factor next time to be chosen is different from the current decryption factor chosen.
Further, according to verification condition verification sequence to be verified and when verification sequence meets verification condition, determine that the identification information hitting user comprises according to verification condition and total number of persons: judge whether the intermediate object program that verification sequence and default value computing obtain meets verification condition, wherein, for controlling, default value determines that hit user needs the operand performed; If intermediate object program meets verification condition, then intermediate object program and total number of persons is adopted to determine the identification information hitting user.
Further, the identification information obtaining whole user in time range comprises: the participation probability event request receiving each user in whole user in time range successively, wherein, participate in carrying the identification information of each user self through signature authentication process in probability event request; Respectively the identification information through signature authentication process corresponding with each user is carried out publicity.
According to the another aspect of the embodiment of the present invention, additionally provide and a kind ofly determine to hit the device of user in probability event, comprising: acquisition module, for obtaining the identification information of whole users of participation probability event in the time range that set in probability event; Determination module, for adopting the identification information of whole user in preset function, interference factor that the sponsor of probability event presets and the current decryption factor chosen determine to hit user, wherein, interference factor is used for controlling to carry out anticipation to hit user, and whether the current decryption factor chosen meets for the result of calculation of aided verification preset function the verification condition set in preset function.
Further, determination module comprises: the first processing unit, for the identification information of whole user and interference factor being merged according to the first computation rule set in preset function, obtains intermediate object program sequence; Second processing unit, for intermediate object program sequence and the current decryption factor chosen being merged according to the second computation rule set in preset function, obtains verification sequence; Authentication unit, for verifying verification sequence according to verification condition, if verification sequence does not meet verification condition, then regenerating decryption factor next time to be chosen, returning the second processing unit; If verification sequence meets verification condition, then determine according to the total number of persons of verification condition and whole user the identification information hitting user.
Further, authentication unit, for one of in such a way regenerating decryption factor next time to be chosen: with the current decryption factor chosen for benchmark, increasing or decreasing N, generates decryption factor next time to be chosen, and wherein, N is positive integer; The decryption factor that stochastic generation is next time to be chosen, wherein, decryption factor next time to be chosen is different from the current decryption factor chosen.
Further, authentication unit comprises: judgment sub-unit, and for judging whether the intermediate object program that verification sequence and default value computing obtain meets verification condition, wherein, for controlling, default value determines that hit user needs the operand performed; Determine subelement, during for meeting verification condition in intermediate object program, then adopt intermediate object program and total number of persons to determine the identification information hitting user.
Further, acquisition module comprises: receiving element, for receiving the participation probability event request of each user in whole user in time range successively, wherein, participate in carrying the identification information of each user self through signature authentication process in probability event request; Display unit, for carrying out publicity by the identification information through signature authentication process corresponding with each user respectively.
In embodiments of the present invention, the identification information obtaining the whole users participating in probability event in the time range of probability event setting is adopted, the identification information of whole user is adopted in preset function, the interference factor that the sponsor of probability event presets and the current decryption factor chosen are determined to hit user, for controlling by adding in probability event hit user is carried out to the interference factor of anticipation and whether meets the decryption factor of the verification condition set in preset function for the result of calculation of aided verification preset function, reach and improve the fairness of probability event and the object of fairness, thus achieve the confidence level of enhancing probability event to the transparency and probability event that participate in probability event user, strengthen the technique effect that more user participates in the wish of probability event, and then the drawing manner provided in correlation technique is provided is difficult to take into account fairness and fairness, whole prize drawing process cannot be realized all to participating in the transparent technical problem of prize drawing personnel.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, and form a application's part, schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart determining the method for hitting user in probability event according to the embodiment of the present invention;
Fig. 2 is the flow chart having the lottery drawing method of fairness and fairness concurrently according to the preferred embodiment of the present invention one;
Fig. 3 is the flow chart having the lottery drawing method of fairness and fairness concurrently according to the preferred embodiment of the present invention two;
Fig. 4 is the structured flowchart determining the device hitting user in probability event according to the embodiment of the present invention;
Fig. 5 is the structured flowchart determining the device hitting user according to the preferred embodiment of the invention in probability event.
Embodiment
The present invention program is understood better in order to make those skilled in the art person, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the embodiment of a part of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, should belong to the scope of protection of the invention.
It should be noted that, term " first ", " second " etc. in specification of the present invention and claims and above-mentioned accompanying drawing are for distinguishing similar object, and need not be used for describing specific order or precedence.Should be appreciated that the data used like this can be exchanged in the appropriate case, so as embodiments of the invention described herein can with except here diagram or describe those except order implement.In addition, term " comprises " and " having " and their any distortion, intention is to cover not exclusive comprising, such as, contain those steps or unit that the process of series of steps or unit, method, system, product or equipment is not necessarily limited to clearly list, but can comprise clearly do not list or for intrinsic other step of these processes, method, product or equipment or unit.
According to the embodiment of the present invention, provide a kind of embodiment of the method determining the method for hitting user in probability event, it should be noted that, can perform in the computer system of such as one group of computer executable instructions in the step shown in the flow chart of accompanying drawing, and, although show logical order in flow charts, in some cases, can be different from the step shown or described by order execution herein.
Fig. 1 is the flow chart determining the method for hitting user in probability event according to the embodiment of the present invention, and as shown in Figure 1, the method comprises the steps:
Step S102, obtains the identification information of the whole users participating in probability event in the time range that probability event (such as: sweepstake) sets;
Step S104, in preset function, adopt the identification information of whole user, interference factor that the sponsor of probability event presets and the current decryption factor chosen determine hit user (such as: prize-winning user), wherein, interference factor is used for controlling to carry out anticipation to hit user, and whether the current decryption factor chosen meets for the result of calculation of aided verification preset function the verification condition set in preset function.
Pass through above-mentioned steps, can realize strengthening the confidence level of probability event to the transparency and probability event that participate in probability event user, strengthen the technique effect that more user participates in the wish of probability event, and then the drawing manner provided in correlation technique is provided is difficult to take into account fairness and fairness, whole prize drawing process cannot be realized all to participating in the transparent technical problem of prize drawing personnel.
In a preferred embodiment, probability event is initiated by sponsor, the declaration probability event registration time period, and set an interference factor (hereinafter being specifically described as deviant Offset), its object is to prevent the participating user of probability event or third party's conjecture or lock result in advance, then, the private key adopting sponsor to provide is encrypted Offset and announces ciphertext to the user participating in probability event, can guarantee that the information of its announcement cannot be denied by sponsor thus.
In preferred implementation process, above-mentioned preset function can select hash function, and it can include but not limited to: the algorithms most in use such as MD5, SHA-1.
Alternatively, in step S104, in preset function, adopting the identification information of whole user, interference factor and decryption factor to determine, hit user can comprise the following steps:
Step S1, according to the first computation rule set in preset function, the identification information of whole user and interference factor to be merged, obtain intermediate object program sequence;
Step S2, according to the second computation rule set in preset function, intermediate object program sequence and the current decryption factor chosen to be merged, obtain verification sequence;
Step S3, according to verification condition, verification sequence to be verified, if verification sequence does not meet verification condition, then regenerate decryption factor next time to be chosen, return step S2; If verification sequence meets verification condition, then determine according to the total number of persons of verification condition and whole user the identification information hitting user.
In a preferred embodiment, the content that temporarily can maintain secrecy as a sponsor of interference factor (i.e. Offset).Because disclosed in whole computational processes of probability event are all, if having malice participant or third party to pay close attention to probability event user list always, then exist and can participating user be assigned to carry out failure probability event order after calculating more greatly.But, if above-mentioned Offset can be increased, only have sponsor to calculate, other people until finally make known hit user all have no way of learning this Offset.In whole probability event process, this Offset value will remain unchanged.
In addition, it should be noted that, be uniformly distributed because the algorithm used in probability event process exports obedience, the computational resource consumed is obeyed too and is uniformly distributed, and likely occurs that certain uses the short period namely to find the situation of the result meeting verification condition.Thus, can meet the result of verification condition by obtaining several times, distributing to make its computational resource more concentrates on specific threshold, and then makes the product of computational resource restriction and time restriction always be greater than this specific threshold.Therefore, the hit results of assigning bogus subscriber to adjust probability event in the very of short duration time before sponsor cannot confirm at the user list participating in above-mentioned probability event is faked, and thus ensure that the fairness of probability event.As long as choose suitable hash function, just can ensure that final result obeys to be uniformly distributed, ensure that the fairness of probability event.
Alternatively, in step s3, one of in such a way decryption factor next time to be chosen can be regenerated:
Mode one, with the current decryption factor chosen for benchmark, increasing or decreasing N, generates decryption factor next time to be chosen, and wherein, N is positive integer;
The decryption factor that mode two, stochastic generation are next time to be chosen, wherein, decryption factor next time to be chosen is different from the current decryption factor chosen.
Alternatively, in step s3, according to verification condition verification sequence verified and when verification sequence meets verification condition, determine that the identification information hitting user can comprise following operation according to verification condition and total number of persons:
Step S31, judge whether the intermediate object program that verification sequence and default value computing obtain meets verification condition, wherein, the operand that default value needs to perform for controlling to determine to hit user;
If step S32 intermediate object program meets verification condition, then intermediate object program and total number of persons is adopted to determine the identification information hitting user.
In a preferred embodiment, the user list of whole participation probability event and deviant Offset can be integrated into a sequence Roll by sponsor; Secondly, stochastic generation character string Salt (i.e. above-mentioned decryption factor), and Roll and Salt is combined; Then, through hash function Fun, generate a cryptographic Hash Hash; If Hash mould Limit (i.e. above-mentioned default value) is 0, then meet above-mentioned verification condition; If Hash mould Limit is not 0, then repeat to generate new Salt, circulation performs above-mentioned steps, until obtain qualified intermediate object program.When the Hash by calculating can divide exactly Limit, then the total number of persons Total of above-mentioned intermediate object program and whole user can be carried out modular arithmetic, its result is then the sequence number Result of hit user.Then, sponsor is published in deviant Offset, the character string Salt and hit sequence number Result that use in decrypting process, by its correctness of user rs authentication.Finally, the private key of oneself can be used to prove that the signature in list is one's own if hit user corresponding to sequence number Result, can cashing prize or prize.
It should be noted that, above-mentioned default value (i.e. Limit value) is used to determine amount of calculation, the concrete meaning of its value is " on average will calculate Limit time; just can find result ", and the meaning of arranging default value is that the public can determine the hit results of this probability event probably needs how long to have come, it can improve along with machine arithmetic ability and increase.Hash function Fun is the formula calculated, and the meaning of agreement is that defining computational methods can not arbitrarily change, such as: if made an appointment use SHA-1 algorithm, then can not change MD5 algorithm in the process of probability event.In addition, except above-mentioned from all participate in this probability event user identification information choose one to meet mould Limit be except the value of 0, multiple value (namely increasing the quantity of hit user) meeting verification condition can also be chosen, and then the computational resource making each probability event run on probability is tending towards mean value more, reduce variance.
Alternatively, in step s 102, the identification information obtaining whole user in time range can comprise following operation:
Step S4, in time range, receive the participation probability event request of each user in whole user successively, wherein, participate in carrying the identification information of each user self through signature authentication process in probability event request;
Step S5, respectively the identification information through signature authentication process corresponding with each user is carried out publicity.
In a preferred embodiment, the probability event that the user participating in probability event can specify in sponsor is held in the time period and is participated in probability event, a probability event can be obtained by user's registration and participate in sequence number (this sequence number is carried out from increasing at every turn after distributing to a user), and adopt private key for user to sign, its object is to guarantee that the prize-winning bonus (or prize) of self cannot be falsely taken.In addition, sponsor can also announce in real time and participate in list (comprising: sequence number+user's signature), and use the private key of oneself to generate signature, jointly supervising by participating in the user of probability event, to be tampered to prevent the participating user list of probability event and sponsor denies recognition to hit user afterwards.At the end of probability event holds the time, sponsor can announce to freeze list, and finally obtains the total number of persons Total participating in probability event.
In preferred implementation process, specifying the user participating in probability event needs to use private key to carry out signature authentication, thereby increases the threshold that probability event is mutual.Certainly, in order to weigh fail safe and the convenience of probability event, can suitably remove above-mentioned signature authentication, such as: signature authentication is replaced with adopt probability event user identification card number, cell-phone number, micro-signal, No. QQ, member's card number, website log account etc. is as announcing list.
Below in conjunction with the preferred implementation of two shown in Fig. 2 and Fig. 3, above-mentioned preferred implementation process is further described.
Fig. 2 is the flow chart having the lottery drawing method of fairness and fairness concurrently according to the preferred embodiment of the present invention one.As shown in Figure 2, the method can comprise following treatment step:
The sponsor of step S202, sweepstake can arrange in advance with the user participating in drawing a lottery: rivest, shamir, adelman uses RSA Algorithm, hash function adopts SHA-1 algorithm, signature algorithm adopts the value of SHA-1-RSA algorithm (namely first make a summary with SHA-1, then use rsa encryption) and Limit to be 2^24 (about 1,000 ten thousand);
Step S204, sponsor and each user generate respective double secret key respectively, and the PKI announcing self uses when verifying;
Step S206, sponsor initiate prize drawing, and it specifies draw times to be 0 o'clock to 24 o'clock on the 2nd November in 2015, and the deviant Offset=96428308 that stochastic generation one is temporarily maintained secrecy, use signature algorithm to sign, and it is as follows to announce its signature result:
C6mCCRxXoC+UCsItV4LQzUsgqzPrMr1JCeivBLKQusr8x/IG/lr3G0eQt1sSv6VS1Lcok9CxrQWi/mi+7g83pf
iIGDolYxZusKS5JtWtUCUXpNDdFEwDSGrK0xeeu4fPuSH1mwXywnJAX8EdMGE1dKhlOGg8OR/OKZdjkm7ovbs＝
Step S208, after prize drawing starts, in 00:00:05 on November 02 2015 time, user 01 participate in prize drawing, generate the signature of oneself;
1JMAKNGZM0ZX5ABLbRCuQI+zwir013H/GgmRM0h98pSljxYqNY2IBCg2DOlzTs8e5ES6bAjkRVjan6yO+hxLF/
H+ijtvsVUvyDxKDuI4y1B8JM4Ost8kVCuDD6TKiE12TsH/YxhgSTqyNYx4N3mc6agXxre8e170bmszhRgNm1I＝
Step S210, sponsor announce list in time, wherein, comprise date and time information, temporal information and the signing messages in above-mentioned steps S208, that is: in the process announcing list
User-12015.11.0200:00:05
1JMAKNGZM0ZX5ABLbRCuQI+zwir013H/GgmRM0h98pSljxYqNY2IBCg2DOlzTs8e5ES6bAjkRVjan6yO+hxLF/
H+ijtvsVUvyDxKDuI4y1B8JM4Ost8kVCuDD6TKiE12TsH/YxhgSTqyNYx4N3mc6agXxre8e170bmszhRgNm1I＝
And adopt the key of sponsor to be encrypted signature whole segment information, and announce as follows:
HcfWc7bekGNrBLT3OB9HyYb2BTooqIq6vLeP3lkO54hOT9gEYcXTfFXW2jr+SDxC3QQFP9+4SpB23OhPxlFqM2
UvN0h5+S/sWbwGzP7oBT/wZKuSR3nYPduUfK55sSQpUz53OAUvpaccCgZeZ0E7epuWkVcEbPmniocMYQ6k10s＝
Step S212, judge whether the user of current participation sweepstake is last user, if not, then repeat above-mentioned steps S208-step S210, expect that more user participates in prize drawing; If so, then continue to perform step S214;
Step S214, before sweepstake terminates, participate in prize drawing in 23:59:59 on November 02 2015 time the 100th user (i.e. last user), generate the signature of oneself, specific as follows:
DYTQtI6rd/oUIO+CqDAK9oxYQjGyMKNxe3LXDaPzGraL0aDQ97Cjm7PcP1trNi0iX9hIHecu1H15H9hn/lg0DL
DRh9zf8xHw9m5SwDuaCOmab5IR8R6OQBPYq2m6Wg2AisXAsWMzyC4FuiE2VA7DIE8SygIdwugSQhmgTwpixZg＝
Step S216, after sweepstake terminates, sponsor announces final whole user list and declaration prize drawing terminates, and participates in the user list of sweepstake and is finally confirmed to be:
User-12015.11.0200:00:05
1JMAKNGZM0ZX5ABLbRCuQI+zwir013H/GgmRM0h98pSljxYqNY2IBCg2DOlzTs8e5ES6bAjkRVjan6yO+hxLF/
H+ijtvsVUvyDxKDuI4y1B8JM4Ost8kVCuDD6TKiE12TsH/YxhgSTqyNYx4N3mc6agXxre8e170bmszhRgNm1I＝
User-22015.11.0200:00:06
...
User-1002015.11.0223:59:59
DYTQtI6rd/oUIO+CqDAK9oxYQjGyMKNxe3LXDaPzGraL0aDQ97Cjm7PcP1trNi0iX9hIHecu1H15H9hn/lg0DL
DRh9zf8xHw9m5SwDuaCOmab5IR8R6OQBPYq2m6Wg2AisXAsWMzyC4FuiE2VA7DIE8SygIdwugSQhmgTwpixZg＝
And adopt the key of sponsor to be encrypted signature whole segment information, and announce as follows:
h9hikx2tnxr/6P/8qrOT2a13dD0IrsPtUHZwzafeVlwGxJAEJ3HsTMRnaBFzeEpVFQeq6GlbOe74nMIxsR5DVX
usumTH1PWgiiv2nrxkBU3eh3EVsiaWfTkJZiQITTHmvbAWcA7djJk+tt5jKEjsCb2DUXxprfwV4qrdl9fwQ9U＝
The user list and deviant Offset that participate in prize drawing are integrated by step S218, sponsor, and stochastic generation character string Salt, wherein, the initial value (16 system) of Salt is:
1bb0e044d3a8c55bdca5da8e9382d04e9b645f1544；
Step S220, by the integrated results of user list and Offset, then after combining with Salt, the cryptographic Hash generated through hash function computing is:
cac705861566cfea014ce0c1b3f2e3a2052abf40
Through judging, this cryptographic Hash does not meet the condition (such as: the operation result of the cryptographic Hash mould Limit calculated by hash function is 0) preset, then repeated execution of steps S218, sponsor continues to find the Salt satisfied condition, suppose that the method used is for certainly increasing 1 by Salt at every turn, reruning after 28484088 times, finally finding the Salt value meeting the condition that presets:
1bb0e044d3a8c55bdca5da8e9382d04e9b6611b73c
By the integrated results of user list and Offset, then after combining with Salt, the cryptographic Hash generated through hash function computing is:
7538a3bf927fc6fa77c26897d80600c7c4000000
This cryptographic Hash meets the above-mentioned condition (after result, 6 is 0 entirely, obvious aliquot Limit=2^24) preset;
On the computer that is equipped with 2.6GHzIntelCorei5, about 92.94 seconds of the running time of above-mentioned calculating.
The cryptographic Hash that step S222, employing generate, after divided by Limit, then mould participates in total number of users 100 of sweepstake, obtains 88;
Step S224, sponsor announce Offset decrypted result, qualified Salt result declare that the 88th user wins a prize;
Step S226, the 88th user, open certifying signature to one's name, and carries out receiving the award matters.
Fig. 3 is the flow chart having the lottery drawing method of fairness and fairness concurrently according to the preferred embodiment of the present invention two.As shown in Figure 3, the method can comprise following treatment step:
The sponsor of step S302, probability event can arrange in advance with the user participating in drawing a lottery: rivest, shamir, adelman uses RSA Algorithm, hash function adopts SHA-256 algorithm, signature algorithm adopts SHA-256-RSA algorithm (namely first to make a summary with SHA-256, use rsa encryption again), Limit value is 2^24 (about 1,000 ten thousand);
Step S304, sponsor and each user generate respective double secret key respectively, and the PKI announcing self uses when verifying;
Step S306, sponsor initiate prize drawing, and it specifies draw times to be 0 o'clock to 24 o'clock on the 12nd November in 2015, and the deviant Offset=22899183 that stochastic generation one is temporarily maintained secrecy, use signature algorithm to sign, and it is as follows to announce its signature result:
C6mCCRxXoC+UCsItV4LQzUsgqzPrMr1JCeivBLKQusr8x/IG/lr3G0eQt1sSv6VS1Lcok9CxrQWi/mi+7g83pf
iIGDolYxZusKS5JtWtUCUXpNDdFEwDSGrK0xeeu4fPuSH1mwXywnJAX8EdMGE1dKhlOGg8OR/OKZdjkm7ovbs＝
Step S308, after prize drawing starts, in 00:00:05 on November 12 2015 time, user 01 participate in prize drawing, the signature generating oneself is as follows:
n4yOaSyqOqassv9Fiud0FbbQ3dwp2l8g6Dym9L3Oq1L++GlWjcOyk3cWc5Fwet31QwI2EZHGjZampFBpUcr9M9
TvTNhtq0NSxLCrnmb3RQGNobIHmwqnF3QXWjn4aGJffqrz+TTbzO4blDGY+jPK8s7jBk3YkRqIj2yyGcTqXsU＝
Step S310, sponsor announce list in time, wherein, comprise date and time information, temporal information and the signing messages in above-mentioned steps S308, that is: in the process announcing list
User-12015.11.1200:00:05
n4yOaSyqOqassv9Fiud0FbbQ3dwp2l8g6Dym9L3Oq1L++GlWjcOyk3cWc5Fwet31QwI2EZHGjZampFBpUcr9M9
TvTNhtq0NSxLCrnmb3RQGNobIHmwqnF3QXWjn4aGJffqrz+TTbzO4blDGY+jPK8s7jBk3YkRqIj2yyGcTqXsU＝
And adopt the key of sponsor to be encrypted signature whole segment information, and announce as follows:
tY9KQqSJ4URqFb2gl0EPZhQ8Q2AmAACaUnL8WlChiP8o2BuCpUHBtOkl5ocKBTRcwRPXXEZHOmaAs50dBuNWfg
wi2a7BRZBoXh8/teLL9B8nLTqaBwIY/7VoffQehGzNhnba5GeJ8/9E4J34IQa20N2Jno+RuD/287ZODQMvh9w＝
Step S312, judge whether the user of current participation probability event is last user, if not, then repeat above-mentioned steps S308-step S310, expect that more user participates in prize drawing; If so, then continue to perform step S314;
Step S314, before probability event terminates, participate in prize drawing in 23:59:59 on November 12 2015 time the 1000th user (i.e. last user), generate the signature of oneself, specific as follows:
xY1z72EONT1aumdigVkG6cCsbzVbsQJcM9js4JR2zx3xWIsco3M49+TLtHUNjpgExr74n8KWa4OivhZu7j+VDa
Rn7XyVRX9PQeZnqNTEj2cgt8YKvas7Fb8crLPkz+NI85Gc71oshdrjrNLQ5kInv+farazr1BpdwxAr1NHxXOQ＝
Step S316, after probability event terminates, sponsor announces final whole user list and declaration prize drawing terminates, and participates in the user list of probability event and is finally confirmed to be:
User-12015.11.1200:00:05
n4yOaSyqOqassv9Fiud0FbbQ3dwp2l8g6Dym9L3Oq1L++GlWjcOyk3cWc5Fwet31QwI2EZHGjZampFBpUcr9M9
TvTNhtq0NSxLCrnmb3RQGNobIHmwqnF3QXWjn4aGJffqrz+TTbzO4blDGY+jPK8s7jBk3YkRqIj2yyGcTqXsU＝
User-22015.11.1200:00:06
...
User-10002015.11.1223:59:59
xY1z72EONT1aumdigVkG6cCsbzVbsQJcM9js4JR2zx3xWIsco3M49+TLtHUNjpgExr74n8KWa4OivhZu7j+VDa
Rn7XyVRX9PQeZnqNTEj2cgt8YKvas7Fb8crLPkz+NI85Gc71oshdrjrNLQ5kInv+farazr1BpdwxAr1NHxXOQ＝
And adopt the key of sponsor to be encrypted signature whole segment information, and announce as follows:
O090opcYUddpKtPg0JoDrx3vbGDiEHrOGgxJZEaWL2bojf6boWW/6GNvuBpwcYa+qEtnPx0sTqMEAYEb/63zsr
6QdI8jOSOP4yc27i9y+2x08ziVfCfDoCZ22ky9vzH1YFkJ9E9VvoN6M7bLnjzBLxscXmzQzNveu5KAEQntOqw＝
The user list and deviant Offset that participate in prize drawing are integrated by step S318, sponsor, and stochastic generation character string Salt, wherein, the initial value (16 system) of Salt is:
110ab0b2a0a021593b3a0ee89508b37db7c031ac9
Step S320, by the integrated results of user list and Offset, then after combining with Salt, the cryptographic Hash generated through hash function computing is:
ee7103b6139079736913fa5d058be24e1a193d67ef80db5839c8fca6d7de146b
Through judging, this cryptographic Hash does not meet the condition (such as: the operation result of the cryptographic Hash mould Limit calculated by hash function is 0) preset, then repeated execution of steps S318, sponsor continues to find the Salt satisfied condition, suppose that the method used specifies a Salt for each for random, reruning after 23027262 times, finally finding the Salt value (16 system) meeting the condition that presets:
110ab0b2a0a021593b3a0ee89508b37db7e2343bc
By the integrated results of user list and Offset, then after combining with Salt, the cryptographic Hash generated through hash function computing is:
fba94f4faf4adf5f9c7bbdc3ab85f2092cea1e2d1e5c9a0a12570a9ce1000000
This cryptographic Hash meets the above-mentioned condition (after result, 6 is 0 entirely, obvious aliquot Limit=2^24) preset
On the computer that is equipped with 2.6GHzIntelCorei5, about 176.56 seconds of the running time of above-mentioned calculating.
The cryptographic Hash that step S322, employing generate, after divided by Limit, then mould participates in total number of users 1000 of probability event, obtains 433;
Step S324, sponsor announce Offset decrypted result, qualified Salt result declare the 433rd user's hit;
Step S326, the 433rd user, open certifying signature to one's name, and carries out receiving the award matters.
Fig. 4 is the structured flowchart determining the device hitting user in probability event according to the embodiment of the present invention.As shown in Figure 4, the determining device of this hit user can comprise: acquisition module 10, for obtaining the identification information of the whole users participating in probability event in the time range that sets in probability event; Determination module 20, for adopting the identification information of whole user in preset function, interference factor that the sponsor of probability event presets and the current decryption factor chosen determine to hit user, wherein, interference factor is used for controlling to carry out anticipation to hit user, and whether the current decryption factor chosen meets for the result of calculation of aided verification preset function the verification condition set in preset function.
Alternatively, Fig. 5 is the structured flowchart determining the device hitting user according to the preferred embodiment of the invention in probability event.As shown in Figure 5, determination module 20 can comprise: the first processing unit 200, for the identification information of whole user and interference factor being merged according to the first computation rule set in preset function, obtains intermediate object program sequence; Second processing unit 202, for intermediate object program sequence and the current decryption factor chosen being merged according to the second computation rule set in preset function, obtains verification sequence; Authentication unit 204, for verifying verification sequence according to verification condition, if verification sequence does not meet verification condition, then regenerating decryption factor next time to be chosen, returning the second processing unit; If verification sequence meets verification condition, then determine according to the total number of persons of verification condition and whole user the identification information hitting user.
Alternatively, authentication unit 204, for one of in such a way regenerating decryption factor next time to be chosen: with the current decryption factor chosen for benchmark, increasing or decreasing N, generates decryption factor next time to be chosen, and wherein, N is positive integer; The decryption factor that stochastic generation is next time to be chosen, wherein, decryption factor next time to be chosen is different from the current decryption factor chosen.
Alternatively, authentication unit 204 can comprise: judgment sub-unit (not shown), for judging whether the intermediate object program that verification sequence and default value computing obtain meets verification condition, wherein, for controlling, default value determines that hit user needs the operand performed; Determine subelement (not shown), during for meeting verification condition in intermediate object program, then adopt intermediate object program and total number of persons to determine the identification information hitting user.
Alternatively, as shown in Figure 5, acquisition module 10 can comprise: receiving element 100, for receiving the participation probability event request of each user in whole user in time range successively, wherein, participate in carrying the identification information of each user self through signature authentication process in probability event request; Display unit 102, for carrying out publicity by the identification information through signature authentication process corresponding with each user respectively.
The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.
In the above embodiment of the present invention, the description of each embodiment is all emphasized particularly on different fields, in certain embodiment, there is no the part described in detail, can see the associated description of other embodiments.
In several embodiments that the application provides, should be understood that, disclosed technology contents, the mode by other realizes.Wherein, device embodiment described above is only schematic, the such as division of described unit, can be that a kind of logic function divides, actual can have other dividing mode when realizing, such as multiple unit or assembly can in conjunction with or another system can be integrated into, or some features can be ignored, or do not perform.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be by some interfaces, and the indirect coupling of unit or module or communication connection can be electrical or other form.
The described unit illustrated as separating component or can may not be and physically separates, and the parts as unit display can be or may not be physical location, namely can be positioned at a place, or also can be distributed on multiple unit.Some or all of unit wherein can be selected according to the actual needs to realize the object of the present embodiment scheme.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, also can be that the independent physics of unit exists, also can two or more unit in a unit integrated.Above-mentioned integrated unit both can adopt the form of hardware to realize, and the form of SFU software functional unit also can be adopted to realize.
If described integrated unit using the form of SFU software functional unit realize and as independently production marketing or use time, can be stored in a computer read/write memory medium.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words or all or part of of this technical scheme can embody with the form of software product, this computer software product is stored in a storage medium, comprises all or part of step of some instructions in order to make a computer equipment (can be personal computer, server or the network equipment etc.) perform method described in each embodiment of the present invention.And aforesaid storage medium comprises: USB flash disk, read-only memory (ROM, Read-OnlyMemory), random access memory (RAM, RandomAccessMemory), portable hard drive, magnetic disc or CD etc. various can be program code stored medium.
The above is only the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (10)
1. in probability event, determine a method of hitting user, it is characterized in that, comprising:
The identification information of the whole users participating in described probability event is obtained in the time range of probability event setting;
In preset function, adopt the identification information of described whole user, interference factor that the sponsor of described probability event presets and the current decryption factor chosen determine to hit user, wherein, described interference factor is used for controlling to carry out anticipation to described hit user, and whether the described current decryption factor chosen meets for the result of calculation of preset function described in aided verification the verification condition set in described preset function.
2. method according to claim 1, is characterized in that, in described preset function, adopting the identification information of described whole user, described interference factor and described decryption factor to determine, described hit user comprises:
First combining step, according to the first computation rule set in described preset function, the identification information of described whole user and described interference factor to be merged, obtain intermediate object program sequence;
Second combining step, according to the second computation rule set in described preset function, described intermediate object program sequence and the described current decryption factor chosen to be merged, obtain verification sequence;
According to described verification condition, described verification sequence is verified, if described verification sequence does not meet described verification condition, then regenerate decryption factor next time to be chosen, return the second combining step; If described verification sequence meets described verification condition, then determine the described identification information hitting user according to the total number of persons of described verification condition and described whole user.
3. method according to claim 2, is characterized in that, decryption factor next time to be chosen described in regenerating one of in such a way:
With the described current decryption factor chosen for benchmark, increasing or decreasing N, decryption factor next time to be chosen described in generation, wherein, N is positive integer;
Decryption factor next time to be chosen described in stochastic generation, wherein, described decryption factor next time to be chosen is different from the described current decryption factor chosen.
4. method according to claim 2, it is characterized in that, according to described verification condition described verification sequence verified and when described verification sequence meets verification condition, determine that the identification information of described hit user comprises according to described verification condition and described total number of persons:
Judge whether the intermediate object program that described verification sequence and default value computing obtain meets described verification condition, wherein, for controlling, described default value determines that described hit user needs the operand performed;
If described intermediate object program meets described verification condition, then described intermediate object program and described total number of persons is adopted to determine the described identification information hitting user.
5. method according to claim 1, is characterized in that, the identification information obtaining described whole user in described time range comprises:
In described time range, receive the participation probability event request of each user in described whole user successively, wherein, in the request of described participation probability event, carry the identification information of each user self through signature authentication process;
Respectively the identification information through signature authentication process corresponding with each user is carried out publicity.
6. in probability event, determine the device hitting user, it is characterized in that, comprising:
Acquisition module, for obtaining the identification information of the whole users participating in described probability event in the time range that sets in probability event;
Determination module, for adopting the identification information of described whole user in preset function, interference factor that the sponsor of described probability event presets and the current decryption factor chosen determine to hit user, wherein, described interference factor is used for controlling to carry out anticipation to described hit user, and whether the described current decryption factor chosen meets for the result of calculation of preset function described in aided verification the verification condition set in described preset function.
7. device according to claim 6, is characterized in that, described determination module comprises:
First processing unit, for the identification information of described whole user and described interference factor being merged according to the first computation rule set in described preset function, obtains intermediate object program sequence;
Second processing unit, for described intermediate object program sequence and the described current decryption factor chosen being merged according to the second computation rule set in described preset function, obtains verification sequence;
Authentication unit, for verifying described verification sequence according to described verification condition, if described verification sequence does not meet described verification condition, then regenerating decryption factor next time to be chosen, returning described second processing unit; If described verification sequence meets described verification condition, then determine the described identification information hitting user according to the total number of persons of described verification condition and described whole user.
8. device according to claim 7, is characterized in that, described authentication unit, the decryption factor for next time to be chosen described in regenerating one of in such a way:
With the described current decryption factor chosen for benchmark, increasing or decreasing N, decryption factor next time to be chosen described in generation, wherein, N is positive integer;
Decryption factor next time to be chosen described in stochastic generation, wherein, described decryption factor next time to be chosen is different from the described current decryption factor chosen.
9. device according to claim 7, is characterized in that, described authentication unit comprises:
Judgment sub-unit, for judging whether the intermediate object program that described verification sequence and default value computing obtain meets described verification condition, wherein, for controlling, described default value determines that described hit user needs the operand performed;
Determine subelement, for when described intermediate object program meets described verification condition, then adopt described intermediate object program and described total number of persons to determine the described identification information hitting user.
10. device according to claim 6, is characterized in that, described acquisition module comprises:
Receiving element, for receiving the participation probability event request of each user in described whole user in described time range successively, wherein, carries the identification information of each user self through signature authentication process in the request of described participation probability event;
Display unit, for carrying out publicity by the identification information through signature authentication process corresponding with each user respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510894295.6A CN105516132A (en) | 2015-12-08 | 2015-12-08 | Method and apparatus for determining hit user in probability event |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510894295.6A CN105516132A (en) | 2015-12-08 | 2015-12-08 | Method and apparatus for determining hit user in probability event |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105516132A true CN105516132A (en) | 2016-04-20 |
Family
ID=55723769
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510894295.6A Pending CN105516132A (en) | 2015-12-08 | 2015-12-08 | Method and apparatus for determining hit user in probability event |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105516132A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106933995A (en) * | 2017-02-28 | 2017-07-07 | 张凯 | A kind of public activity ranking screening and sequencing system and its implementation |
| CN115578818A (en) * | 2022-09-30 | 2023-01-06 | 深圳市领存技术有限公司 | Lottery information processing method, device and computer readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010053714A1 (en) * | 1997-01-27 | 2001-12-20 | Kazue Sako | Electronic lottery system and its operating method and computer- readable recording medium in which the electronic lottery program code is stored |
| US20060189368A1 (en) * | 2005-02-22 | 2006-08-24 | Chris Goss | Apparatus and method for generating a graphical transformation of a lottery input number |
| CN103544761A (en) * | 2012-07-13 | 2014-01-29 | 合肥华恒电子科技有限责任公司 | Method for realizing network lots drawing |
-
2015
- 2015-12-08 CN CN201510894295.6A patent/CN105516132A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010053714A1 (en) * | 1997-01-27 | 2001-12-20 | Kazue Sako | Electronic lottery system and its operating method and computer- readable recording medium in which the electronic lottery program code is stored |
| US20060189368A1 (en) * | 2005-02-22 | 2006-08-24 | Chris Goss | Apparatus and method for generating a graphical transformation of a lottery input number |
| CN103544761A (en) * | 2012-07-13 | 2014-01-29 | 合肥华恒电子科技有限责任公司 | Method for realizing network lots drawing |
Non-Patent Citations (1)
| Title |
|---|
| 陈澍: "基于PKI的电子彩票认证平台设计与开发", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106933995A (en) * | 2017-02-28 | 2017-07-07 | 张凯 | A kind of public activity ranking screening and sequencing system and its implementation |
| CN115578818A (en) * | 2022-09-30 | 2023-01-06 | 深圳市领存技术有限公司 | Lottery information processing method, device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112789824B (en) | Block chain system, information transmission method, system, device and computer medium | |
| CN110971413B (en) | Random number generation method, random number generation device and storage medium | |
| RU2652443C1 (en) | Voters votes quantity collected by electronic voting determining system and method | |
| CN111698088B (en) | Key alternation method, key alternation device, electronic equipment and medium | |
| US6904526B1 (en) | System and method of authenticating individuals | |
| CN112507363A (en) | Data supervision method, device and equipment based on block chain and storage medium | |
| CN1879072A (en) | System and method providing disconnected authentication | |
| UA128523C2 (en) | METHOD OF GENERATION OF A BLOCKCHAIN TRANSACTION AND METHOD OF CHECKING THE VALIDITY OF A BLOCK OF BLOCKCHAIN | |
| CN114884697A (en) | Data encryption and decryption method based on state cryptographic algorithm and related equipment | |
| US20160315772A1 (en) | Kerberos preauthentication with j-pake | |
| CN112769548B (en) | Block chain numerical information transmission method, system, device and computer medium | |
| CN116192405B (en) | Electronic voting method and related device | |
| CN110401540A (en) | A publicly verifiable threshold group signature method based on blockchain | |
| CN109936456A (en) | Anti- quantum calculation digital signature method and system based on private key pond | |
| CN112272088A (en) | Auditable signature method based on multiple secure parties and related components | |
| Montenegro et al. | Secure sealed-bid online auctions using discreet cryptographic proofs | |
| CN113242219A (en) | Data transmission method, block chain network and storage medium | |
| Zeydan et al. | Blockchain-based self-sovereign identity: Taking control of identity in federated learning | |
| Jiang et al. | Security analysis of “smaka: secure many-to-many authentication and key agreement scheme for vehicular networks” | |
| CN105516132A (en) | Method and apparatus for determining hit user in probability event | |
| KR102457915B1 (en) | Electronic vote system using smart contract of blockchain and method thereof | |
| CN113055177B (en) | Block chain system, and method, system, device and medium for transmitting numerical information | |
| CN111683070B (en) | Data transmission method and device based on identity encryption and storage medium | |
| CN117201041A (en) | Under-chain collaborative threshold signature method and device based on block chain | |
| CN113055178B (en) | Block chain system, and method, system, device and medium for transmitting numerical information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160420 |
|
| RJ01 | Rejection of invention patent application after publication |