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

Abstract

The invention relates to the technical field of anonymous communication, and discloses an anonymous link adaptive construction method and device, equipment and a storage medium, and the method comprises the steps: obtaining all relay node information in an anonymous system; performing association degree analysis on the relay node information to obtain an association relationship among the relay nodes; extracting relay node information, and identifying to obtain a node family; calculating node superiority of each relay node, and establishing a node priority list based on the node superiority; and determining an anonymous link corresponding to each relay node based on the node family and the node priority list. According to the method, the implementation mechanism of anonymous system family mining is improved, the previous behavior information of the relay node is acquired and analyzed, a basis is provided for optimization of link selection according to the node operation rule, bandwidth and stability performance, risk nodes are eliminated, and adaptive link selection is performed according to node scores, so that the efficiency and the reliability of a communication link are improved; and the node selection security is improved.

Description

Technical Field

[0001] The present invention relates to the field of anonymous communication technology, and in particular to a method, device, equipment and storage medium for adaptively constructing an anonymous link. Background Art

[0002] Tor (The Onion Router) anonymous communication system is the most successful public anonymous communication service on the Internet. With its low latency, directory service, simple configuration and other characteristics, it has been favored by many users and researchers in the field of anonymous communication. With the growing demand for anonymous communication among Internet users, the number of nodes connected to the Tor network is also increasing. When users run Tor, the nodes join the Tor network as relay nodes to achieve anonymity and provide bandwidth for the Tor network. On the one hand, the more Tor clients are running, the faster and more secure the Tor network will be by hiding users in more relay nodes; on the other hand, as the number of Tor relays increases, malicious nodes join the Tor network and engage in malicious or even illegal activities based on the anonymity characteristics of the Tor network. Therefore, it is particularly important to collect statistics on the activity behavior data of each node on the Tor network and analyze risk nodes to reduce the damage caused by malicious behavior.

[0003] In the related technology, there are currently more than 7,000 relay nodes active on the Tor network every day, and the stability, bandwidth provided, and security of each node are different. Due to Tor's random routing selection algorithm, in the process of establishing a link, it may select relay nodes with low stability, low bandwidth, or even risks, or it may select secure nodes with high stability and high bandwidth. This 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. At the same time, the Tor system lacks a complete evaluation system for relay nodes joining the Tor network, and users cannot distinguish between relay nodes providing services. Summary of the invention

[0004] In view of this, the present invention provides a method, device, equipment and storage medium for adaptively constructing an anonymous link to solve the problem that the security of relay nodes in an anonymous system is difficult to ensure.

[0005] In a first aspect, the present invention provides a method for adaptively constructing an anonymous link, the method comprising:

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

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

[0008] Based on the association relationship, the relay node information is extracted and the node family is identified;

[0009] Based on the relay node information and association relationships, 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 node priority list, the anonymous link corresponding to each relay node is determined.

[0011] In the present invention, a new node association and malicious family discovery method is proposed by improving the implementation mechanism of anonymous system family mining. By acquiring and analyzing the past behavior information of relay nodes, the superiority level is calculated according to the node operation rules and bandwidth and stability performance according to a multi-dimensional evaluation model, which provides a basis for the optimization of link selection. Through an adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection, risk nodes are eliminated, and adaptive link selection is performed according to node scores to improve the efficiency and reliability of communication links and improve the security of node selection.

[0012] In an optional implementation, performing correlation analysis on the relay node information to obtain correlation relationships between the relay nodes includes:

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

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

[0015] In an optional implementation, 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 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 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 there is no family declaration for the current relay node and the current relay node falsely reports the bandwidth, the current relay node is determined to be a risky node.

[0019] In this way, a malicious family discovery method is proposed to improve the security of anonymous networks, prevent hidden malicious families from destroying anonymous links, and achieve the discovery and elimination of malicious nodes, which helps to discover malicious nodes in a timely manner and facilitate risk avoidance in subsequent link selection, preventing information leakage and attack behaviors.

