Adaptive construction method, device and equipment of anonymous link and storage medium

Abstract

The application relates to the technical field of anonymous communication, and discloses an adaptive construction method and device of an anonymous link, equipment and a storage medium, which comprise the following steps: acquiring all relay node information in an anonymous system; performing correlation degree analysis on the relay node information to obtain the correlation between the relay nodes; extracting the relay node information to identify a node family; calculating the node superiority of each relay node, establishing a node priority list based on the node superiority; and determining the anonymous link corresponding to each relay node based on the node family and the node priority list. The application improves the implementation mechanism of anonymous system family mining, provides a basis for the optimization of link selection by acquiring and analyzing the past behavior information of the relay nodes according to the node operation law and the bandwidth and stability performance, eliminates the risk nodes, and performs adaptive link selection according to the node score, so that the efficiency and reliability of the communication link are improved, and the security of node selection is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of anonymous communication technology, in particular to an adaptive construction method, device and equipment of anonymous link and storage medium. BACKGROUND

[0002] Tor (The Onion Router) anonymous communication system is the most successful public anonymous communication service in the Internet directory server, which is favored by many users and researchers in the field of anonymous communication due to its low delay, directory service, simple configuration and other characteristics. With the growing demand of Internet users for anonymous communication, the number of nodes accessing the Tor network is also increasing. When users run Tor, nodes act as relay nodes to join the Tor network to achieve anonymity, and also provide bandwidth for the Tor network. On the one hand, the more Tor clients run, the more relay nodes the user is hidden in, and the faster and safer the Tor network will be; on the other hand, with the increase of Tor relay number, malicious nodes join the Tor network and engage in malicious or even illegal behavior according to the anonymity characteristics of Tor network. Therefore, it is particularly important to analyze the risk nodes by counting the activity data of each node in the Tor network to reduce the damage caused by malicious behavior.

[0003] In the related art, there are currently more than 7000 relay nodes active in the Tor network every day, and the stability, bandwidth and security provided by each node are different. Due to the random routing algorithm of Tor, low stability, low bandwidth or even risky relay nodes may be selected in the link establishment process, and high stability, high bandwidth and safe nodes may also be selected. This random selection mode limits the maximum role of high-quality nodes to some extent, and also increases the risk of malicious nodes being selected. At the same time, the Tor system lacks a complete evaluation system for relay nodes joining the Tor network, and users cannot distinguish the relay nodes providing services. SUMMARY

[0004] Therefore, the present application provides an adaptive construction method, device and equipment of anonymous link and storage medium to solve the problem of difficult security guarantee of relay nodes in the anonymous system.

[0005] In a first aspect, the present application provides an adaptive construction method of anonymous link, which comprises:

[0006] Obtaining all relay node information in the anonymous system;

[0007] Performing correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes;

[0008] Based on the correlation relationship, extracting the relay node information to identify the node family;

[0009] Based on the relay node information and the association relationship, the node superiority of each relay node is calculated, and a node priority list is established based on the node superiority;

[0010] Based on the node family and the node priority list, the anonymous link corresponding to each relay node is determined.

[0011] In the present application, by improving the implementation mechanism of the anonymous system family mining, a new node association and malicious family discovery method is proposed, by obtaining and analyzing the past behavior information of the relay node, according to the node running law and the bandwidth, stability performance, the superiority level is calculated according to the multi-dimensional evaluation model, which provides the basis for the optimization of link selection, through the adaptive dynamic routing algorithm based on bandwidth, stability weighted random selection, the risk nodes are eliminated, the adaptive link selection is carried out according to the node score, so as to improve the efficiency and reliability of the communication link, and the security of node selection is improved.

[0012] In an optional embodiment, the association degree of the relay node information is analyzed to obtain the association relationship between the relay nodes, including:

[0013] The fingerprint is used as the unique identifier of each relay node, the repeated attribute values of the consensus file, the relay descriptor file, the bandwidth file and the exit information file in the relay node information are analyzed and screened based on the information of the fingerprint, the association relationship between the relay nodes is established, and the bandwidth information of each relay node is obtained.

[0014] In this way, the relay node is identified through node association relationship analysis, a new node association method is proposed, and the security of the anonymous system is improved to prevent hidden malicious families from destroying the anonymous link.

[0015] In an optional embodiment, based on the association relationship, the relay node information is extracted to identify the node family, including:

[0016] Through the connected subset discovery algorithm, the family relationship between the current relay node and the next relay node is identified based on the association relationship;

[0017] When there is a family bidirectional declaration between the current relay node and the next relay node, or when there is a family declaration between the current relay node and the next relay node and only one of them, or when there is an indirect family declaration between the current relay node and the next relay node, it is determined that there is a node family relationship between the current relay node and the next relay node;

[0018] Based on the bandwidth information, when the current relay node does not have a family declaration and the current relay node falsely reports the bandwidth, the current relay node is determined as a risk node.

[0019] In this way, the malicious family discovery method is proposed, the security of the anonymous network is improved, the hidden malicious family is prevented from destroying the anonymous link, the malicious node is found and removed, the malicious node is found in time, the risk is avoided in subsequent link selection, and information leakage and attack behaviors are prevented.

[0020] In an optional implementation, the node superiority of each relay node is calculated based on the relay node information and the association relationship, including:

[0021] Based on the relay node information and the bandwidth information, the current performance score of the current relay node is calculated in combination with the past behavior information of the current relay node;

