A data transaction dual-factor dynamic identity authentication method and system based on alliance chain

Abstract

The present invention discloses a data transaction dual-factor dynamic identity authentication method based on an alliance chain, comprising the following steps: when a transaction occurs between a user node and a counterparty node, judging whether the counterparty node is a first-time transaction based on a node transaction TRV record list containing a transaction trust evaluation value TRV; if the counterparty node is a first-time transaction, verifying the unique identity token UIT of the counterparty node, and after verification, entering the transaction link with the lowest tradable level; if the counterparty node is not a first-time transaction, determining the tradable level of this transaction based on the node transaction TRV record list, and entering the transaction link with the tradable level. The present invention also discloses a data transaction dual-factor dynamic identity authentication system based on an alliance chain. The present invention adopts a dual-factor identity authentication element to dynamically authenticate the identity transaction level, and guarantees the rights and interests of both parties to the data transaction and the reliability and convenience of the transaction on the basis of enhancing anonymity.

Description

Technical Field

[0001] The present invention relates to the field of blockchain technology, and in particular to a data transaction dual-factor dynamic identity authentication method and system based on an alliance chain. Background Art

[0002] With the advancement of the digital transformation of the entire society, massive amounts of data continue to be generated in the financial, administrative and other fields. The transaction of data as an asset has become a new business model, and the pursuit and mining of data value has become a general consensus in society. At present, the development of industries and technologies related to data transactions is in the early stages, and transactions are not standardized, procedural, or commercialized. In addition, data transactions have the characteristics of easy leakage, low transfer costs, WYSIWYG, large data scale, and timeliness, which puts higher requirements on the security of the data transaction process. Identity authentication, as the first procedure in the transaction process, is of great significance in stabilizing the transaction network and improving transaction security. At present, domestic data transaction control lacks practical and common transaction classification standards, and the accountability and error correction mechanism after the transaction lacks legal protection. Therefore, the existing data transaction operation mechanism advocates that the two parties to the transaction are registered members and reach a certain agreement before the transaction. In combination with the above transaction characteristics, introducing the alliance chain into data transactions and using the blockchain's anti-tampering and traceability characteristics to solve the identity security problem in the data transaction process has become an important research topic in the current context. Summary of the invention

[0003] The purpose of the present invention is to provide a data transaction two-factor dynamic identity authentication method and system based on alliance chain, which guarantees the rights and interests of both parties in data transaction and the reliability and convenience of transaction on the basis of enhancing anonymity.

[0004] In order to solve the above technical problems, the present invention provides a data transaction two-factor dynamic identity authentication method based on alliance chain, comprising the following steps:

[0005] When a transaction occurs between a user node and a counterparty node, the user node determines whether the counterparty node is the first transaction based on the node transaction TRV record list containing the transaction trust evaluation value TRV.

[0006] If the other party's node is a first-time trader, the unique identity token UIT of the other party's node will be verified. After the verification is passed, the transaction link with the lowest tradable level will be entered;

[0007] If the other party's node is not a first-time trader, the tradable level of this transaction will be determined based on the node transaction TRV record list, and the transaction link of this tradable level will be entered.

[0008] Preferably, if the counterparty node is not a first-time transaction, the tradable level of this transaction is determined according to the node transaction TRV record list, specifically including the following steps:

[0009] If it is not the first transaction with the other party's node, check whether the other party's node is in the blacklist;

[0010] If the other party's node is in the blacklist, obtain the transaction impact TIL of this transaction, and determine whether the transaction risk is within the safe range based on the transaction impact TIL of this transaction; if the transaction risk is not within the safe range, terminate the transaction; if the transaction risk is within the safe range, determine the tradable level of this transaction based on the node transaction TRV record list;

[0011] If the other party's node is not in the blacklist, the transaction level of this transaction is determined based on the node transaction TRV record list.

[0012] Preferably, determining the tradable level of this transaction according to the node transaction TRV record list specifically includes the following steps:

[0013] Obtain the transaction trust evaluation value TRV of the transaction TRV records of the other party's latest three transactions in the node transaction TRV record list;

[0014] Calculate the average ATRV based on the transaction trust evaluation value TRV of the other party's transaction TRV records of the last three transactions in the node's transaction TRV record list;

[0015] Determine the tradable level of this transaction based on the average ATRV and preset rules.

[0016] Preferably, obtaining the transaction impact TIL of the other party's node and judging whether the transaction risk is within a safe range according to the transaction impact TIL specifically include the following steps:

[0017] According to the blacklist, obtain the corresponding transaction records of the other node;

[0018] Compare the similarity between this transaction and the transaction record of the other party's node, and use the similarity as the transaction impact TIL of this transaction; if the transaction impact TIL of this transaction is greater than the maximum transaction impact threshold, it is judged that the transaction risk is not within a safe range; if the transaction impact TIL of this transaction is less than or equal to the maximum transaction impact threshold, it is judged that the transaction risk is within a safe range.

[0019] Preferably, a data transaction two-factor dynamic identity authentication method based on alliance chain also includes the following steps:

[0020] After the transaction is completed, determine whether the transaction is a safe transaction;

[0021] If this transaction is a safe transaction, the TRV record of this transaction will be added to the node transaction TRV record list;

[0022] If this transaction is a dangerous transaction, the transaction record will be added to the blacklist.

[0023] Preferably, the calculation formula of the transaction trust rating value TRV is:

[0024] TRV=(100 / i)*(∑T i )

[0025] Where: T i Represents the consistency of the i-th transaction behavior; i represents the total number of transactions.

[0026] Preferably, the encryption formula of the unique identity token UIT is:

[0027] UIT=e Hash1(I)Hash2(I) mod p

[0028] In the formula: e is a given random security parameter; p is a prime number; Hash1 is the first hash function; Hash2 is the second hash function; I is the autonomous encrypted identity information.

[0029] The present invention also provides a data transaction dual-factor dynamic identity authentication system based on alliance chain, comprising:

[0030] Initialization module, used for system initialization, initialization of encryption center and blacklist, deployment of smart contracts, and setting of data tradability level;

[0031] The judgment module is used to judge whether the other party's node is the first transaction based on the node transaction TRV record list when the user node and the other party's node have a transaction;

[0032] The verification module is used to verify the unique identity token UIT of the other party's node when it is the first transaction with the other party's node;

[0033] A setting module is used to enter the lowest tradable level of trading link during the first transaction;

[0034] The determination module is used to determine the tradable level of this transaction according to the node transaction TRV record list and enter the transaction link of the tradable level.

[0035] Compared with the prior art, the present invention has the following beneficial effects:

[0036] In the dual-factor dynamic identity authentication method for data transactions based on alliance chain disclosed by the present invention, the identity authentication method runs through the entire data transaction, gets rid of the defects of traditional identity authentication methods such as cumbersomeness and high calculation complexity, and adopts dual-factor identity authentication elements to dynamically authenticate the identity transaction level, which ensures the rights and interests of both parties to the data transaction and the reliability and convenience of the transaction on the basis of enhanced anonymity. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The specific implementation modes of the present invention are further described in detail below with reference to the accompanying drawings.

[0038] Figure 1 A model architecture diagram of a data transaction dual-factor dynamic identity authentication system based on alliance chain in the present invention;

[0039] Figure 2 Schematic diagram of blacklist initialization;

[0040] Figure 3 Schematic diagram of user node initialization;

[0041] Figure 4 Schematic diagram of the self-sovereign identity information encryption process;

[0042] Figure 5 Schematic diagram of the node transaction identity authentication process;

[0043] Figure 6 A schematic diagram of a flow chart of a data transaction dual-factor dynamic identity authentication method based on an alliance chain in the present invention. DETAILED DESCRIPTION

[0044] Many specific details are set forth in the following description to facilitate a full understanding of the present invention. However, the present invention can be implemented in many other ways than those described herein, and those skilled in the art can make similar generalizations without violating the connotation of the present invention, so the present invention is not limited to the specific implementation disclosed below.

[0045] The terms used in one or more embodiments of this specification are only for the purpose of describing specific embodiments, and are not intended to limit one or more embodiments of this specification. The singular forms of "a", "said" and "the" used in one or more embodiments of this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used in one or more embodiments of this specification refers to and includes any or all possible combinations of one or more associated listed items.

[0046] It should be understood that although the terms first, second, etc. may be used to describe various information in one or more embodiments of this specification, this information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of one or more embodiments of this specification, the first may also be referred to as the second, and similarly, the second may also be referred to as the first. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0047] The following is combined with Figure 1-6The present invention is further described in detail:

[0048] A data transaction two-factor dynamic identity authentication method based on alliance chain, comprising the following steps:

[0049] 1) Initialize the node transaction TRV record list and blacklist list;

[0050] The blacklist initialization structure is as follows Figure 2 As shown: The node transaction TRV record list initialization structure is as follows Figure 3 As shown;