[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 bandwidth information, combined with the past behavior information of the current relay node, the current performance score of the current relay node is calculated;

[0022] The superiority score of the current relay node is calculated based on the current performance score and the historical superiority score of the current relay node;

[0023] Get the delay ratio of the current relay node;

[0024] According to the scoring calculation model, combined with the superiority score and delay ratio, the node superiority of the current relay node is calculated.

[0025] In this method, by obtaining and analyzing the past behavior information of relay nodes, and calculating the superiority level according to the node operation rules, bandwidth, and stability performance based on a multi-dimensional evaluation model, the performance of the anonymous network is improved, and superior nodes can be fully utilized in the Tor link. At the same time, high-quality nodes are obtained based on the node superiority, and the efficiency of using high-quality nodes is improved.

[0026] In an optional implementation, determining the anonymous link corresponding to each relay node includes:

[0027] Select a relay node that does not belong to the same family as the current relay node and has the highest node priority as the next relay node;

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

[0029] Determine 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 to build an anonymous link corresponding to the current relay node.

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

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

[0033] Visualize the relay node information, bandwidth information and node priority list to build a node data management system.

[0034] In this way, a visualization system is provided, which enables users to view the operating status of each node on the current Tor network and the data of each dimension of the node. Users can understand the changing trends of each dimension of each node on the Tor network, further improving the user experience.

[0035] In a second aspect, the present invention provides an adaptive construction device for anonymous links, the device comprising:

[0036] Node information acquisition module, used to obtain all relay node information in the anonymous system;

[0037] The node correlation analysis module is used to perform correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes;

[0038] The node family identification module is used to extract the relay node information based on the association relationship and identify the node family;

[0039] A node superiority calculation module is used to calculate the node superiority of each relay node based on the relay node information and association relationship, and establish a node priority list based on the node superiority;

[0040] The 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.

[0041] In a third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the method for adaptively constructing an anonymous link according to the first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0042] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the method for adaptively constructing an anonymous link according to the first aspect or any corresponding embodiment thereof.

[0043] In a fifth aspect, the present invention provides a computer program product, including computer instructions, where the computer instructions are used to enable a computer to execute the method for adaptively constructing an anonymous link according to the first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

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

[0046] Figure 2 4 is a flow chart of a method for adaptively constructing an anonymous link according to an embodiment of the present invention.

[0047] Figure 3 It is a flowchart of another method for adaptively constructing an anonymous link according to an embodiment of the present invention.

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

[0049] Figure 5 It is a flowchart of another method for adaptively constructing an anonymous link according to an embodiment of the present invention.

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

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

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

[0053] Fig. 9 It is a schematic diagram of node information retrieval according to an embodiment of the present invention.

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

[0055] Fig.11 4 is a structural block diagram of an apparatus for adaptively constructing an anonymous link according to an embodiment of the present invention.

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

[0057] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

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

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

[0060] (2) The client selects a route based on the relay list information. The list provides node flag information that identifies Guard and Exit. Tor's random routing selection algorithm selects an entry node from the nodes marked by Guard and an exit node from the nodes marked by Exit according to the node flag information. The probability of random selection is determined by the weight of the bandwidth reported by the node in the total bandwidth.

[0061] (3) After selecting three-hop relay nodes, the client obtains the session key information of the three-hop nodes respectively, and at the same time establishes an anonymous communication link including these relay nodes based on the identity information such as the IP address of the relay node for encrypted transmission.

[0062] (4) The client initiates a request to the target server and encrypts the request content layer by layer like an onion, that is, the content is encrypted in sequence from far to near using the session key with the three-hop nodes. The entry node uses the key to decrypt the outermost layer, 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 it and forwards it to the exit node. Finally, the exit node decrypts the innermost layer and obtains the plaintext request content to the target server. Only the transmission connection between the exit node and the target server is unencrypted.

[0063] (5) The target server receives the original request information data and replies to the user. During the return process, the content will be encrypted at each node and finally returned to the client, completing a complete communication.