[0022] According to the current performance score, the superiority score of the current relay node is calculated in combination with the historical superiority score of the current relay node;

[0023] The delay proportion of the current relay node is obtained;

[0024] According to the score calculation model, the node superiority of the current relay node is calculated in combination with the superiority score and the delay proportion.

[0025] In this way, by obtaining and analyzing the past behavior information of the relay node, the superiority level is calculated according to the multi-dimensional evaluation model according to the node running rule and the bandwidth and stability performance, the performance of the anonymous network is improved, and the superior node fully plays a role in the Tor link. At the same time, the high-quality node is obtained according to the node superiority, and the use efficiency of the high-quality node is improved.

[0026] In an optional implementation, the anonymous link corresponding to each relay node is determined, including:

[0027] The relay node with the highest node priority and not belonging to the same family as the current relay node is selected as the next relay node;

[0028] When there are several relay nodes with the same node priority, the Gini coefficient of the frequency of using each next relay node by the client is calculated;

[0029] It is judged whether the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold;

[0030] When the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold, the node weight under the node label corresponding to the Gini coefficient of the next relay node is reduced, and the anonymous link corresponding to the current relay node is constructed.

[0031] In the mode, an adaptive dynamic routing algorithm based on bandwidth, stability weighted random selection is proposed to improve the defects of the Tor network routing algorithm in user anonymity security and performance, and realize the dynamic of link construction. The link selection process dynamically selects high bandwidth, stable and low risk nodes to improve the security and performance of Tor link.

[0032] In an optional implementation, the method further includes:

[0033] The relay node information, bandwidth information and node priority list are visually displayed to construct a node data management system.

[0034] In the mode, a visual system is provided to realize that a user can view the running status of each node on the current Tor network and the node data in each dimension, the user can understand the change trend of each node in each dimension on the Tor network, and the use experience is further improved.

[0035] In a second aspect, the present application provides an adaptive construction device of an anonymous link, the device comprising:

[0036] A node information acquisition module is configured to acquire all relay node information in an anonymous system.

[0037] A node correlation analysis module is configured to analyze the correlation of the relay node information to obtain the correlation between the relay nodes.

[0038] A node family identification module is configured to extract the relay node information based on the correlation to identify a node family.

[0039] A node superiority calculation module is configured to calculate the node superiority of each relay node based on the relay node information and the correlation, and establish a node priority list based on the node superiority.

[0040] An anonymous link construction module is configured to determine the anonymous link corresponding to each relay node based on the node family and the node priority list.

[0041] In a third aspect, the present application provides a computer device comprising a memory and a processor, which are communicatively connected to each other, and the memory stores computer instructions, and the processor executes the computer instructions to perform the adaptive construction method of the anonymous link of the first aspect or any of the corresponding embodiments thereof.

[0042] In a fourth aspect, the present application provides a computer readable storage medium, which stores computer instructions for causing a computer to perform the adaptive construction method of the anonymous link of the first aspect or any of the corresponding embodiments thereof.

[0043] In a fifth aspect, the present application provides a computer program product comprising computer instructions for causing a computer to perform the adaptive construction method of an anonymous link according to the first aspect or any of its possible implementation forms. BRIEF DESCRIPTION OF DRAWINGS

[0044] In order to more clearly illustrate the specific embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the specific embodiments or prior art description will be briefly introduced as follows. Obviously, the drawings in the following description are some embodiments of the present application, and other drawings can also be obtained by those skilled in the art without creative labor on the basis of these drawings.

[0045] Figure 1 is a schematic diagram of the working principle of Tor according to an embodiment of the present application.

[0046] Figure 2 is a flowchart of the adaptive construction method of an anonymous link according to an embodiment of the present application.

[0047] Figure 3 is a flowchart of another adaptive construction method of an anonymous link according to an embodiment of the present application.

[0048] Figure 4 is a schematic diagram of node association analysis according to an embodiment of the present application.

[0049] Figure 5 is a flowchart of still another adaptive construction method of an anonymous link according to an embodiment of the present application.

[0050] Figure 6 is a data flow diagram of a Tor node data management system according to an embodiment of the present application.

[0051] Figure 7 is a schematic diagram of the display of the bandwidth and stability of a certain node on a Tor network according to an embodiment of the present application.

[0052] Figure 8 is a schematic diagram of a node priority list according to an embodiment of the present application.

[0053] Figure 9 is a schematic diagram of node information retrieval according to an embodiment of the present application.

[0054] Figure 10 is a schematic diagram of detailed node information according to an embodiment of the present application.

[0055] Figure 11 is a structural block diagram of an adaptive construction device of an anonymous link according to an embodiment of the present application.

[0056] Figure 12 Fig. 1 is a schematic diagram of a hardware structure of a computer device according to an embodiment of the present application. DETAILED DESCRIPTION

[0057] In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some but not all of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present application.

[0058] Figure 1 Fig. 1 is a schematic diagram of a Tor working principle according to an embodiment of the present application, and the specific working principle of a client and a server in Tor network communication is as shown in Fig. 1. The specific working process of a client communicating with a target server once is as follows:

[0059] (1) A user starts a Tor client, which first sends a request to a directory server in a Tor network. The directory server sends all relay nodes available on the current Tor network and the corresponding public key list to the client. This process is encrypted.