[0051] 2) The user node submits the autonomous identity information and encrypts it to obtain the encrypted autonomous identity information;

[0052] 3) Generate a unique identity token UIT based on the encrypted self-determined identity information;

[0053] 4) When a transaction occurs between a user node and a counterparty node, determine whether the counterparty node is conducting the first transaction based on the node transaction TRV record list;

[0054] If the other party's node is conducting a transaction for the first time, proceed to step 5;

[0055] If the other party's node is not the first transaction, proceed to step 6;

[0056] 5) Verify the unique identity token UIT of the other node;

[0057] If the verification is successful, the tradable level is set to the lowest tradable level, and the transaction phase is entered, and step 11 is executed;

[0058] If verification fails, the transaction is rejected;

[0059] 6) Check whether the other node is in the blacklist;

[0060] If the other node is in the blacklist, go to step 7;

[0061] If the other node is not in the blacklist, go to step 9;

[0062] 7) Manually determine whether to continue the transaction; proceed to step 8;

[0063] Based on the transaction environment, for example, if the required data is only available on the other party’s node in the alliance chain, although the other party’s node is on the blacklist, you can still choose to continue the risky transaction and proceed to the subsequent step 8 TIL judgment.

[0064] 8) Obtain the transaction impact TIL of the other party's node, and determine whether the transaction risk is within the safe range based on the transaction impact TIL;

[0065] If the transaction risk is not within the safe range, terminate the transaction;

[0066] If the transaction risk is within the safe range, proceed to step 9;

[0067] 9) Obtain the transaction trust evaluation value TRV of the transaction TRV records of the other party's latest three transactions in the node transaction TRV record list, and execute step 10;

[0068] 10) Calculate the average value ATRV of the transaction trust evaluation value TRV of the transaction TRV records of the other party node in the node transaction TRV record list for the three most recent transactions, determine the tradable level of this transaction based on the average value ATRV, and execute step 11;

[0069] If the node transaction TRV record list contains less than three records of the other node, then add up all the transaction trust evaluation values ​​TRV of the other node and divide it by 3 to obtain the average value ATRV;

[0070] For example, if there is only one transaction trust evaluation value TRV, and TRV=80, then ATRV=(80+0+0) / 3.

[0071] 11) Enter the transaction phase according to the tradable level and execute step 12;

[0072] 12) After the transaction is completed, the transaction trust value TRV of this transaction is calculated to determine whether this transaction is a safe transaction;

[0073] If the transaction is a safe transaction, the TRV record of the transaction will be added to the node transaction TRV record list; the transaction TRV record includes the transaction trust evaluation value TRV, transaction node, data type and other information;

[0074] If this transaction is a dangerous transaction, the transaction record will be added to the blacklist; the transaction record contains information such as the other party's node number and transaction time.

[0075] The node transaction TRV record list is used to determine whether it is the first transaction of the user node in step 4, and to obtain the transaction trust evaluation value TRV of the transaction TRV records of the other party node's latest three transactions in step 9.

[0076] In this embodiment, based on the alliance chain data transaction two-factor dynamic identity authentication method, the user node is authenticated through blacklist authentication and TRV authentication, the first authentication factor is the blacklist, and the second authentication factor is TRV. The identity authentication for each round of transactions depends on the blacklist list in the alliance chain network and the trust evaluation records of the latest three transactions. The first time a node in the alliance chain network participates in a transaction, it is also necessary to perform a unique identity token UIT authentication. The unique identity token UIT authentication is the entry and basic link of the two-factor dynamic identity authentication.

[0077] UIT authentication: For the first transaction, the user node only needs to verify its unique identity token in the alliance chain network. If the token verification is successful, the identity authentication is successful, and the lowest level data transaction can be carried out; if the token verification fails, the identity authentication of the first transaction fails, and the next step of the data transaction process cannot be carried out.

[0078] Blacklist authentication: For non-initial transactions, the user node does not need to verify the unique identity token again before the transaction. First, query the blacklist list in the alliance chain network. If the other party's node is on the blacklist, you can choose to terminate the transaction or make a transaction influence level TIL (TIL, Transaction Influence Level) judgment. Choosing to terminate the transaction means that the identity authentication fails and the node exits the transaction.