[0064] In the related technology, there are currently more than 7,000 relay nodes active on the Tor network every day, and the stability, bandwidth provided, and security of each node are different. Due to Tor's random routing selection algorithm, in the process of establishing a link, it may select relay nodes with low stability, low bandwidth, or even risks, or it may select secure nodes with high stability and high bandwidth. This 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. At the same time, the Tor system lacks a complete evaluation system for relay nodes joining the Tor network, and users cannot distinguish between relay nodes providing services.

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

[0066] The computer device in this embodiment is suitable for use scenarios that enhance the anonymity and security of the communication process under the Tor anonymous communication system. The present invention provides an adaptive construction method for anonymous links, and proposes a new node association and malicious family discovery method by improving the implementation mechanism of anonymous system family mining. By acquiring and analyzing the past behavior information of relay nodes, according to the node operation rules and bandwidth, stability performance, and according to the multi-dimensional evaluation model, the superiority level is calculated to provide a basis for the optimization of link selection. Through an adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection, risk nodes are eliminated, and adaptive link selection is performed according to node scores to improve the efficiency and reliability of communication links and improve the security of node selection.

[0067] According to an embodiment of the present invention, an embodiment of a method for adaptively constructing 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 a 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 this embodiment, a method for adaptively constructing an anonymous link is provided, which can be used in the above-mentioned computer device. Figure 2 is a flow chart of a method for adaptively constructing an anonymous link according to an embodiment of the present invention. Figure 2 As shown, the process includes the following steps:

[0069] Step S201, obtaining information of all relay nodes in the anonymous system.

[0070] Step S202: performing correlation analysis on the relay node information to obtain correlation relationships between the relay nodes.

[0071] In one example, by analyzing and filtering 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.

[0072] Step S203: extract the relay node information based on the association relationship and identify the node family.

[0073] In one example, Tor considers multiple nodes operated by the same user or organization as a node family, and avoids using multiple nodes from this family in the same link when selecting a link to ensure the anonymity of the link. Since the Tor family is determined by mutual declarations between nodes, malicious node providers will avoid declaring malicious nodes in the same family, resulting in the emergence of hidden families, which poses a huge potential threat to the anonymity of the Tor network.

[0074] Therefore, direct or indirect, unidirectional or bidirectional family declarations between Tor nodes should be regarded as valid family declarations. With the help of general algorithms related to vertex-edge graphs, Tor node families can be extracted. Each node family can be regarded as a connected subset in the node declaration graph.

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

[0076] Step S205: Determine the anonymous link corresponding to each relay node based on the node family and the node priority list.

[0077] In one example, based on the analysis of hidden node families and the calculation of node superiority, when selecting links, nodes with higher superiority that are not from the same family are given priority. At the same time, for anonymous node groups with higher superiority, a Gini coefficient anonymity option based on node labels is set to reduce the probability of frequently selecting certain popular nodes during the routing process. The Gini coefficient selects a random number in (0,1). When selecting links, the Gini coefficient of the node frequency used by the client is first calculated to determine the anonymity of node selection in the current network. When the calculated value exceeds the set threshold, the weight of the node under the label is reduced to achieve dynamic routing selection.

[0078] The adaptive construction method of anonymous links provided in this embodiment proposes a new node association and malicious family discovery method by improving the implementation mechanism of anonymous system family mining. By acquiring and analyzing the past behavior information of relay nodes, according to the node operation rules and bandwidth, stability performance, and based on a multi-dimensional evaluation model, the superiority level is calculated to provide a basis for link selection optimization. Through an adaptive dynamic routing algorithm based on bandwidth and stability weighted random selection, risk nodes are eliminated, and adaptive link selection is performed according to node scores to improve the efficiency and reliability of communication links and improve the security of node selection.

[0079] In this embodiment, a method for adaptively constructing an anonymous link is provided, which can be used in the above-mentioned computer device. Figure 3 is a flow chart of another method for adaptively constructing an anonymous link according to an embodiment of the present invention. Figure 3 As shown, the process includes the following steps:

[0080] Step S301, obtain all relay node information in the anonymous system. Figure 2 Step S201 of the illustrated embodiment will not be described in detail here.

[0081] Step S302: performing correlation analysis on the relay node information to obtain correlation relationships between the relay nodes.

[0082] Specifically, the above step S302 includes:

[0083] Step S3021, using the fingerprint as the unique identifier of each relay node, based on the fingerprint information, analyzing and screening the repeated attribute values ​​of the consensus file, relay descriptor file, bandwidth file and export information file in the relay node information, establishing the association relationship between the relay nodes, and obtaining the bandwidth information of each relay node.

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

[0085] (1) The consensus file consensus-microdesc does not directly provide the relay node’s fingerprint information, that is, it is impossible to establish a direct association between the node and other files, but it provides the hash value of the identity key, identity, and the fingerprint information of the node can be calculated through the relationship between the two. Identity is the fingerprint encoded in base64 and the ending equal sign is deleted. Therefore, the fingerprint information can be obtained by converting the identity data block into base64 and decoding it after filling the identity with symbols.

[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, both 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. Consensus bandwidth is an important basis for route selection during link establishment.

[0087] (3) The bandwidth_avg attribute provided by the relay descriptor file server-descriptors is the same as the desc_bw_avg attribute value provided by the bandwidth file bandwidths of the sbws measurement version, which indicates the average bandwidth value, that is, the bandwidth value that the relay can maintain for a long time. The relay descriptor file continuously updates the latest bandwidth value and archives it according to the node. The bandwidth file updates the bandwidth value several times per hour and generates a file for storage, which can record the consensus bandwidth information of each node.

[0088] (4) has the same association as (3). Both provide burst bandwidth information, that is, the bandwidth value that the relay can maintain in a short period of time.

[0089] (5) The bw attributes provided by the bandwidth file of the sbws measurement version and the bw attributes provided by the torflow measurement version remain at the same level. Although the measurement times are different, the measurement results at adjacent times are similar.

[0090] In summary, by analyzing and screening the 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, relay nodes are identified through node association analysis, and a new node association method is proposed to improve the security of the anonymous system and prevent hidden malicious families from destroying anonymous links.

[0092] Step S303: extract the relay node information based on the association relationship and identify the node family.

[0093] Specifically, the above step S303 includes:

[0094] Step S3031 , identifying the family relationship between the current relay node and the next relay node based on the association relationship through the connected subset discovery algorithm.

[0095] Step S3032, 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 one and only one of the current relay node and the next relay node, 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] Step S3033: Based on the bandwidth information, when there is no family declaration in the current relay node and the current relay node falsely reports the bandwidth, it is determined that the current relay node is a risk node.

[0097] In one example, Tor considers multiple nodes operated by the same user or organization as a node family, and avoids using multiple nodes from this family in the same link when selecting a link to ensure the anonymity of the link. Since the Tor family is determined by mutual declarations between nodes, malicious node providers will avoid declaring malicious nodes in the same family, resulting in 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. For any node m∈M on it, F(m)={m′∈M|m’s family declaration contains node m′}. If node m does not make any family declaration, then It can be seen that node m i With m j There are the following types of relationships:

[0099] (1) Node m i With m j There is a direct family bidirectional statement between them.

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

[0101] (3)m i ~m j , node m i With m j There are indirect family claims.

[0102] From the above classification, it can be seen that and m i ~m j These relations are symmetrical and can satisfy the following derivation: That is, even if two nodes do not have mutual family declarations, they can still be connected through other nodes in the same family. Therefore, direct or indirect, unidirectional or bidirectional family declarations between Tor nodes should be regarded as valid family declarations. With the help of a general algorithm related to the vertex-edge graph to extract Tor node families, each node family can be regarded as a connected subset in the node declaration graph.