[0060] (2) The client selects a route according to the relay list information. The list provides node flag information identifying a Guard and an Exit. The random routing algorithm of Tor selects an entry node in the Guard-identified node and an exit node in the Exit-identified node according to the node flag information. The probability of random selection is determined according to the weight of the reported bandwidth of the node in the total bandwidth.

[0061] (3) After the client selects three-hop relay nodes, the client obtains session key information of the three-hop nodes, and establishes an anonymous communication link containing the relay nodes according to the IP address and other identity information of the relay nodes for encrypted transmission.

[0062] (4) The client initiates a request to the target server, and at the same time, the content of the request to be sent is encrypted layer by layer like an onion package, that is, the content is encrypted in turn using the session keys of the three-hop nodes from far to near. The entry node uses the key to decrypt the outermost layer to obtain the node information of the next hop, and then forwards the next layer of encrypted information data to the intermediate node. The intermediate node decrypts and forwards it to the exit node. Finally, the exit node decrypts the innermost layer to obtain the plaintext request content to the target server. Only the transmission connection between the exit node and the target server is not encrypted.

[0063] (5) The target server receives the original request information data, replies content to the user, and the content is encrypted layer by layer when passing through each node in the returning process, and finally encrypted information is returned to the client, and a complete communication is completed.

[0064] In the related art, at present, about 7000 relay nodes are active on the Tor network every day, and the stability, bandwidth provided and security of each node are different. Due to the random routing algorithm of Tor, low stability, low bandwidth or even risky relay nodes may be selected in the link establishment process, and high stability, high bandwidth and safe nodes may also be selected, and the random selection mode limits the maximum role of high-quality nodes to a certain extent, and also increases the risk of malicious nodes being selected. Meanwhile, the Tor system lacks a complete evaluation system for the relay nodes joining the Tor network, and users cannot distinguish the relay nodes providing services.

[0065] To solve the above problems, an adaptive construction method of an anonymous link is provided in the embodiment of the application, which is used in a computer device. It should be noted that the execution subject can be an adaptive construction device of an anonymous link, which can be realized by software, hardware or a combination of software and hardware to become part or all of the computer device. The computer device can be a terminal or a client or a server. The server can be a server or a server cluster composed of multiple servers. The terminal in the embodiment of the application can be a smart phone, a personal computer, a tablet computer or other smart hardware devices. In the following method embodiment, the execution subject is taken as an example of a computer device.

[0066] The computer device in the embodiment is suitable for the use scenario of strengthening the anonymity and security of the communication process in the Tor anonymous communication system. The adaptive construction method of the anonymous link is provided in the application, a new node association and malicious family discovery method is proposed by improving the implementation mechanism of the anonymous system family mining, the past behavior information of the relay node is obtained and analyzed, the superiority level is calculated according to the node running law and bandwidth and stability performance according to the multi-dimensional evaluation model, and the basis for the optimization of link selection is provided. The adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection is used to eliminate the risk nodes, the adaptive link selection is performed according to the node score, the efficiency and reliability of the communication link are improved, and the security of the node selection is improved.

[0067] According to the embodiment of the application, an adaptive construction method of an anonymous link is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0068] In the embodiment, an adaptive construction method of an anonymous link is provided, which can be used for the computer device, Figure 2 is a flowchart of the adaptive construction method of the anonymous link according to the embodiment of the application, as Figure 2 shown, the flowchart includes the following steps:

[0069] In step S201, all relay node information in an anonymous system is acquired.

[0070] In step S202, correlation degree analysis is performed on the relay node information to obtain a correlation relationship between the relay nodes.

[0071] In an example, by analyzing and screening repeated attribute values in a file correlation process, data requirements of the CollecTor module are mainly concentrated in consensus files consensus-microdesc, bandwidth files bandwidths of sbws measurement versions, and exit information files exit-lists.

[0072] In step S203, the relay node information is extracted based on the correlation relationship, and a node family is identified.

[0073] In an example, Tor regards multiple nodes operated by the same user or institution as a node family, and avoids using multiple nodes from the family in the same link during link selection to ensure the anonymity of the link. Since the Tor family is determined by mutual declaration between nodes, a malicious node provider will avoid declaring malicious nodes in the same family, resulting in the emergence of a hidden family and causing a huge potential threat to the anonymity of the Tor network.

[0074] Therefore, direct or indirect, single or bidirectional family declarations between Tor nodes should be regarded as valid family declarations, and the Tor node family is extracted by means of a general algorithm related to a vertex-edge graph. Each node family can be regarded as a connected subset in the node declaration graph.

[0075] In step S204, node superiority of each relay node is calculated based on the relay node information and the correlation relationship, and a node priority list is established based on the node superiority.

[0076] In step S205, an anonymous link corresponding to each relay node is determined based on the node family and the node priority list.

[0077] In an example, according to the analysis of the hidden node family and the calculation of the node superiority, in the link selection, the node with high superiority in different families is preferentially selected, and the Gini coefficient node label-based anonymity option is set for the anonymous node group with high superiority, so as to reduce the probability of frequently selecting some popular nodes in the routing process. The Gini coefficient selects a random number in (0, 1), and in the link selection, the Gini coefficient of the node frequency used by the client is first calculated to judge the node selection anonymity in the current network. When the calculated value exceeds the set threshold, the weight of the node under the label is reduced, so as to realize the dynamic routing selection.