[0079] In this embodiment, after each round of transactions, the nodes of both parties evaluate each other. According to the transaction behaviors and performances of both parties in the data transaction process, and with reference to a specific trust evaluation scheme, the trust evaluation value of the other party's node is given. This trust evaluation value is the transaction trust evaluation value TRV of the latest transaction, which is one of the values ​​for the next round of transactions. When a node determines that the trust evaluation value TRV of the other party's node is -1, it means that the other party's node is added to the blacklist. When the blockchain network publishes the blacklist, it should also publish data and information summaries related to the dishonest transaction. After passing the node consensus, the blacklist will be written into the block. Among them, the data structure of the blacklist and the transaction TRV record list are as follows: Figure 5 as shown in .

[0080] In a preferred embodiment, the transaction impact level TIL of the user node is obtained, and whether the transaction risk is within a safe range is determined according to the transaction impact level TIL, specifically including the following steps:

[0081] According to the blacklist, obtain the corresponding transaction records of the other node;

[0082] Compare the similarity between this transaction and the transaction record of the other party's node, and use the similarity as the transaction impact TIL of this transaction; if the transaction impact TIL of this transaction is greater than the maximum transaction impact threshold, it is judged that the transaction risk is not within a safe range; if the transaction impact TIL of this transaction is less than or equal to the maximum transaction impact threshold, it is judged that the transaction risk is within a safe range.

[0083] In a preferred embodiment, the maximum threshold of transaction impact is 50%.

[0084] In this embodiment, the transaction impact TIL judgment is selected, and the historical transaction records in the alliance chain network are traced according to the blacklist information. The historical transaction records contain data transaction indexes, including transaction data type, data volume, payment method and other information. The transaction impact judgment is selected to trigger the smart contract, call the chain code, and compare the similarity between the blacklist and the pre-transaction data information. The higher the similarity, the greater the transaction impact, and vice versa. The two are inversely proportional. Assuming that 50% is the maximum threshold of transaction impact, when the similarity between the historical transaction record and the pre-transaction data information, that is, the transaction impact, is ≤50%, it means that the risk of this data transaction is within an acceptable range, and the trust assessment record value can be taken for the second factor assessment; when the similarity, that is, the transaction impact, is ≥50%, it means that there is a risk in this data transaction, and the verification node needs to terminate the transaction.

[0085] In a preferred embodiment, the trust rating value TRV is given by the transaction behavior of the user node and the counterparty node after the transaction is completed. The transaction behavior includes: consistency of bid price, consistency of transaction data volume, consistency of data supply and demand, and consistency of transaction time (estimated transaction completion time and actual transaction completion time). The transaction behavior may be adjusted according to the specific type of alliance chain.

[0086] TRV=(100 / i)*(∑T i )

[0087] Where: T i Represents the consistency of the i-th transaction behavior; i represents the total number of transactions.

[0088] For example:

[0089] Consistency of bid price T1: 100%;

[0090] Transaction data volume consistency T2: 80%;

[0091] Data supply and demand consistency T3: 90%;

[0092] Transaction time consistency T4: 100%

[0093] TRV=25*(100%+80%+90%+100%)=92.5;

[0094] 92.5∈(76, 100], a level 4 transaction can be traded under the following preset rules.

[0095] In a preferred embodiment, determining whether the transaction is a safe transaction specifically includes the following steps:

[0096] After the transaction is completed, determine whether the transaction behavior of the other party's node has caused serious loss of interests to the user's node;

[0097] If it is judged to cause serious loss of interests, the transaction trust value TRV is set to -1, and the transaction record of this transaction is added to the blacklist and written into the alliance chain network;

[0098] If it is determined that no serious loss of interests has been caused, the transaction trust evaluation value TRV≠-1, and the TRV record of this transaction is added to the node transaction TRV record list.

[0099] In this embodiment, the Trust Rating Vaule (TRV) authentication is the second factor authentication phase after the first factor authentication. In the alliance chain network, the trust rating value of the other party's latest three data transactions is taken, and the average value of the three evaluation values ​​ATRV (ATRV) is used as the second factor parameter of the transaction identity authentication in this round. The tradable level of the user node and the other party node is determined by the obtained ATRV and the preset rules.

[0100] Assume the default rules are:

[0101] Transaction level 1: ATRV∈[0, 25], ordinary data transaction, the transaction index data volume does not exceed 2M;

[0102] Transaction level 2: ATRV∈(25,50], ordinary data transaction, the transaction index data volume does not exceed 10M;

[0103] Transaction level 3: ATRV∈(50,75], encrypted data transaction, transaction index data volume does not exceed 2M;

[0104] Transaction level 4: ATRV∈(75, 100], encrypted data transaction, transaction index data volume does not exceed 10M;

