CN114401118A - Login password verification system based on intelligent contract - Google Patents
Login password verification system based on intelligent contract Download PDFInfo
- Publication number
- CN114401118A CN114401118A CN202111609521.3A CN202111609521A CN114401118A CN 114401118 A CN114401118 A CN 114401118A CN 202111609521 A CN202111609521 A CN 202111609521A CN 114401118 A CN114401118 A CN 114401118A
- Authority
- CN
- China
- Prior art keywords
- verification
- values
- polynomial
- login
- intelligent contract
- 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
- 238000012795 verification Methods 0.000 title claims abstract description 121
- 239000013598 vector Substances 0.000 claims description 18
- 238000000034 method Methods 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 3
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 claims 2
- 229910052799 carbon Inorganic materials 0.000 claims 2
- 230000000694 effects Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000010200 validation analysis Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Images
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/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2503—Translation of Internet protocol [IP] addresses
- H04L61/255—Maintenance or indexing of mapping tables
-
- 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/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/0815—Network architectures or network communication protocols for network security for authentication of entities providing single-sign-on or federations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/3026—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters details relating to polynomials generation, e.g. generation of irreducible polynomials
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Physics & Mathematics (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Storage Device Security (AREA)
Abstract
The invention relates to the technical field of information, in particular to a login password verification system based on an intelligent contract, which comprises a password generation module, a login module and a password verification module, wherein the password generation module generates an n-element polynomial, issues a verification intelligent contract on a block chain, generates a characteristic sequence, periodically and randomly generates a plurality of groups of values of n' element variables by the verification intelligent contract, a user calculates the value of the n-element polynomial according to the characteristic sequence and the value of the variable disclosed by the verification intelligent contract, sends the value of the login name associated with the n-element polynomial to the login module to write in the verification intelligent contract, if the verification passes, the login name and the timestamp of a signature user of the intelligent contract are verified, the login module inquires the block chain, and if a signature exists in a verification result column, the user is allowed to log in. The substantial effects of the invention are as follows: the passwords input by the user during login are different every time, and the rule among multiple password inputs is difficult to reversely derive, so that the security of the login password of the user is effectively improved.
Description
Technical Field
The invention relates to the technical field of information, in particular to a login password verification system based on an intelligent contract.
Background
Password security has been an important research topic in the field of information technology. With the development of the internet, more and more transactions are participated in by people on the virtual internet, and more rights and interests are owned on the internet. The user's interests on the internet generally include website account interests, website membership interests, asset interests, various civil affair interests handled on the internet, and the like. The rights of these interests are typically defined and protected only by the login password of the user logging into the website. Once the password is revealed, unpredictable loss is brought, and the user rights and interests are greatly threatened. At present, a mode of adopting a salted hash value to replace cipher plaintext transmission is provided, which is helpful for keeping the cipher plaintext of a user secret for a server, but if a thief steals the salted hash value, the thief can still illegally log in the user through the salted hash value directly. There is a continuing need to develop user password protection schemes.
For example, chinese patent CN103118022A, published 2013, 5 month, 22 month, and discloses a password-free different-end login verification method, in order to ensure that an account and a password are separately input on different platforms, a binding process of a corresponding account needs to be performed on a mobile device, which needs to use hardware information of the mobile device to bind the corresponding account and the password, so that a generated local verification database is a device that cannot be unbound, and the mobile device-end database is prevented from being stolen for use, the hardware information of the mobile device is submitted to a binding server and a verification server during the binding process, so as to generate server-end device verification binding data of the corresponding account, the process only occurs once, the verification process is executed for each login, the user only needs to input an account password once during the binding process, and the other processes are automatically completed, the user only needs to confirm the login during the verification login, the password input method is completed by one key, other operations are completed automatically, and after the password input method is used, a user does not need to remember complex passwords. The technical scheme needs to be bound by means of the mobile equipment, and when the mobile equipment is lost or damaged, the mobile equipment needs to be bound again, so that the binding is tedious. And hardware information of the mobile equipment needs to be submitted to the server side, so that new data safety hazards are caused.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the technical problem that the security degree of the existing login password authentication mode is low is solved. The login password authentication system based on the intelligent contract is provided, and the security degree of login password authentication can be improved.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows: a login password verification system based on an intelligent contract comprises a password generation module, a login module and a password verification module, wherein the password generation module generates an n-element polynomial for a user, coefficient vectors of the n-element polynomial are sent to the user and the password verification module, the password verification module issues a verification intelligent contract on a block chain, the verification intelligent contract comprises a login name, a characteristic sequence, a coefficient sequence, a plurality of verification columns, a verification result column and a verification program segment, the password verification module randomly selects a plurality of variables for verifying the intelligent contract, the selected variables take the values of nonzero constant values to generate the characteristic sequence for verifying the intelligent contract, the values of the selected variables in the characteristic sequence are corresponding constant values, the other variables in the characteristic sequence take the values of zero, the nonzero constant values are substituted into the n-element polynomial to obtain the coefficient sequence of the n-element polynomial, the verification program segment restores an n 'element polynomial according to the characteristic sequence and the coefficient sequence, periodically and randomly generates a plurality of groups of values of n' element variables, calculates the values of the n 'element polynomial, discloses the characteristic sequence and the values of the n' element variables, restores the n element polynomial by a user, calculates and obtains the values of the n element polynomial according to the characteristic sequence disclosed by the verification intelligent contract and the values of the n 'element variables, associates the login name with the values of the n element polynomials and sends the values to the login module, the login module writes the values of the n element polynomial into a verification column of the verification intelligent contract, the values of the n element polynomials and the values of the n' element polynomial can be matched and equal, the verification is passed, the login name and the time stamp of the verification intelligent contract signature user are written into a verification result column, the login module inquires a block chain, if the verification result column has a signature and the time stamp is within a preset threshold range from the current time, the user is allowed to log in this time.
Preferably, when the verification intelligent contract randomly generates a plurality of sets of values of n' element variables, the following steps are executed: the verification intelligent contract randomly selects at least one variable, the value of the selected variable in the preset time length is a fixed value, and another randomly generated fixed value is taken after the preset time length is exceeded; the unselected variables take on random values, and the values of all variables form a set of n' element variables.
Preferably, sorting weights are set for the variables, the highest index value of the variables is obtained, each variable takes the index value as the number of times of an n-element polynomial, a single-element polynomial with the coefficient of 0 is complemented, the number of times of each variable of the single-element polynomial of the n-element polynomial is multiplied by the sorting weight of the corresponding variable and then summed to be used as a sorting value of the single-element polynomial, the single-element polynomials of the n-element polynomial are sorted according to the sorting value descending order, the coefficients of the single-element polynomials of the n-element polynomial after sorting are sequentially obtained, and coefficient vectors of the n-element polynomial are formed.
Preferably, the verification module substitutes a non-zero constant value into the n-ary polynomial to obtain an n '-ary polynomial, multiplies the degree of each variable of the polynomial of the n' -ary polynomial by the ranking weight of the corresponding variable, and then sums the multiplied degrees to serve as the ranking value of the polynomial, and sequentially obtains the coefficients of the polynomial of the n '-ary polynomial after ranking to form the coefficient vector of the n' -ary polynomial.
Preferably, the verification module issues a plurality of verification intelligent contracts on the block chain, the verification intelligent contracts are provided with contract numbers, a user sends a login name and values of a plurality of groups of n-ary polynomials associated with the contract numbers to the login module, the login module sends the values of the n-ary polynomials to the verification intelligent contracts corresponding to the contract numbers, the login module inquires the block chain, the verification result columns of the plurality of verification intelligent contracts are provided with signatures, and the time stamp is within a preset threshold range from the current time, so that the user is allowed to login.
Preferably, when the ratio of the values of the n-ary polynomials and the values of the n' -ary polynomials which can be matched and equal exceeds a preset percentage threshold, the verification intelligent contract judges that the verification is passed, and the login name and the timestamp of the verification intelligent contract signature user are written into a verification result column.
The substantial effects of the invention are as follows: through verifying the intelligent contract, the passwords input by the user at each time of login are different, the rules among the password inputs for multiple times are difficult to reversely derive, and even if a thief steals the password plaintext for multiple times, the thief cannot log in the account of the user; the method does not need to be bound by hardware, and is low in popularization and use cost.
Drawings
Fig. 1 is a schematic diagram illustrating a login password authentication system according to an embodiment.
FIG. 2 is a schematic diagram of an embodiment variable value generation process.
FIG. 3 is a diagram illustrating a process of obtaining a coefficient vector according to an embodiment.
Wherein: 10. the system comprises a password generation module 11, a coefficient vector 20, a user 30, a password verification module 31, a verification intelligent contract 40, a login module 50 and a block chain.
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:
a login password verification system based on an intelligent contract, please refer to figure 1, which comprises a password generation module 10, a login module 40 and a password verification module 30, wherein the password generation module 10 generates an n-element polynomial for a user 20, sends a coefficient vector 11 of the n-element polynomial to the user 20 and the password verification module 30, the password verification module 30 issues a verification intelligent contract 31 on a block chain 50, the verification intelligent contract 31 comprises a login name, a characteristic sequence, a coefficient sequence, a plurality of verification columns, a verification result column and a verification program segment, the password verification module 30 randomly selects a plurality of variables for the verification intelligent contract 31, the selected variables take on non-zero constant values to generate a characteristic sequence for the verification intelligent contract 31, the values of the selected variables in the characteristic sequence are corresponding constant values, the values of the other variables in the characteristic sequence are zero, the non-zero constant values are substituted into the n-element polynomial, obtaining a coefficient sequence of the n ' element polynomial, restoring the n ' element polynomial according to the characteristic sequence and the coefficient sequence by the verification program section, periodically and randomly generating a plurality of groups of values of the n ' element variable, calculating the values of the n ' element polynomial, disclosing the characteristic sequence and the values of the plurality of groups of n ' element variable, restoring the n element polynomial by the user 20, calculating and obtaining a plurality of values of the n element polynomial according to the characteristic sequence disclosed by the verification intelligent contract 31 and the values of the plurality of groups of n ' element variable, sending the values of the n element polynomial associated with the login name and the plurality of n element polynomials to the login module 40, writing the values of the n element polynomial into a verification column of the verification intelligent contract 31 by the login module 40, writing the login name and a time stamp of the user 20 signed by the verification intelligent contract 31 into a verification result column if the values of the n element polynomial and the values of the n ' element polynomial can be matched and equal, inquiring the block chain 50 by the login module 40, if the signature exists in the verification result column and the distance between the timestamp and the current time is within the preset threshold range, the user 20 is allowed to log in at this time.
The intelligent contract on the block chain exists and is executed in the form of binary machine codes, and the intelligent contract has no readability, and can not recover source codes from the binary machine codes, so that leakage of n' element polynomials can not be caused.
When verifying that smart contracts 31 randomly generate values for sets of n' arguments, please refer to fig. 2, the following steps are performed: step A01) verifying that the intelligent contract 31 randomly selects at least one variable, wherein the value of the selected variable in the preset time length is a fixed value, and the value of the selected variable in the preset time length is another randomly generated fixed value after the preset time length is exceeded; step a 02) the unselected variables take on random values, the values of all variables constituting a set of values of n' ary variables.
Referring to fig. 3, the process of obtaining the coefficient vector 11 includes: step B01) setting sorting weight for the variable; step B02) obtaining the highest index value of the variables, taking the index value of each variable as the degree of the n-element polynomial, and complementing the monomial with the coefficient of the n-element polynomial being 0; step B03), multiplying the times of each variable of the monomials of the n-element polynomial by the sorting weight of the corresponding variable, and then summing the multiplied times to obtain the sorting value of the monomials; step B04) arranging the monomials of the n-ary polynomial in descending order according to the ordering value, and sequentially obtaining the coefficients of the monomials of the n-ary polynomial after the ordering to form the coefficient vector 11 of the n-ary polynomial.
The verification module substitutes a non-zero constant value into the n-element polynomial to obtain an n '-element polynomial, multiplies the degree of each variable of the monomial of the n' -element polynomial by the sorting weight of the corresponding variable, sums the multiplied degrees to serve as the sorting value of the monomial, and sequentially obtains the coefficients of the monomial of the n '-element polynomial after sorting to form a coefficient vector 11 of the n' -element polynomial.
As an alternative embodiment, the verification module issues a plurality of verification intelligent contracts 31 on the block chain 50, each verification intelligent contract 31 has a contract number, the user 20 sends the login name and values of a plurality of sets of n-ary polynomials associated with the contract numbers to the login module 40, the login module 40 sends the values of the n-ary polynomials to the verification intelligent contracts 31 corresponding to the contract numbers, the login module 40 queries the block chain 50, and if the verification result columns of the plurality of verification intelligent contracts 31 have signatures and the time stamp is within a preset threshold range from the current time, the user 20 is allowed to log in.
As an alternative implementation manner of this embodiment, when the ratio of the values of the n-ary polynomials and the value of the n' -ary polynomial that can be matched and equal exceeds a preset percentage threshold, the verification intelligent contract 31 determines that the verification is passed, and the login name and the time stamp of the signature user 20 of the verification intelligent contract 31 are written in the verification result column.
The beneficial technical effects of this embodiment are: by verifying the intelligent contract 31, the passwords input by the user 20 are different each time when the user logs in, the rules among multiple password inputs are difficult to reversely derive, and even if a thief steals the plaintext of the passwords for multiple times, the thief cannot log in the account of the user 20; the method does not need to be bound by hardware, and is low in popularization and use cost.
Example two:
in this embodiment, n takes a value of 3, the user 20S registers an account, and the password generation module 10 generates a 3-element polynomial for the user 20S: f (x, y, z) =7 x ^3 x ^ z ^2+13 x ^2 y ^3 x z +5 x ^2 y ^2 z ^2, and a coefficient vector 11 of the 3-membered polynomial is obtained.
The process of obtaining the coefficient vector 11 is: the highest index value of the derived variables is 3, and the degree of the 3-element polynomial is 9, i.e. the polynomial of the highest degree is 0 x 3 y 3 z 3. A polynomial with a completion coefficient of 0. F (x, y, z) = after completion
0*x^3*y^3*z^3+0*x^3*y^3*z^2+0*x^3*y^3*z^1+0*x^3*y^3*z^0
+
0*x^3*y^2*z^3+0*x^3*y^2*z^2+0*x^3*y^2*z^1+0*x^3*y^2*z^0
+
0*x^3*y^1*z^3+7*x^3*y^1*z^2+0*x^3*y^1*z^1+0*x^3*y^1*z^0
+
…
+
0*x^2*y^3*z^3+0*x^2*y^3*z^2+13*x^2*y^3*z+0*x^2*y^3*z^0
+
…
+
0*x^2*y^2*z^3+5*x^2*y^2*z^2+0*x^2*y^2*z^1+0*x^2*y^2*z^0
+
…
+
0*x^0*y^0*z^3+0*x^0*y^0*z^20*x^0*y^0*z^1+0*x^0*y^0*z^0 。
The ordering weights are set for the variables x, y, and z. In this embodiment, the ranking weight of x is 13, the ranking weight of y is 4, and the ranking weight of z is 1. Along with the polynomials of coefficient 0, the rank values of each of the polynomials are calculated. The monomials in which the coefficients are other than 0 are underlined. Example ranking values for calculated coefficients other than 0 are as follows:
the order value of the monomial 0 x ^3 y ^3 z ^3 is as follows: 13 x 3+4 x 3+1 x 3= 54;
the order value of the monomial 7 x ^3 y x z ^2 is: 13 x 3+4 x 1+2= 45;
the order value of the monomial 13 x ^2 y ^3 x z is: 13 x 2+4 x 3+1= 39;
the order value of the monomial 5 x ^2 y ^2 z ^2 is as follows: 13 x 2+4 x 2+1 x 2= 36.
The calculation of the rank value of the polynomial with a coefficient of 0 is omitted here. The coefficients are sorted in descending order of the sorted value, so the corresponding coefficients are sorted to 0,0, …,7, …, 13, …,5, …,0, and thus the coefficient vector 11 is <0,0, …,7, …, 13, …,5, …,0>, there are 9 0's before the coefficient 7, and the length of the coefficient vector 11 is 64. The user 20 end is sorted according to the same monomial, and f (x, y, z) can be recovered by matching the coefficient vector 11. The method for setting the sequencing weight comprises the following steps: sorting the variables, setting the sorting weight of the last variable to 1, calculating the product of the highest exponential value and 1, and adding 1 to the product to serve as the sorting weight of the second last variable. And then calculating the product of the sorting weight of the last-but-one variable and the highest exponent value, and adding 1 to the product to serve as the sorting weight of the last-but-one variable. With this calculation, the ranking weights of all variables are obtained.
Cryptographic validation module 30 issues validation intelligence contracts 31 on blockchain 50. A constant value variable x is chosen for verification of smart contract 31, and the signature sequence is (3,0, 0). The characteristic sequence (3,0,0) indicates that x must be 3, and the values of the other variables are not limited.
The password verification module 30 substitutes x value 3 into f (x, y, z), to obtain f' (y, z) =189 ^ y ^ z 2+117 ^ y ^3 ^ z +45 ^ y ^2 ^ z ^2, verifies that the intelligent contract 31 randomly generates values of 3 groups of variables: (3,16), (3,9) and (3, 32). Wherein, y takes a random constant value and periodically changes the value of y into another constant value. The corresponding polynomial values are:
f’(3,16)=189*3*16^2+117*3^3*16+45*3^2*16^2=299,376；
f’(3,9)=189*3*9^2+117*3^3*9+45*3^2*9^2=107,163；
f’(3,32)=189*3*32^2+117*3^3*32+45*3^2*32^2=1,096,416。
verifying that smart contract 31 discloses (3,0,0), (3,16), (3,9), and (3, 32).
The user 20 recovers f (x, y, z) =7 x ^3 x ^ y ^ z ^2+13 x ^2 y ^3 x z +5 x ^2 y ^2 x ^2 z ^2 based on the coefficient vector 11, calculates f (3,3,16) =299,376, f (3,3,9) =107,163, and f (3,3,32) =1,096,416 based on the value disclosed by the verification intelligent contract 31. The user 20 sends the login name and (299,376, 107,163, 1,096,416) to the login module 40. Login module 40 writes (299,376, 107,163, 1,096,416) to validate smart contract 31, validating that smart contract 31 verified. Then the login name and the time stamp of the signature user 20 of the verification smart contract 31 are written into the verification result column. The login module 40 queries the blockchain 50 and decrypts the signature using the public key of the authentication intelligence contract 31 to obtain the login name and the timestamp. The login name is verified and the timestamp is verified to be within a preset threshold from the current time, thus allowing the user 20 to login this time.
When the values of a plurality of n-ary polynomials and n' -ary polynomials can match equal proportionsIf the preset percentage threshold is exceeded, the verification intelligent contract 31 judges that the verification is passed, and the login name and the time stamp of the signature user 20 of the verification intelligent contract 31 are written into the verification result column. In this embodiment, the user 20 may intentionally mistake (299,376, 107,163, 1,096,416) by one value. Such as fill-in (299,376),501,1621,096,416) that the verification smart contract 31 has verified that two of them are correct and thus also determines that the verification has passed, the login name and the time stamp of the signed user 20 are written in the verification result field. Stolen by a thief (299,376,501,1621,096,416), it is more difficult to reverse the expression of the 3-way polynomial and further improve the security of the user 20 password because it is not possible to determine whether there is an error value or which value is the error value. Verification intelligence contract 31 periodically generates a new random value as the value of y.
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 (6)
1. A login password verification system based on an intelligent contract is characterized in that,
comprises a password generating module, a login module and a password verification module,
the password generation module generates an n-element polynomial for the user, sends the coefficient vector of the n-element polynomial to the user and the password verification module,
the password verification module issues a verification intelligent contract on a block chain, the verification intelligent contract comprises a login name, a characteristic sequence, a coefficient sequence, a plurality of verification columns, a verification result column and a verification program section, the password verification module randomly selects a plurality of variables for verifying the intelligent contract, the selected variables take nonzero constant values, the characteristic sequence is generated for verifying the intelligent contract, the values of the selected variables in the characteristic sequence are corresponding constant values, the other variables take zero values in the characteristic sequence, the nonzero constant values are substituted into an n-element polynomial to obtain the coefficient sequence of the n ' -element polynomial, the verification program section restores the n ' -element polynomial according to the characteristic sequence and the coefficient sequence, the values of a plurality of groups of n ' -element variables are periodically and randomly generated, the values of the n ' -element polynomial are calculated, the characteristic sequence and the values of a plurality of groups of n ' -element variables are disclosed,
the method comprises the steps that a user restores an n-element polynomial, values of a plurality of n-element polynomials are obtained through calculation according to a feature sequence disclosed by a verification intelligent contract and values of a plurality of groups of n '-element variables, a login name is associated with the values of the n-element polynomials and sent to a login module, the login module writes the values of the n-element polynomials into a verification column of the verification intelligent contract, the values of the n-element polynomials and the values of the n' -element polynomials can be matched and equal, verification is passed, the login name and a timestamp of a user who signs the verification intelligent contract are written into a verification result column, the login module inquires a block chain, and if a signature exists in the verification result column and the timestamp is within a preset threshold range from the current time, the user is allowed to log in.
2. A login password verification system according to claim 1, wherein,
when the verification intelligent contract randomly generates a plurality of groups of values of n' element variables, the following steps are executed:
the verification intelligent contract randomly selects at least one variable, the value of the selected variable in the preset time length is a fixed value, and another randomly generated fixed value is taken after the preset time length is exceeded;
the unselected variables take on random values, and the values of all variables form a set of n' element variables.
3. A login password verification system according to claim 1 or 2, wherein,
setting sorting weight for variables, obtaining the highest index value of the variables, taking the index value of each variable as the number of times of an n-element polynomial, complementing the single-element polynomial with the coefficient of 0 of the n-element polynomial, multiplying the number of times of each variable of the single-element polynomial of the n-element polynomial by the sorting weight of the corresponding variable, then summing the multiplied numbers to be used as the sorting value of the single-element polynomial, sorting the single-element polynomials of the n-element polynomial according to the sorting value in a descending order mode, sequentially obtaining the coefficients of the single-element polynomials of the n-element polynomial after sorting, and forming the coefficient vector of the n-element polynomial.
4. A login password verification system according to claim 3, wherein,
the verification module substitutes a non-zero constant value into the n-element polynomial to obtain an n '-element polynomial, the times of each variable of the monomials of the n' -element polynomial are multiplied by the sorting weight of the corresponding variable and then summed to serve as the sorting value of the monomials, and the coefficients of the monomials of the n '-element polynomial after sorting are sequentially obtained to form the coefficient vector of the n' -element polynomial.
5. The block chain-based carbon emission rights trading center account management system according to claim 1 or 2,
the verification module issues a plurality of verification intelligent contracts on a block chain, the verification intelligent contracts are provided with contract numbers, a user sends a login name and a plurality of groups of values of n-element polynomials associated with the contract numbers to the login module, the login module sends the values of the n-element polynomials to the verification intelligent contracts corresponding to the contract numbers, the login module inquires the block chain, and if signatures exist in verification result columns of the plurality of verification intelligent contracts and the distance between a timestamp and the current time is within a preset threshold range, the user is allowed to login.
6. The block chain-based carbon emission rights trading center account management system according to claim 1 or 2,
when the ratio that the values of the n-element polynomials and the values of the n' -element polynomials can be matched and equal exceeds a preset percentage threshold value, the verification intelligent contract is judged to pass verification, and the login name and the time stamp of the verification intelligent contract signature user are written into a verification result column.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111609521.3A CN114401118B (en) | 2021-12-27 | 2021-12-27 | Login password verification system based on intelligent contract |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111609521.3A CN114401118B (en) | 2021-12-27 | 2021-12-27 | Login password verification system based on intelligent contract |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114401118A true CN114401118A (en) | 2022-04-26 |
| CN114401118B CN114401118B (en) | 2024-04-30 |
Family
ID=81226775
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111609521.3A Active CN114401118B (en) | 2021-12-27 | 2021-12-27 | Login password verification system based on intelligent contract |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114401118B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107967608A (en) * | 2017-12-21 | 2018-04-27 | 北京智帮帮科技有限公司 | A kind of intelligent contract system based on block chain technology |
| CN109359978A (en) * | 2018-10-08 | 2019-02-19 | 全链通有限公司 | Intelligent contract method of commerce and system based on block chain network |
| US20190164153A1 (en) * | 2017-11-30 | 2019-05-30 | Shashank Agrawal | Blockchain system for confidential and anonymous smart contracts |
| CN110728576A (en) * | 2019-08-19 | 2020-01-24 | 湖南科技学院 | Decentralized anonymous data transaction method based on zero knowledge proof |
| CN111125245A (en) * | 2019-11-21 | 2020-05-08 | 深圳壹账通智能科技有限公司 | Data processing method and device based on block chain and storage medium |
-
2021
- 2021-12-27 CN CN202111609521.3A patent/CN114401118B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190164153A1 (en) * | 2017-11-30 | 2019-05-30 | Shashank Agrawal | Blockchain system for confidential and anonymous smart contracts |
| CN107967608A (en) * | 2017-12-21 | 2018-04-27 | 北京智帮帮科技有限公司 | A kind of intelligent contract system based on block chain technology |
| CN109359978A (en) * | 2018-10-08 | 2019-02-19 | 全链通有限公司 | Intelligent contract method of commerce and system based on block chain network |
| CN110728576A (en) * | 2019-08-19 | 2020-01-24 | 湖南科技学院 | Decentralized anonymous data transaction method based on zero knowledge proof |
| CN111125245A (en) * | 2019-11-21 | 2020-05-08 | 深圳壹账通智能科技有限公司 | Data processing method and device based on block chain and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| 吴芷菡 等: "基于区块链的安全电子选举方案", 《计算机应用》, vol. 40, no. 07 * |
| 张凡 等: "一种高效的范围证明方案", 《密码学报》, no. 02 * |
| 李东星: ""基于区块链的网络实体身份认证技术研究"", 《中国优秀硕士学位论文全文数据库》, no. 12 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114401118B (en) | 2024-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107423632B (en) | Customizable sensitive data desensitization method and system | |
| CN108292341B (en) | Method for checking execution integrity of application in target device | |
| CN108921696B (en) | Intelligent contract calling and contract transaction verification method based on block chain | |
| CN109618341A (en) | A kind of digital signature authentication method, system, device and storage medium | |
| CN104281794A (en) | Password storing and verifying method and password storing and verifying device | |
| CN103312664A (en) | Form verification method, device and system | |
| CN111512590B (en) | Homomorphic encryption for password authentication | |
| US9075798B2 (en) | Verifying authenticity of input using a hashing algorithm | |
| Schlögl et al. | eNNclave: Offline inference with model confidentiality | |
| CN110046511A (en) | Leaking data method, apparatus, equipment and storage medium are prevented based on alliance's chain | |
| Yu et al. | Veridedup: A verifiable cloud data deduplication scheme with integrity and duplication proof | |
| Sun et al. | Public data integrity auditing without homomorphic authenticators from indistinguishability obfuscation | |
| CN111711521B (en) | Block chain account private key resetting method and system | |
| EP4035305A1 (en) | Partitioning a request into transactions for a blockchain | |
| Gabor et al. | Security issues related to e-learning education | |
| CN114401118A (en) | Login password verification system based on intelligent contract | |
| CN114401117A (en) | Account login verification system based on block chain | |
| CN114417272A (en) | Carbon emission right trading center account management system based on block chain | |
| CN113890743A (en) | Block chain retrieval private key generation and asset retrieval method, equipment and storage medium | |
| JP6874700B2 (en) | E-commerce systems, communication terminals, third-party servers, e-commerce methods, and programs | |
| CN108712657B (en) | Barrage verification method, computer equipment and storage medium | |
| CN111191272A (en) | Data desensitization method, electronic device and storage medium | |
| CN116566623B (en) | Method, system and electronic equipment for acquiring anonymous digital certificate | |
| CN115022864B (en) | Verification method and device for subscription service | |
| US20230066582A1 (en) | Threshold multi-party computation with must-have member |
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 |