[0078] The adaptive construction method of the anonymous link provided by the embodiment improves the implementation mechanism of the anonymous system family mining, proposes a new node association and malicious family discovery method, obtains and analyzes the past behavior information of the relay node, calculates the superiority level according to the node operation law and the bandwidth and stability performance, and provides a basis for the optimization of the link selection according to the multi-dimensional evaluation model. Through the adaptive dynamic routing algorithm based on the bandwidth and stability weighted random selection, the risk nodes are removed, the adaptive link selection is performed according to the node score, the efficiency and reliability of the communication link are improved, and the security of the node selection is improved.

[0079] In the embodiment, an adaptive construction method of an anonymous link is provided, which can be used for the computer device described above, Figure 3 is a flowchart of another adaptive construction method of an anonymous link according to an embodiment of the application, as shown in the figure, and the flowchart includes the following steps: Figure 3

[0080] In step S301, the information of all relay nodes in the anonymous system is obtained. For details, refer to step S201 in the embodiment shown in Figure 2 The details are not described here.

[0081] In step S302, the correlation degree of the relay node information is analyzed to obtain the correlation between the relay nodes.

[0082] Specifically, the above step S302 includes:

[0083] In step S3021, the fingerprint is used as the unique identifier of each relay node, the repeated attribute values of the consensus file, the relay descriptor file, the bandwidth file and the exit information file in the relay node information are analyzed and screened based on the information of the fingerprint, the correlation between the relay nodes is established, and the bandwidth information of each relay node is obtained.

[0084] In an example, Figure 4 is a schematic diagram of node association analysis according to an embodiment of the application, as shown in Figure 4 ​As shown, the fingerprint is the unique identifier of the node, which becomes the link between various files and the basis for collecting and processing horizontal information of the node. The specific analysis of the associated attributes in the figure is as follows:

[0085] (1) In the consensus file consensus-microdesc, the finger fingerprint information of the relay node is not directly provided, i.e. it cannot be directly associated with other files to establish a node, but the hash value of the identity key identity is provided, and the fingerprint information of the node can be calculated through the relationship between the two. identity is the base64 encoding of finger, and the equal sign at the end is deleted, so after filling the identity symbol, the base64 data block conversion and decoding can obtain the fingerprint information.

[0086] (2) The Bandwidth attribute provided in the consensus file consensus-microdesc and the consensus_bandwidth attribute provided in the bandwidth file bandwidths of the sbws measurement version have the same meaning, which are consensus bandwidth values. The difference is that the Bandwidth attribute value is in KB / s, and the consensus_bandwidth data value is in Bytes / s. The consensus bandwidth is an important basis for route selection in the link establishment process.

[0087] (3) The bandwidth_avg attribute provided in the server-descriptors file and the desc_bw_avg attribute value provided in the bandwidth file bandwidths of the sbws measurement version are the same, which identify the average bandwidth value, i.e. the bandwidth value that the relay can maintain for a long time. The server descriptor file constantly updates the latest bandwidth value and archives the nodes according to the bandwidth file, which updates the bandwidth value multiple times per hour and generates a file to save it, which can record the consensus bandwidth information of the node each time.

[0088] (4) The association relationship is the same as (3), both of which provide burst bandwidth information, i.e. the bandwidth value that the relay can maintain for a short time.

[0089] (5) The bw attribute provided in the bandwidth file of the sbws measurement version and the bw attribute provided in the torflow measurement version remain the same level, although the measurement time is different, but the measurement results of adjacent time are similar.

[0090] In summary, through the analysis and screening of repeated attribute values in the file association process, the data requirements of the CollecTor module are mainly concentrated in the consensus file consensus-microdesc, the bandwidth file bandwidths of the sbws measurement version, and the exit information file exit-lists.

[0091] In this way, the relay node is identified through the node association relationship analysis, a new node association method is proposed, the security of the anonymous system is improved, and the hidden malicious family is prevented from destroying the anonymous link.

[0092] In step S303, the relay node information is extracted based on the association relationship, and the node family is identified.

[0093] Specifically, the above step S303 includes:

[0094] In step S3031, the family relationship between the current relay node and the next relay node is identified based on the association relationship through the connected subset discovery algorithm.

[0095] In step S3032, when there is a family bidirectional declaration between the current relay node and the next relay node, or when there is a family declaration between the current relay node and the next relay node and only one of them, or when there is an indirect family declaration between the current relay node and the next relay node, it is determined that there is a node family relationship between the current relay node and the next relay node.

[0096] In step S3033, based on the bandwidth information, when the current relay node does not exist family declaration and the current relay node falsely reports the bandwidth, it is determined that the current relay node is a risk node.

[0097] In an example, Tor regards multiple nodes operated by the same user or institution as a node family, and avoids using multiple nodes from the same family in the same link during link selection to ensure the anonymity of the link. Since the Tor family is determined by the mutual declaration between nodes, malicious node providers will avoid declaring malicious nodes in the same family, causing the emergence of hidden families, which poses a huge potential threat to the anonymity of the Tor network.