[0105] Transaction nodes a and b (user node and counterparty node), average trust evaluation value ATRV of a a =30, the average trust evaluation value ATRV of b b=60, then after identity authentication, the transaction level between the two is ordinary data transaction, and the lower transaction level that both transaction nodes meet is taken. The completion of the blacklist list and trust assessment authentication means that the identity authentication is completed, and the next stage of data transaction can be entered.

[0106] In the two-factor dynamic identity authentication method for data transactions based on the alliance chain, the two-factor authentication method is the same in each round of data transactions, but the authentication parameters are dynamically changed.

[0107] The blacklist list may change after each round of transactions, which will affect the first factor authentication in the next round of data transactions; the average value ATRV is used in the last step of the two-factor dynamic identity authentication method, and is obtained based on the trust rating value TRV of the transaction node's latest three transaction records. This parameter is very likely to change with the increase in the number of transactions, and its value change will affect the second factor authentication in the next round of data transactions of the node.

[0108] In the dynamic identity authentication method, identity authentication runs through the entire data transaction process, and dishonest trading behaviors such as fraud, inconsistent bid and sale prices in each round of transactions may affect the node's next transaction identity. This not only provides an anonymous and reliable identity authentication method that meets actual market needs, but also can largely constrain the behavior of transaction nodes, further standardize the data transaction market, and provide a new idea for the compliant and legal development of Data Trading 2.0.

[0109] Evaluation of both parties to the transaction:

[0110] After each round of transactions, the nodes of both parties evaluate each other. According to the transaction behaviors and performances of both parties during the data transaction, and with reference to a specific trust evaluation scheme, the trust evaluation value of the other party’s node is given. This trust evaluation value is the TRV of the latest transaction record, which is one of the values ​​for the next round of transactions. When the TRV of the other party’s transaction is -1, it means that the other party’s node is added to the blacklist. When the blacklist is published on the blockchain network, the data and information summary related to the dishonest transaction should also be published. After the node consensus is passed, the blacklist will be written into the block. Among them, the data structure of the blacklist and the transaction TRV record list is as follows: Figure 5 as shown in .

[0111] In a preferred embodiment, the encryption formula of the unique identity token UIT is:

[0112] UIT=e Hash1(I)Hash2(I) mod p

[0113] In the formula: e is a given random security parameter; p is a prime number; Hash1 is the first hash function; Hash2 is the second hash function; I is the autonomous encrypted identity information.

[0114] In this embodiment, the user nodes (AP, Application Peers) applying to join the chain need to submit detailed organization or personal information during the registration process, but not all of this information is used for encryption. Only part of the submitted information involving sensitive information of the node or information that the user agrees to mark as an encryption element is encrypted to generate a unique identity token. The security of this model based on autonomous identity encryption technology is built on the problem that CDH is difficult to solve. The autonomous identity information encryption process is as follows Figure 4 As shown in the figure, generating a unique identity token (UIT) for a consortium chain network is divided into three stages: preparation stage, encryption stage, and token distribution and chain stage.

[0115] (1) Preparation phase (e, p) → α, β: The node submits its self-encrypted identity information I, and the encryption center (EC) gives the random security parameter e, the prime number p, and the hash functions Hash1 and Hash2:

[0116] α=e Hash1(I) ;

[0117] β=e Hash2(I) ;

[0118] (2) Encryption phase (α, β) → UIT: Encryption, generate the user node unique identity token UIT, the unique identity token UIT in the alliance chain network uniquely identifies and authenticates the user node:

[0119] UIT=e Hash1(I)Hash2(I) mod p;

[0120] (3) Token distribution and on-chain stage:

[0121] Distribution: The registered encrypted unique identity token is sent by the encryption center to the node applying for joining the chain through a secure channel;

[0122] On-chain: The encryption center will publish the generated unique identity token to the alliance chain network and write it into the block after node consensus.

[0123] The present invention also provides a data transaction dual-factor dynamic identity authentication system based on alliance chain, comprising:

[0124] Initialization module, used for system initialization, initialization of encryption center and blacklist, deployment of smart contracts, and setting of data tradability level;

[0125] The encryption module is used to encrypt the autonomous identity information submitted by the user node and generate a unique identity token UIT;

[0126] The judgment module is used to judge whether the other party's node is the first transaction based on the node transaction TRV record list when the user node and the other party's node have a transaction;

[0127] The verification module is used to verify the unique identity token UIT of the other party's node when it is the first transaction with the other party's node;