[0103] The Tor node family is extracted by the Unicom subset discovery algorithm. In each set of experimental data, it is assumed that the set of online nodes in the Tor network is M. c , so for each node m∈M c , parse its declaration of the Tor family from its description file, all online nodes and the nodes listed in the family declaration constitute the node set M=M of this group of data c ∪(∪ m∈ Mc F(m)). In this set of experimental data, for the node set M, a total of 205 node families were mined, and these node families included 623 online nodes and 295 offline nodes. In the present invention, the number of node families, online nodes, and offline nodes is not limited.

[0104] In this way, a malicious family discovery method is proposed to improve the security of anonymous networks, prevent hidden malicious families from destroying anonymous links, and achieve the discovery and elimination of malicious nodes, which helps to discover malicious nodes in a timely manner and facilitate risk avoidance in subsequent link selection, preventing information leakage and attack behaviors.

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

[0106] Specifically, the above step S304 includes:

[0107] Step S3041, based on the relay node information and bandwidth information, combined with the past behavior information of the current relay node, calculate and obtain the current performance score of the current relay node.

[0108] Step S3042, based on the current performance score and the historical superiority score of the current relay node, the superiority score of the current relay node is calculated.

[0109] Step S3043, obtaining the delay ratio of the current relay node.

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

[0111] In one example, calculating the node superiority of each relay node may include:

[0112] (1) First, obtain the information of relay nodes and bandwidth changes from the directory server. According to the analysis results in 2, analyze the bandwidth and stability performance of the node based on the node's past behavior. Combined with real-time data scanning node behavior, the result score S is obtained. c .

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

[0114] (3) Map the relay node and the directory server on a two-dimensional coordinate system. The mapping distance is the minimum delay time between the relay node and the directory server. Based on this, the edit distance is obtained to obtain the delay proportion data late of each relay node y. n (y).

[0115] (4) Calculate the superiority ranking of each node based on the scoring calculation model n (y):Rank n (y) = (1-late n (y))*log2(1+O n (y)).

[0116] In this method, by obtaining and analyzing the past behavior information of relay nodes, and calculating the superiority level according to the node operation rules, bandwidth, and stability performance based on a multi-dimensional evaluation model, the performance of the anonymous network is improved, and superior nodes can be fully utilized in the Tor link. At the same time, high-quality nodes are obtained based on the node superiority, and the efficiency of using high-quality nodes is improved.

[0117] Step S305: Determine the anonymous link corresponding to each relay node based on the node family and the node priority list.

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

[0119] Step a1: Select a relay node that does not belong to the same family as the current relay node and has the highest node priority as the next relay node.

[0120] Step a1: when there are several relay nodes with the same node priority, calculate the Gini coefficient of the frequency of each next relay node used by the client.

[0121] Step a2, determining whether the Gini coefficient of the next relay node is greater than the Gini coefficient anonymity threshold;

[0122] 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 to construct an anonymous link corresponding to the current relay node.

[0123] In one example, based on the analysis of hidden node families and the calculation of node superiority, when selecting links, nodes with higher superiority that are not from the same family are given priority. At the same time, for anonymous node groups with higher superiority, a Gini coefficient anonymity option based on node labels is set to reduce the probability of frequently selecting certain popular nodes during the routing process. The Gini coefficient selects a random number in (0,1). When selecting links, the Gini coefficient of the node frequency used by the client is first calculated to determine the anonymity of node selection in the current network. When the calculated value exceeds the set threshold, the weight of the node under the label is reduced to achieve dynamic routing selection.

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

[0125] The adaptive construction method of the anonymous link provided in this embodiment identifies the relay node through the node association relationship analysis, proposes a new node association method, improves the security of the anonymous system, and prevents the hidden malicious family from destroying the anonymous link. A malicious family discovery method is proposed to improve the security of the anonymous network, prevent the hidden malicious family from destroying the anonymous link, and realize the discovery and elimination of malicious nodes, which helps to discover malicious nodes in time, facilitates risk avoidance during subsequent link selection, and prevents information leakage and attack behaviors. By obtaining and analyzing the past behavior information of the relay node, according to the node operation rules and bandwidth, stability performance, and according to the multi-dimensional evaluation model, the superiority level is calculated, the performance of the anonymous network is improved, and the superior node can play a full role in the Tor link. At the same time, high-quality nodes are obtained according to the node superiority, and the use efficiency of high-quality nodes 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 realize the dynamic nature of link construction. The link selection process dynamically selects high-bandwidth, stable, and low-risk nodes to improve the security and performance of the Tor link.