[0098] Let the node set in the Tor network be M, and for any node m∈M, F(m)={m'∈M|m's family declaration has node m'}. If node m does not make any family declaration, then Accordingly, node m i has the following relationships with m j :

[0099] (1) Node m i and m j have direct family bidirectional declaration.

[0100] (2) Node m i and m jThere is a direct family declaration (only one of them) between m and m.

[0101] (3) m i ~ m j There is an indirect family declaration between m and m. i There is an indirect family declaration between m and m. j There is an indirect family declaration between m and m.

[0102] From the above classification, it can be seen that, There is an indirect family declaration between m and m. i ~ m j These relationships are symmetrical and can satisfy the following derivation: That is, even if two nodes do not have mutual family declarations, they can still be associated through other nodes in the same family. Therefore, direct or indirect, single or bidirectional family declarations between Tor nodes should be considered valid family declarations, and Tor node families can be extracted by using general algorithms related to vertex-edge graphs, and each node family can be considered as a connected subset in the node declaration graph.

[0103] Tor node families are extracted by connected subset discovery algorithms. In each set of experimental data, assume that the set of online nodes in the Tor network is M c , therefore for each node m∈M c , parse its declaration of the Tor family from its description file, and all online nodes and the nodes listed in the family declaration constitute the node set M = M c ∪(∪ m∈ Mc F(m)) of this set of data. In this set of experimental data, 205 node families are mined for the node set M, which contains 623 online nodes and 295 offline nodes. The number of node families, online nodes and offline nodes is not limited in the present application.

[0104] In this way, a malicious family discovery method is proposed, which improves the security of the anonymous network, prevents hidden malicious families from destroying anonymous links, realizes the discovery and elimination of malicious nodes, helps to discover malicious nodes in time, facilitates risk avoidance during subsequent link selection, and prevents information leakage and attack behavior.

[0105] In step S304, the node superiority of each relay node is calculated based on the relay node information and the association relationship, and a node priority list is established based on the node superiority.

[0106] Specifically, the above step S304 includes:

[0107] In step S3041, the current performance score of the current relay node is calculated based on the relay node information and the bandwidth information, combined with the past behavior information of the current relay node.

[0108] Step S3042, according to the current performance score, combined with the historical superiority score of the current relay node, the superiority score of the current relay node is calculated.

[0109] Step S3043, the delay proportion of the current relay node is obtained.

[0110] Step S3044, according to the score calculation model, combined with the superiority score and the delay proportion, the node superiority of the current relay node is calculated.

[0111] In an example, calculating the node superiority of each relay node can include:

[0112] (1) First, the information of each relay node and the bandwidth change is obtained from the directory server, according to the analysis result in 2, the bandwidth and stability performance of the node is analyzed according to the past behavior of the node. And combined with real-time data scanning node behavior, the result score S c is obtained.

[0113] (2) According to the current score S c , combined with the historical superiority score O n-1 (y), the latest weighting coefficient β n (y) is obtained. According to the above historical superiority score, current performance score and weighting coefficient, the superiority score O n (y) of the current relay node y is obtained. Formula: O n (y) = O n-1 (y) [1-β n (y)] + S c *β n (y).

[0114] (3) The relay node and the directory server are mapped in two-dimensional coordinate system, and the mapping distance is the minimum delay time between the relay node and the directory server. According to this, the edit distance is obtained, so as to obtain the delay proportion data late n (y) of each relay node y.

[0115] (4) According to the score calculation model, the superiority ranking Rank n (y) of each node is calculated: Rank n (y) = (1-late n (y)) * log2(1+O n (y)).

[0116] In this mode, by acquiring and analyzing the past behavior information of the relay nodes, the superiority level is calculated according to the node operation law and the bandwidth and stability performance according to the multi-dimensional evaluation model, the performance of the anonymous network is improved, and the superior nodes fully play a role in the Tor link. At the same time, according to the node superiority, high-quality nodes are obtained, and the use efficiency of high-quality nodes is improved.

[0117] In step S305, the anonymous link corresponding to each relay node is determined based on the node family and the node priority list.

[0118] In an optional embodiment, determining the anonymous link corresponding to each relay node comprises:

[0119] In step a1, the relay node with the highest node priority and not belonging to the same family as the current relay node is selected as the next relay node.

[0120] In step a1, when there are several relay nodes with the same node priority, the Gini coefficient of the frequency of using each next relay node by the client is calculated.

[0121] In step a2, it is judged whether the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold.

[0122] In step a3, when the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold, the node weight under the node label corresponding to the Gini coefficient of the next relay node is reduced, and the anonymous link corresponding to the current relay node is constructed.

[0123] In an example, according to the analysis of the hidden node family and the calculation of the node superiority, when selecting the link, the node with higher superiority in different families is preferentially selected, and for the anonymous node group with higher superiority, the Gini coefficient anonymity option based on the node label is set to reduce the probability of frequently selecting a few popular nodes in the routing process. The Gini coefficient selects a random number in (0, 1), and in the link selection, the Gini coefficient of the frequency of using the node by the client is first calculated to judge the node selection anonymity in the current network. When the calculated value exceeds the set threshold, the node weight under the label is reduced to realize dynamic routing selection.

[0124] In this mode, an adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection is proposed to improve the defects of the Tor network routing algorithm in user anonymity security and performance, and to realize the dynamic of link construction. The link selection process dynamically selects nodes with high bandwidth, stability and low risk to improve the security and performance of the Tor link.

[0125] The adaptive construction method of the anonymous link provided by the embodiment can improve the security of the anonymous system, prevent hidden malicious families from destroying the anonymous link, and improve the security of the anonymous network, prevent hidden malicious families from destroying the anonymous link, and achieve the discovery and elimination of malicious nodes, which is helpful for timely discovery of malicious nodes, risk avoidance in subsequent link selection, and prevention of information leakage and attack behaviors. By obtaining and analyzing the past behavior information of the relay node, the node superiority degree is calculated according to the node operation law, bandwidth and stability performance, and a multi-dimensional evaluation model, the performance of the anonymous network is improved, and the superior node can fully play a role in the Tor link. At the same time, the high-quality node is obtained according to the node superiority, and the use efficiency of the high-quality node is improved. An adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection is proposed to improve the defects of the Tor network routing algorithm in user anonymity security and performance, and to realize the dynamic of link construction. The link selection process dynamically selects nodes with high bandwidth, stability and low risk, and improves the security and performance of the Tor link.

[0126] In the embodiment, an adaptive construction method of an anonymous link is provided, which can be used for the computer device described above, Figure 5 is a flowchart of another adaptive construction method of an anonymous link according to an embodiment of the application, as shown in the figure, the flowchart comprises the following steps: Figure 5

[0127] In step S501, the information of all relay nodes in the anonymous system is obtained. For details, please refer to step S301 of the embodiment shown in the figure, which will not be repeated here. Figure 3

[0128] In step S502, the correlation degree of the relay node information is analyzed to obtain the correlation between the relay nodes. For details, please refer to step S302 of the embodiment shown in the figure, which will not be repeated here. Figure 3

[0129] In step S503, the relay node information is extracted based on the correlation to identify the node family. For details, please refer to step S303 of the embodiment shown in the figure, which will not be repeated here. Figure 3

[0130] In step S504, the node superiority of each relay node is calculated based on the relay node information and the correlation, and a node priority list is established based on the node superiority. For details, please refer to step S304 of the embodiment shown in the figure, which will not be repeated here. Figure 3

[0131] ​​​​​Step S505, based on the node family and the node priority list, determine the anonymous link corresponding to each relay node. For details, please refer to Figure 3 Step S305 of the embodiment shown, which will not be described here.

[0132] Step S506, visualize the relay node information, bandwidth information and node priority list, and build a node data management system.

[0133] In an example, by analyzing the risk nodes, establishing a priority list based on the node superiority, an adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection is proposed. According to the above steps, a visual system, Tor node data management system, is developed, Figure 6 is a data flow diagram of a Tor node data management system according to an embodiment of the application, Figure 7 is a schematic diagram of the bandwidth and stability of a node on a Tor network according to an embodiment of the application, Figure 8 is a schematic diagram of a node priority list according to an embodiment of the application, Figure 9 is a schematic diagram of node information retrieval according to an embodiment of the application, Figure 10 is a schematic diagram of node detailed information according to an embodiment of the application, such as Figures 6 to 10 As shown, the Tor node data management system provides users to view the running status of each node on the current Tor network and the node data in each dimension.

[0134] In this way, a visual system is provided, which realizes that users can view the running status of each node on the current Tor network and the node data in each dimension, and users can understand the trend of each dimension of each node on the Tor network, further improving the use experience.

[0135] The adaptive construction method of the anonymous link provided in this embodiment provides a visual system, which realizes that users can view the running status of each node on the current Tor network and the node data in each dimension, and users can understand the trend of each dimension of each node on the Tor network, further improving the use experience.

[0136] In this embodiment, an adaptive construction device of an anonymous link is also provided, which is used to implement the above embodiments and preferred embodiments, and will not be described again. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware is also possible and is contemplated.

[0137] The adaptive construction device of an anonymous link provided in this embodiment, as shown in Figure 11 comprises:

[0138] The node information obtaining module 1101 is configured to obtain all the relay node information in the anonymous system. For details, please refer to Figure 2 The step S201 of the embodiment shown will not be repeated here.

[0139] The node correlation analysis module 1102 is configured to analyze the correlation of the relay node information to obtain the correlation between the relay nodes. For details, please refer to Figure 2 The step S202 of the embodiment shown will not be repeated here.

[0140] The node family identification module 1103 is configured to extract the relay node information based on the correlation to identify the node family. For details, please refer to Figure 2 The step S203 of the embodiment shown will not be repeated here.

[0141] The node superiority calculation module 1104 is configured to calculate the node superiority of each relay node based on the relay node information and the correlation, and establish a node priority list based on the node superiority. For details, please refer to Figure 2 The step S204 of the embodiment shown will not be repeated here.

[0142] The anonymous link construction module 1105 is configured to determine the anonymous link corresponding to each relay node based on the node family and the node priority list. For details, please refer to Figure 2 The step S205 of the embodiment shown will not be repeated here.

[0143] In some optional embodiments, the node correlation analysis module 1102 includes:

[0144] The node correlation analysis unit is configured to take the fingerprint as the unique identifier of each relay node, analyze and filter the repeated attribute values of the consensus file, the relay descriptor file, the bandwidth file and the exit information file in the relay node information based on the information of the fingerprint, establish the correlation between the relay nodes, and obtain the bandwidth information of each relay node.

[0145] In some optional embodiments, the node family identification module 1103 includes:

[0146] The family relationship identification unit is configured to identify the family relationship between the current relay node and the next relay node based on the correlation through the connected subset discovery algorithm.

[0147] The family relationship existing unit is configured to determine that a node family relationship exists between the current relay node and the next relay node when a family bidirectional declaration exists between the current relay node and the next relay node, or when only one of the current relay node and the next relay node has a family declaration, or when an indirect family declaration exists between the current relay node and the next relay node.

[0148] The risk node determination unit is configured to determine that the current relay node is a risk node based on the bandwidth information when the current relay node does not have a family declaration and the current relay node falsely reports the bandwidth.

[0149] In some optional embodiments, the node superiority calculation module 1104 includes:

[0150] The past behavior analysis unit is configured to calculate a current performance score of the current relay node based on the relay node information and the bandwidth information and in combination with past behavior information of the current relay node.

[0151] The superiority score calculation unit is configured to calculate a superiority score of the current relay node based on the current performance score and in combination with a historical superiority score of the current relay node.

[0152] The delay proportion acquisition unit is configured to acquire a delay proportion of the current relay node.

[0153] The node superiority calculation unit is configured to calculate a node superiority of the current relay node based on a scoring calculation model and in combination with the superiority score and the delay proportion.

[0154] In some optional embodiments, the anonymous link construction module 1105 includes:

[0155] The relay node selection unit is configured to select, as the next relay node, a relay node that does not belong to the same family as the current relay node and has the highest node priority.

[0156] The Gini coefficient calculation unit is configured to calculate a Gini coefficient of frequencies at which the client uses each next relay node when there are a plurality of relay nodes that have the same node priority.

[0157] The threshold judgment unit is configured to judge whether the Gini coefficient of the next relay node is greater than a Gini coefficient anonymity threshold value.

[0158] The anonymous link construction unit is configured to, when the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold value, reduce a node weight under a node label corresponding to the Gini coefficient of the next relay node, and construct an anonymous link corresponding to the current relay node.

[0159] In some optional embodiments, the anonymous link adaptive construction apparatus includes:

[0160] The data visualization unit is used to visualize relay node information, bandwidth information, and node priority lists, and to build a node data management system.

[0161] Further functional descriptions of the above modules and units are the same as those in the corresponding embodiments described above, and will not be repeated here.

[0162] In this embodiment, the adaptive construction device for anonymous links is presented in the form of functional units. Here, a unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that execute one or more software or fixed programs, and / or other devices that can provide the above functions.

[0163] This invention also provides a computer device having the above-described features. Figure 11 The diagram shows an adaptive construction device for anonymous links.

[0164] Please see Figure 12 , Figure 12 This is a schematic diagram of the structure of a computer device provided in an optional embodiment of the present invention, such as... Figure 12 As shown, the computer device includes one or more processors 10, memory 20, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The components communicate with each other via different buses and can be mounted on a common motherboard or otherwise installed as needed. The processors can process instructions executed within the computer device, including instructions stored in or on memory to display graphical information of a GUI on external input / output devices (such as display devices coupled to the interfaces). In some alternative implementations, multiple processors and / or multiple buses can be used with multiple memories and multiple memory modules, if desired. Similarly, multiple computer devices can be connected, each providing some of the necessary operations (e.g., as a server array, a group of blade servers, or a multiprocessor system). Figure 12 Take a processor 10 as an example.

[0165] Processor 10 may be a central processing unit, a network processor, or a combination thereof. Processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The programmable logic device may be a complex programmable logic device (CAMP), a field-programmable gate array (FPGA), a general-purpose array logic (GDA), or any combination thereof.

[0166] The memory 20 stores instructions executable by at least one processor 10 to cause the at least one processor 10 to perform the method shown in the above embodiments.

[0167] The memory 20 can include a program storage area and a data storage area, where the program storage area can store an operating system, application programs required by at least one function, and the data storage area can store data created according to the use of the computer device, etc. In addition, the memory 20 can include a high-speed random access memory, and can also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state memory device. In some optional embodiments, the memory 20 can optionally include a memory disposed remotely relative to the processor 10, which can be connected to the computer device through a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0168] The memory 20 can include a volatile memory, such as a random access memory; the memory can also include a non-volatile memory, such as a flash memory, a hard disk, or a solid-state disk; and the memory 20 can also include a combination of the above-mentioned kinds of memories.