[0128] A setting module for setting the tradable level of the initial transaction to the minimum transaction level;

[0129] The determination module is used to determine the tradable level of this transaction according to the transaction trust evaluation value TRV in the node transaction TRV record list.

[0130] In the several embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the modules, modules or units is only a logical function division, and there may be other division methods in actual implementation, for example, multiple units, modules or components can be combined or integrated into another device, or some features can be ignored or not executed.

[0131] The units may or may not be physically separated, and the components displayed as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0132] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0133] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part, and / or installed from a removable medium. When the computer program is executed by the central processing unit (CPU), the above-mentioned functions defined in the method of the present invention are executed. It should be noted that the above-mentioned computer-readable medium of the present invention can be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, a system, device or device of an electrical, magnetic, optical, electromagnetic, infrared segment, or semiconductor, or any combination of the above.

[0134] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0135] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A two-factor dynamic identity authentication method for data transactions based on alliance chain, characterized in that: The following steps are involved: When a transaction occurs between a user node and a counterparty node, the user node determines whether the counterparty node is the first transaction based on the node transaction TRV record list containing the transaction trust evaluation value TRV. If the other party's node is a first-time trader, the unique identity token UIT of the other party's node will be verified. After the verification is passed, the transaction link with the lowest tradable level will be entered; If the other party's node is not the first transaction, check whether the other party's node is in the blacklist; If the other party's node is in the blacklist, the transaction impact TIL of this transaction is obtained, and the transaction risk is judged whether it is within the safe range according to the transaction impact TIL of this transaction; if the transaction risk is not within the safe range, the transaction is terminated; if the transaction risk is within the safe range, the tradable level of this transaction is determined according to the node transaction TRV record list; If the other party's node is not in the blacklist, the transaction level of this transaction is determined based on the node transaction TRV record list; Determine the tradable level of this transaction according to the node transaction TRV record list, specifically including the following steps: obtain the transaction trust evaluation value TRV of the transaction TRV records of the other party's latest three transactions in the node transaction TRV record list; calculate the average value ATRV according to the transaction trust evaluation value TRV of the transaction TRV records of the other party's latest three transactions in the node transaction TRV record list; determine the tradable level of this transaction according to the average value ATRV and preset rules; The calculation formula of the transaction trust value TRV is: TRV=(100 / i)*(∑T i ) Where: T i represents the consistency of the i-th transaction behavior; i represents the total number of transactions; The encryption formula of the unique identity token UIT is: OUT=e Hash1(I)Hash2(I) modp Wherein: e is a given random security parameter; p is a prime number; Hash1 is the first hash function; Hash2 is the second hash function; I is the autonomous encrypted identity information.

2. According to claim 1, a data transaction dual-factor dynamic identity authentication method based on alliance chain is characterized in that: Obtain the transaction impact TIL of the other party's node, and determine whether the transaction risk is within the safe range based on the transaction impact TIL. The specific steps include: According to the blacklist, obtain the corresponding transaction records of the other node; Compare the similarity between this transaction and the transaction record of the other party's node, and use the similarity as the transaction impact TIL of this transaction; if the transaction impact TIL of this transaction is greater than the maximum transaction impact threshold, it is judged that the transaction risk is not within a safe range; if the transaction impact TIL of this transaction is less than or equal to the maximum transaction impact threshold, it is judged that the transaction risk is within a safe range.

3. According to claim 1, a data transaction dual-factor dynamic identity authentication method based on alliance chain is characterized in that: A data transaction two-factor dynamic identity authentication method based on alliance chain also includes the following steps: After the transaction is completed, determine whether the transaction is a safe transaction; If this transaction is a safe transaction, the TRV record of this transaction will be added to the node transaction TRV record list; If this transaction is a dangerous transaction, the transaction record will be added to the blacklist.

4. A data transaction two-factor dynamic identity authentication system based on alliance chain that implements the data transaction two-factor dynamic identity authentication method based on alliance chain according to any one of claims 1 to 3, characterized in that: include: A judgment module, used to judge whether the other party node is the first transaction according to the node transaction TRV record list containing the transaction trust evaluation value TRV when the user node and the other party node have a transaction; The verification module is used to verify the unique identity token UIT of the other party's node when it is the first transaction with the other party's node; A setting module is used to enter the lowest tradable level of trading link during the first transaction; The determination module is used to determine the tradable level of this transaction according to the node transaction TRV record list and enter the transaction link of the tradable level.

Images