[0126] In this embodiment, a method for adaptively constructing an anonymous link is provided, which can be used in the above-mentioned computer device. Figure 5 is a flow chart of another method for adaptively constructing an anonymous link according to an embodiment of the present invention. Figure 5 As shown, the process includes the following steps:

[0127] Step S501, obtain all relay node information in the anonymous system. Figure 3 Step S301 of the illustrated embodiment will not be described in detail here.

[0128] Step S502: Perform correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes. Figure 3 Step S302 of the illustrated embodiment will not be described in detail here.

[0129] Step S503: Extract the relay node information based on the association relationship and identify the node family. Figure 3 Step S303 of the illustrated embodiment will not be described in detail here.

[0130] Step S504: Calculate the node superiority of each relay node based on the relay node information and association relationship, and establish a node priority list based on the node superiority. Figure 3 Step S304 of the illustrated embodiment will not be described in detail here.

[0131] Step S505: Determine the anonymous link corresponding to each relay node based on the node family and node priority list. Figure 3 Step S305 of the illustrated embodiment will not be described in detail here.

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

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

[0134] In this way, a visualization system is provided, which enables users to view the operating status of each node on the current Tor network and the data of each dimension of the node. Users can understand the changing trends of each dimension of each node on the Tor network, further improving the user experience.

[0135] The adaptive anonymous link construction method provided in this embodiment provides a visualization system, which enables users to view the operation status of each node on the current Tor network and the data of each dimension of the node. Users can understand the change trends of each dimension of each node on the Tor network, further improving the user experience.

[0136] In this embodiment, a self-adaptive construction device for anonymous links is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0137] This embodiment provides an adaptive construction device for anonymous links, such as Fig.11 As shown, including:

[0138] The node information acquisition module 1101 is used to obtain all relay node information in the anonymous system. Figure 2 Step S201 of the illustrated embodiment will not be described in detail here.

[0139] The node correlation analysis module 1102 is used to perform correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes. Figure 2 Step S202 of the illustrated embodiment will not be described in detail here.

[0140] The node family identification module 1103 is used to extract the relay node information based on the association relationship and identify the node family. Figure 2 Step S203 of the illustrated embodiment will not be described in detail here.

[0141] The node superiority calculation module 1104 is used to calculate the node superiority of each relay node based on the relay node information and association relationship, and establish a node priority list based on the node superiority. Figure 2 Step S204 of the illustrated embodiment will not be described in detail here.

[0142] The anonymous link construction module 1105 is used to determine the anonymous link corresponding to each relay node based on the node family and the node priority list. Figure 2 Step S205 of the illustrated embodiment will not be described in detail here.

[0143] In some optional implementations, the node relevance analysis module 1102 includes:

[0144] The node association analysis unit is used to use the fingerprint as the unique identifier of each relay node. Based on the fingerprint information, the repeated attribute values ​​of the consensus file, relay descriptor file, bandwidth file and export information file in the relay node information are analyzed and screened, and the association relationship between the relay nodes is established to obtain the bandwidth information of each relay node.

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

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

[0147] A family relationship existence unit is used to determine the existence of a node family relationship between the current relay node and the next relay node 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 one and only one of the two relay nodes, or when there is an indirect family declaration between the current relay node and the next relay node.

[0148] The risk node determination unit is used to determine the current relay node as a risk node based on bandwidth information when there is no family declaration in the current relay node and the current relay node falsely reports the bandwidth.

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

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

[0151] The superiority score calculation unit is used to calculate the superiority score of the current relay node based on the current performance score and the historical superiority score of the current relay node.

[0152] The delay ratio obtaining unit is used to obtain the delay ratio of the current relay node.