[0169] The computer device also includes an input device 30 and an output device 40. The processor 10, the memory 20, the input device 30, and the output device 40 can be connected through a bus or other means, Figure 12 For example, by way of example, through a bus connection.

[0170] The input device 30 can receive inputted digital or character information, and generate key signal inputs related to the user settings and function controls of the computer device, such as a touch screen, a keypad, a mouse, a trackpad, a touchpad, a pointing stick, one or more mouse buttons, a trackball, a joystick, etc. The output device 40 can include a display device, an auxiliary lighting device (e.g., an LED), a tactile feedback device (e.g., a vibration motor), etc. The above-mentioned display device includes, but is not limited to, a liquid crystal display, a light-emitting diode, a display, and a plasma display. In some optional embodiments, the display device can be a touch screen.

[0171] The embodiments of the present application further provide a computer readable storage medium, and the method according to the embodiments of the present application can be implemented in hardware, firmware, or recorded in a storage medium, or stored in a remote storage medium or a non-transitory machine readable storage medium and downloaded to a local storage medium through network, so that the method described herein can be processed by such software on a storage medium using a general purpose computer, a special purpose processor, or programmable or special hardware. The storage medium can be a magnetic disk, an optical disk, a read-only memory, a random access memory, a flash memory, a hard disk, or a solid state disk, etc. Further, the storage medium can also include a combination of the above-mentioned memories. It can be understood that the computer, the processor, the microprocessor controller, or the programmable hardware includes a storage component that can store or receive software or computer code, when the software or computer code is accessed and executed by the computer, the processor, or the hardware, the method shown in the above embodiments is implemented.

[0172] Part of the present application can be applied as a computer program product, for example, computer program instructions, when executed by a computer, the operation of the computer can invoke or provide the method and / or technical solutions according to the present application. Those skilled in the art should understand that the form of computer program instructions in computer readable medium includes but is not limited to source file, executable file, installation package file, etc. Correspondingly, the way of computer program instructions executed by computer includes but is not limited to: the computer directly executes the instructions, or the computer compiles the instructions and then executes the corresponding compiled program, or the computer reads and executes the instructions, or the computer reads and installs the instructions and then executes the corresponding installed program. Here, the computer readable medium can be any available computer readable storage medium or communication medium accessible to the computer.

[0173] Although the embodiments of the present application are described in conjunction with the accompanying drawings, various modifications and changes can be made by those skilled in the art without departing from the spirit and scope of the present application, and such modifications and changes fall within the scope defined by the appended claims.

Claims

1. An adaptive method for constructing anonymous links, characterized in that, The method includes: Obtain information on all relay nodes in the anonymous system; The correlation analysis of the relay node information is performed to obtain the correlation relationships between each relay node; Based on the aforementioned association, the relay node information is extracted to identify the node family; Based on the relay node information and the association relationship, the node superiority of each relay node is calculated, and a node priority list is established based on the node superiority. Based on the node family and the node priority list, the anonymous link corresponding to each relay node is determined; The correlation analysis of the relay node information to obtain the correlation relationships between each relay node includes: Using fingerprints as unique identifiers for each relay node, and based on the information in the fingerprints, the duplicate attribute values ​​of the consensus file, relay descriptor file, bandwidth file, and egress information file in the relay node information are analyzed and filtered to establish the association between each relay node and obtain the bandwidth information of each relay node. The step of extracting relay node information based on the association relationship and identifying node families includes: The family relationship between the current relay node and the next relay node is identified based on the association relationship using the connected subset discovery algorithm. When there is a bidirectional family declaration between the current relay node and the next relay node, or when there is a family declaration between the current relay node and the next relay node on only one side, or when there is an indirect family declaration between the current relay node and the next relay node, it is determined that there is a node family relationship between the current relay node and the next relay node. Based on the bandwidth information, if the current relay node does not have a family declaration and the current relay node falsely reports bandwidth, the current relay node is determined to be a risk node. The determination of the anonymous link corresponding to each relay node includes: Select the next relay node as one that does not belong to the same family as the current relay node and has the highest node priority.