[0153] The node superiority calculation unit is used to calculate the node superiority of the current relay node according to the scoring calculation model, combining the superiority score and the delay ratio.

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

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

[0156] The Gini coefficient calculation unit is used to calculate the Gini coefficient of the frequency of each next relay node used by the client when there are several relay nodes with the same node priority.

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

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

[0159] In some optional implementations, the anonymous link adaptive construction device includes:

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

[0161] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

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

[0163] The embodiment of the present invention also provides a computer device having the above Fig.11 The adaptive construction device of the anonymous link is shown.

[0164] See also Fig.12 , Fig.12 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Fig.12 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Fig.12 A processor 10 is taken as an example.

[0165] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0166] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0167] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via 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 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[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 may be connected via a bus or other means. Fig.12 The example of connecting through bus is taken in the following.

[0170] The input device 30 can receive input digital or character information, and generate key signal input related to the user settings and function control of the computer device, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator bar, one or more mouse buttons, a trackball, a joystick, etc. The output device 40 may include a display device, an auxiliary lighting device (e.g., an LED) and 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 embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or 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 a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0172] A part of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the existence of the computer program instruction in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc., and accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium accessible to the computer.

[0173] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for adaptively constructing an anonymous link, characterized in that: The method comprises: Get all relay node information in the anonymous system; Performing correlation analysis on the relay node information to obtain correlation relationships between the relay nodes; Based on the association relationship, the relay node information is extracted to identify a node family; Based on the relay node information and the association relationship, calculating the node superiority of each relay node, and establishing a node priority list based on the node superiority; Based on the node family and the node priority list, an anonymous link corresponding to each relay node is determined.

2. The method according to claim 1, characterized in that: The performing correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes includes: The fingerprint is used as the unique identifier of each relay node. Based on the fingerprint information, the repeated attribute values ​​of the consensus file, relay descriptor file, bandwidth file and export information file in the relay node information are analyzed and screened, the association relationship between the relay nodes is established, and the bandwidth information of each relay node is obtained.

3. The method according to claim 2, characterized in that The extracting the relay node information based on the association relationship and identifying a node family includes: Identify the family relationship between the current relay node and the next relay node based on the association relationship through a 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 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; 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, it is determined that the current relay node is a risky node.

4. The method according to claim 3, characterized in that: The calculating 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, a current performance score of the current relay node is calculated; Calculate the superiority score of the current relay node based on the current performance score and the historical superiority score of the current relay node; Get the delay ratio of the current relay node; According to the scoring calculation model, the node superiority of the current relay node is calculated in combination with the superiority score and the delay proportion.

5. The method according to claim 4, characterized in that The step of determining the anonymous link corresponding to each relay node includes: Select a relay node that does not belong to the same family as the current relay node and has the highest node priority as the next relay node; When there are several relay nodes with the same node priority, the Gini coefficient of the frequency of each next relay node used by the client is calculated; 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 to build an anonymous link corresponding to the current relay node.

6. The method according to claim 2, characterized in that The method further comprises: The relay node information, the bandwidth information and the node priority list are displayed visually to build a node data management system.

7. An adaptive construction device for anonymous links, characterized in that: The device comprises: Node information acquisition module, used to obtain all relay node information in the anonymous system; A node correlation analysis module is used to perform correlation analysis on the relay node information to obtain the correlation relationship between the relay nodes; A node family identification module, used to extract the relay node information based on the association relationship and identify the node family; A node superiority calculation module, used to calculate the node superiority of each relay node based on the relay node information and the association relationship, and establish a node priority list based on the node superiority; The 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.

8. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the method for adaptively constructing an anonymous link according to any one of claims 1 to 6 by executing the computer instructions.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the method for adaptively constructing an anonymous link according to any one of claims 1 to 6.

10. A computer program product, characterized in that The method comprises computer instructions, wherein the computer instructions are used to cause a computer to execute the method for adaptively constructing an anonymous link according to any one of claims 1 to 6.

Images