2. The method according to claim 1, characterized in that, The calculation of the node superiority of each relay node based on the relay node information and the association relationship includes: Based on the relay node information and the bandwidth information, combined with the past behavior information of the current relay node, the current performance score of the current relay node is calculated. Based on the current performance score and combined with the historical superiority score of the current relay node, the superiority score of the current relay node is calculated. Get the current latency percentage of the relay node; Based on the scoring calculation model, and combining the superiority score and the delay ratio, the node superiority of the current relay node is calculated.

3. The method according to claim 2, characterized in that, The determination of the anonymous link corresponding to each relay node also includes: When there are several relay nodes with the same priority, calculate the Gini coefficient of the frequency used by the client for each next relay node; Determine whether the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold; When the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold, the node weight under the node label corresponding to the Gini coefficient of the next relay node is reduced, and the anonymous link corresponding to the current relay node is constructed.

4. The method according to claim 1, characterized in that, The method further includes: The relay node information, bandwidth information, and node priority list are visualized to construct a node data management system.

5. An adaptive construction device for anonymous links, characterized in that, The device includes: The node information acquisition module is used to acquire information about all relay nodes in the anonymous system. The node correlation analysis module is used to perform correlation analysis on the relay node information to obtain the correlation relationship between each relay node; The node family identification module is used to extract the relay node information based on the association relationship and identify the node family. The node superiority calculation module is used to calculate the node superiority of each relay node based on the relay node information and the association relationship, and to establish a node priority list based on the node superiority. An anonymous link construction module is used to determine the anonymous link corresponding to each relay node based on the node family and the node priority list; The correlation analysis of the relay node information to obtain the correlation relationships between each relay node includes: Using fingerprints as unique identifiers for each relay node, and based on the information in the fingerprints, the duplicate attribute values ​​of the consensus file, relay descriptor file, bandwidth file, and egress information file in the relay node information are analyzed and filtered to establish the association between each relay node and obtain the bandwidth information of each relay node. The step of extracting relay node information based on the association relationship and identifying node families includes: The family relationship between the current relay node and the next relay node is identified based on the association relationship using the connected subset discovery algorithm. When there is a bidirectional family declaration between the current relay node and the next relay node, or when there is a family declaration between the current relay node and the next relay node on only one side, or when there is an indirect family declaration between the current relay node and the next relay node, it is determined that there is a node family relationship between the current relay node and the next relay node. Based on the bandwidth information, if the current relay node does not have a family declaration and the current relay node falsely reports bandwidth, the current relay node is determined to be a risk node. The determination of the anonymous link corresponding to each relay node includes: Select the next relay node as one that does not belong to the same family as the current relay node and has the highest node priority.

6. A computer device, characterized in that, include: A memory and a processor are communicatively connected, the memory storing computer instructions, and the processor executing the computer instructions to perform the adaptive construction method of the anonymous link according to any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing a computer to execute the adaptive construction method of the anonymous link according to any one of claims 1 to 4.

8. A computer program product, characterized in that, Includes computer instructions for causing a computer to perform the adaptive construction method of the anonymous link according to any one of claims 1 to 4.

Images