Method and system for disseminating private information in social networks based on user relationships and games
Through the method based on user relationship and game theory in social networks, the problems of information security threats and privacy infringement in private information dissemination are solved. By calculating the Nash equilibrium threshold and state transition, the scope and protection strategies of private information dissemination are effectively explored, and the scope and protection strategies of private information are realized. More in-depth privacy protection research.
Patent Information
- Application Number
- CN202210050331.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-01-17
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2042-01-17
AI Technical Summary
There are information security threats and privacy infringement risks in the dissemination of privacy information in social networks, and it is difficult for existing technology to effectively consider the impact of user micro-level game strategies and user relationships on the dissemination of privacy information.
Based on the user relationship and game method, by building a social network, randomly selecting the privacy subject node and sending node, building a game matrix based on intimacy and popularity, calculating the Nash equilibrium threshold, determining the receiving node and converting its status until the privacy information is disseminated, Statistical spread range.
Combining the game theory of user intimacy and popularity, we characterize user decision-making behaviors, conduct in-depth research on privacy protection, and effectively explore the scope of dissemination and protection strategies of privacy information.
Smart Images

Figure CN114398677B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of private information dissemination, and in particular to a method and system for private information dissemination in a social network based on user relationships and games. Background Art
[0002] With the continuous advancement of my country's infrastructure construction, the national Internet top-level interconnection architecture has been further improved, the scale of social network service users has maintained a steady growth, and user activity has further increased. Currently, there are 4.66 billion people using the Internet worldwide, of which 4.2 billion are social media users. As the world's largest social networking platform, Facebook has also accelerated the spread of information on the network as its user base continues to expand. In recent years, social media users are facing more and more information privacy and security risks, such as information security threats and privacy violations. Therefore, how to prevent our private information from being maliciously or more widely spread is an urgent, necessary and challenging issue.
[0003] For general information dissemination, the topological structure of social networks, the characteristics of social network users, and the services provided by social media are all key factors that affect information dissemination in social networks. However, for private information, the particularity of private information determines the complexity of private information dissemination in social networks. In addition to considering the information dissemination rules at the macro level of the network, we must also consider the game strategy selection for private information at the micro level of users, as well as the impact of micro relationships between users on the process of private information dissemination. Summary of the invention
[0004] In order to solve the above problems existing in the prior art, the present invention provides a method and system for disseminating private information in a social network based on user relationships and games.
[0005] The present invention discloses a method for propagating private information in a social network based on user relationships and games, comprising:
[0006] Build social networks;
[0007] Randomly select a network node as a privacy subject node, and set the intimacy between the privacy subject node and other network nodes in the social network and the popularity of the privacy subject node;
[0008] Randomly select a network node as a sending node, and a node adjacent to the sending node as a receiving node, and construct a game matrix based on the sending node and the receiving node, and calculate the Nash equilibrium threshold preferred by the receiving node;
[0009] According to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, determine the receiving node that receives the privacy information, and the receiving node is converted from the unknown state to the propagation state, and the sending node is converted from the propagation state to the exit state;
[0010] The receiving node in the propagation state repeats the sending node propagation step until no new propagation state nodes are generated in the social network, then the propagation of the private information ends, and the state transition results of each network node in the social network are counted;
[0011] The dissemination scope of the private information is determined according to the state transition result.
[0012] Preferably, the intimacy includes four basic hierarchical relationships, namely, family relationships, friendship relationships, acquaintance relationships, and stranger relationships, and the proportion of the number of nodes in the four basic hierarchical relationships is determined;
[0013] A basic hierarchical relationship is assigned to the privacy subject node and any network node in the social network according to the proportion, and a randomly generated value in a preset intimacy value interval corresponding to the basic hierarchical relationship is used as the intimacy between the privacy subject node and the network node, and the popularity is taken according to a normal distribution.
[0014] Preferably, constructing a game matrix according to the sending node and the receiving node to obtain the Nash equilibrium threshold value preferred by the receiving node includes:
[0015] The receiving node prefers the Nash equilibrium threshold P like_nash The formula is:
[0016]
[0017] Where: The benefit of the receiving node when the receiving node adopts the “prefer current private information” strategy and the sending node adopts the “send private information” strategy; The loss of the receiving node when the receiving node adopts the strategy of "dislike current private information" and the sending node adopts the strategy of "send private information"; The loss of the receiving node when the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information"; The benefit of the receiving node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
[0018] Preferably, according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, determining the receiving node that receives the privacy information includes:
[0019] Calculate the sending probability of the sending node according to the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node;
[0020] Calculate the probability that the receiving node likes the current private message according to the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node;
[0021] It is determined whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if so, the sending node sends the message with the sending probability, otherwise, the private message is not considered to be sent to the receiving node.
[0022] Preferably, the sending probability of the sending node and the probability formula of the receiving node liking the current private message are respectively:
[0023] u=(1-P intimacy_is ) γ ×P famous_s ;
[0024]
[0025] Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and the privacy subject node s; famous_s is the popularity of the privacy subject node s; α, β, η, θ are all coefficients.
[0026] The present invention also provides a privacy information dissemination system in a social network based on user relationships and games, comprising:
[0027] Building blocks for constructing social networks;
[0028] A setting module, used to randomly select a network node as a privacy subject node, and set the intimacy between the privacy subject node and other network nodes in the social network and the popularity of the privacy subject node;
[0029] A game module, used for randomly selecting a network node as a sending node, and a node adjacent to the sending node as a receiving node, and constructing a game matrix according to the sending node and the receiving node, and calculating a Nash equilibrium threshold preferred by the receiving node;
[0030] A node state conversion module, used to determine the receiving node that receives the privacy information according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, and convert the receiving node from an unknown state to a propagation state, and convert the sending node from a propagation state to an exit state;
[0031] A statistical module, configured for the receiving node in a propagation state to repeat the sending node propagation step until no new propagation state nodes are generated in the social network, and then the propagation of the private information ends, and the state transition results of each network node in the social network are counted;
[0032] A determination module is used to determine the dissemination scope of the private information according to the state conversion result.
[0033] Preferably, the intimacy includes four basic hierarchical relationships, namely, family relationships, friendship relationships, acquaintance relationships, and stranger relationships, and the proportion of the number of nodes in the four basic hierarchical relationships is determined; a basic hierarchical relationship is assigned to the privacy subject node and any network node in the social network according to the proportion, and a randomly generated value in a preset intimacy value interval corresponding to the basic hierarchical relationship is used as the intimacy between the privacy subject node and the network node;
[0034] The popularity is taken according to a normal distribution.
[0035] Preferably, constructing a game matrix according to the sending node and the receiving node to obtain the Nash equilibrium threshold value preferred by the receiving node includes:
[0036] The receiving node prefers the Nash equilibrium threshold P like_nash The formula is:
[0037]
[0038] Where: The benefit of the receiving node when the receiving node adopts the “prefer current private information” strategy and the sending node adopts the “send private information” strategy; The loss of the receiving node when the receiving node adopts the strategy of "dislike current private information" and the sending node adopts the strategy of "send private information"; The loss of the receiving node when the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information"; The benefit of the receiving node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
[0039] Preferably, according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, determining the receiving node that receives the privacy information includes:
[0040] Calculate the sending probability of the sending node according to the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node;
[0041] Calculate the probability that the receiving node likes the current private message according to the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node;
[0042] It is determined whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if so, the sending node sends the message with the sending probability, otherwise, the private message is not considered to be sent to the receiving node.
[0043] Preferably, the sending probability of the sending node and the probability formula of the receiving node liking the current private message are respectively:
[0044] u=(1-P intimacy_is ) γ ×P famous_s ;
[0045]
[0046] Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and the privacy subject node s; famous_s is the popularity of the privacy subject node s; α, β, η, θ are all coefficients.
[0047] Compared with the prior art, the present invention has the following beneficial effects:
[0048] The present invention starts with the intimacy between the node that receives the information and the privacy subject node and the privacy subject's popularity, and combines it with game theory to characterize the user's decision-making behavior when facing private messages, which jointly affects the dissemination of private information; this helps us better explore user decision-making behavior, thereby guiding us to delve deeper into research related to privacy protection. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] Figure 1 The present invention is a flowchart of a method for disseminating private information in a social network based on user relationships and games. DETAILED DESCRIPTION
[0050] 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 ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0051] The present invention is further described in detail below in conjunction with the accompanying drawings:
[0052] like Figure 1 As shown, the present invention provides a method for propagating private information in a social network based on user relationships and games, comprising:
[0053] A social network that meets the characteristics of a social network is constructed based on a standard social network construction algorithm. The nodes in the network represent social network users, and the connections between nodes represent the friendship between two users. Private information will be spread in the social network through the connections between nodes.
[0054] Randomly select a network node as the privacy subject node, and set the intimacy between the privacy subject node and the rest of the network nodes in the social network, as well as the popularity of the privacy subject node;
[0055] Specifically, intimacy indicates the degree of intimacy between two users in a social network. In this embodiment, intimacy includes four basic hierarchical relationships: family relationship, friendship relationship, acquaintance relationship, and stranger relationship, and determines the proportion of the number of nodes in the four basic hierarchical relationships; the basic hierarchical relationship is assigned to the privacy subject node and any network node in the social network according to the proportion, and the randomly generated value in the preset intimacy value interval corresponding to the basic hierarchical relationship is used as the intimacy between the privacy subject node and the network node. Popularity indicates the degree to which a user in a social network is well-known in the network. When the privacy information of a privacy subject is disseminated, other nodes in the entire network will have a certain degree of familiarity with the current privacy subject, which indicates the popularity of the privacy subject. In the patent of this invention, the popularity of the node is calculated according to the node degree distribution, and the nodes can be divided into high-connectivity users, medium-connectivity users, and low-connectivity users according to repeated statistical analysis of the results. The popularity of the three types of users tends to a stable value. Considering that the degree of knowledge of each user for a specific user is not the same in the real situation, the popularity of other users in the network to the current user is set to be valued according to the normal distribution of their popularity.
[0056] Randomly select a network node as the sending node, and the node adjacent to the sending node as the receiving node. Then build a game matrix based on the sending node and the receiving node, and calculate the Nash equilibrium threshold that the receiving node likes.
[0057] Specifically, the game matrix is as shown in the following table.
[0058]
[0059] in, When the receiving node adopts the "prefer current private information" strategy and the sending node adopts the "send private information" strategy, the benefit obtained by the sent node.
[0060] The benefit obtained by the receiving node when the receiving node adopts the "prefer current private information" strategy and the sending node adopts the "send private information" strategy.
[0061] When the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "sending private information", the loss caused by the sending node.
[0062] When the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "sending private information", the loss caused by the receiving node.
[0063] When the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information", the loss caused by the sending node.
[0064] When the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information", the loss caused by the receiving node.
[0065] The benefits brought by the sending node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
[0066] The benefits brought by the receiving node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
[0067] The game matrix studies the interactive participation strategies of the game participants, that is, for the sending node and the receiving node, the strategies of both parties are "sending private information" or "not sending private information" and "liking the current private information" or "disliking the current private information" to play the game, and according to the game matrix, the Nash equilibrium threshold formula that the receiving node likes is:
[0068]
[0069] According to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold that the receiving node likes, the receiving node that receives the privacy information is determined, and the receiving node is converted from the unknown state to the propagation state, and the sending node is converted from the propagation state to the exit state;
[0070] Specifically, the sending probability of the sending node is calculated based on the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node;
[0071] The probability that the receiving node likes the current private message is calculated based on the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node;
[0072] Determine whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if it is greater, the sending node sends it with the sending probability, otherwise, do not consider sending private information to the receiving node.
[0073] The sending probability of the sending node and the probability formula of the receiving node liking the current private message are:
[0074] u=(1-P intimacy_is ) γ ×Pfamous_s ;
[0075]
[0076] Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and privacy subject node s; P famous_s is the popularity of privacy subject node s; α, β, η, θ are all coefficients.
[0077] The receiving node in the propagation state repeats the sending node propagation steps until no new propagation state nodes are generated in the social network, then the propagation of the private information ends, and the state transition results of each network node in the social network are counted;
[0078] Specifically, in this embodiment, the node states in the propagation process are defined as S, I, and R. S (unknown state) represents a group of users who have not heard or seen the information, I (propagation state) represents a group of users who actively share and propagate the information, and R (exit state) represents a group of users who know the information but have lost interest in propagating it. The specific rules for node state transition during the propagation of private information are as follows:
[0079] Randomly select two nodes in the social network as the privacy subject node and the initial sending node;
[0080] Add the initial sending node to the dissemination list of this round, and start the dissemination of private information from this node;
[0081] Traverse the propagation list, obtain a sending node in each round, and calculate the sending probability of the sending node;
[0082] Get the neighbor node list of the current sending node, and then add it to the list of nodes to be received;
[0083] Traverse the list of nodes to be received and use the formula Calculate the like degree of each node to be received and compare it with the Nash equilibrium value P of the like probability like_nash Compare and determine whether the interest level of the current receiving node is greater than the preferred Nash equilibrium value;
[0084] Determine whether the like probability of the current node to be received is greater than the like Nash equilibrium probability. If it is, the sender sends the private information to the node with the sending probability, otherwise the private information is not sent to the node. After traversing all the nodes to be received and selecting the forwarding strategy, the sending node enters the exit state with a probability of σ=1 and exits the propagation.
[0085] If the receiving node receives the information and becomes a propagation state, after traversing the propagation list of this round, the propagation list of this round will be cleared, and the propagation of this round is completed. When the propagation of this round ends, the node that has been transformed into the propagation state will become the communicator of the next round and be added to the propagation list of the next round;
[0086] Put the nodes in the next round's propagation list into this round's propagation list, and clear the next round's propagation list;
[0087] According to the above steps, a new round of information dissemination begins;
[0088] When the propagation list is empty, information propagation stops. The changes of I-state nodes and R-state nodes in the process of information propagation are counted to determine the propagation scope of private information and the relevant data of the propagation rounds, and the influence of intimacy, popularity and Nash equilibrium probability on the speed, breadth and depth of private information propagation is analyzed.
[0089] The present invention also provides a privacy information dissemination system in a social network based on user relationships and games, comprising:
[0090] Building blocks for constructing social networks;
[0091] A setting module, used to randomly select a network node as a privacy subject node, and set the intimacy between the privacy subject node and other network nodes in the social network and the popularity of the privacy subject node;
[0092] The game module is used to randomly select a network node as a sending node and a node adjacent to the sending node as a receiving node, and to construct a game matrix based on the sending node and the receiving node, and to calculate the Nash equilibrium threshold value preferred by the receiving node;
[0093] The node state conversion module is used to determine the receiving node that receives the privacy information according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold that the receiving node likes, and convert the receiving node from the unknown state to the propagation state, and convert the sending node from the propagation state to the exit state;
[0094] A statistical module is used for the receiving node in the propagation state to repeat the sending node propagation step until no new propagation state nodes are generated in the social network, then the propagation of the private information ends, and the state transition results of each network node in the social network are counted;
[0095] The determination module is used to determine the dissemination scope of the private information according to the state transition result.
[0096] Furthermore, intimacy includes four basic hierarchical relationships, namely, family relationships, friendship relationships, acquaintance relationships and stranger relationships, and the proportion of the number of nodes in the four basic hierarchical relationships is determined; a basic hierarchical relationship is assigned to the privacy subject node and any network node in the social network according to the proportion, and a randomly generated value in the preset intimacy value range corresponding to the basic hierarchical relationship is used as the intimacy between the privacy subject node and the network node; popularity is taken according to a normal distribution.
[0097] In this embodiment, according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, determining the receiving node that receives the privacy information includes:
[0098] The sending probability of the sending node is calculated based on the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node;
[0099] The probability that the receiving node likes the current private message is calculated based on the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node;
[0100] Determine whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if it is greater, the sending node sends it with the sending probability, otherwise, do not consider sending private information to the receiving node.
[0101] Furthermore, the probability formulas of the sending node and the probability formula of the receiving node liking the current private message are:
[0102] u=(1-P intimacy_is ) γ ×P famous_s ;
[0103]
[0104] Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and privacy subject node s; P famous_s is the popularity of privacy subject node s; α, β, η, θ are all coefficients.
[0105] The above are only preferred embodiments of the present invention and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
Claims
1. A method for disseminating private information in a social network based on user relationships and games, comprising: Build social networks; Randomly select a network node as a privacy subject node, and set the intimacy between the privacy subject node and other network nodes in the social network and the popularity of the privacy subject node; Randomly select a network node as a sending node, and a node adjacent to the sending node as a receiving node, and construct a game matrix based on the sending node and the receiving node, and calculate the Nash equilibrium threshold preferred by the receiving node; According to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, determine the receiving node that receives the privacy information, and convert the receiving node from the unknown state to the propagation state, and convert the sending node from the propagation state to the exit state; The receiving node in the propagation state repeats the sending node propagation step until no new propagation state nodes are generated in the social network, then the propagation of the private information ends, and the state transition results of each network node in the social network are counted; Determining a dissemination scope of the private information according to the state transition result; Wherein, constructing a game matrix according to the sending node and the receiving node to obtain the Nash equilibrium threshold value preferred by the receiving node includes: The receiving node prefers the Nash equilibrium threshold P like_nash The formula is: Where: The benefit of the receiving node when the receiving node adopts the "prefer current private information" strategy and the sending node adopts the "send private information" strategy; The loss of the receiving node when the receiving node adopts the strategy of "dislike current private information" and the sending node adopts the strategy of "send private information"; The loss of the receiving node when the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information"; The benefit of the receiving node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
2. The method for disseminating private information in a social network based on user relationships and games as claimed in claim 1, characterized in that: The intimacy includes four basic levels of relationships: family relationship, friendship relationship, acquaintance relationship and stranger relationship, and determines the proportion of the number of nodes in the four basic levels of relationships; Assigning a basic hierarchical relationship to the privacy subject node and any network node in the social network according to the proportion, and using a randomly generated value in a preset intimacy value interval corresponding to the basic hierarchical relationship as the intimacy between the privacy subject node and the network node; The popularity is taken according to a normal distribution.
3. The method for disseminating private information in a social network based on user relationships and games as claimed in claim 1, characterized in that: Determining the receiving node that receives the privacy information according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node includes: Calculate the sending probability of the sending node according to the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node; Calculate the probability that the receiving node likes the current private message according to the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node; It is determined whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if so, the sending node sends the message with the sending probability, otherwise, the private message is not considered to be sent to the receiving node.
4. The method for disseminating private information in a social network based on user relationships and games as claimed in claim 3, characterized in that: The sending probability of the sending node and the probability formula of the receiving node liking the current private message are respectively: u=(1-P intimacy_is ) γ ×P famous_s ; Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and the privacy subject node s; P famous_s is the popularity of the privacy subject node s; α, β, η, θ are all coefficients.
5. A privacy information dissemination system in a social network based on user relationships and games, characterized in that: include: Building blocks for constructing social networks; A setting module, used to randomly select a network node as a privacy subject node, and set the intimacy between the privacy subject node and other network nodes in the social network and the popularity of the privacy subject node; A game module, used for randomly selecting a network node as a sending node, and a node adjacent to the sending node as a receiving node, and constructing a game matrix according to the sending node and the receiving node, and calculating a Nash equilibrium threshold preferred by the receiving node; A node state conversion module, used to determine the receiving node that receives the privacy information according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node, and convert the receiving node from an unknown state to a propagation state, and convert the sending node from a propagation state to an exit state; A statistical module, configured for the receiving node in a propagation state to repeat the sending node propagation step until no new propagation state nodes are generated in the social network, and then the propagation of the private information ends, and the state transition results of each network node in the social network are counted; A determination module, used to determine the dissemination scope of the private information according to the state conversion result; Wherein, constructing a game matrix according to the sending node and the receiving node to obtain the Nash equilibrium threshold value preferred by the receiving node includes: The receiving node prefers the Nash equilibrium threshold P like_nash The formula is: Where: The benefit of the receiving node when the receiving node adopts the "prefer current private information" strategy and the sending node adopts the "send private information" strategy; The loss of the receiving node when the receiving node adopts the strategy of "dislike current private information" and the sending node adopts the strategy of "send private information"; The loss of the receiving node when the receiving node adopts the strategy of "preferring current private information" and the sending node adopts the strategy of "not sending private information"; The benefit of the receiving node when the receiving node adopts the strategy of "disliking current private information" and the sending node adopts the strategy of "not sending private information".
6. The private information dissemination system in a social network based on user relationships and games as claimed in claim 5, characterized in that: The intimacy includes four basic hierarchical relationships, namely, family relationships, friendship relationships, acquaintance relationships, and stranger relationships, and determines the proportion of the number of nodes in the four basic hierarchical relationships; according to the proportion, a basic hierarchical relationship is assigned to the privacy subject node and any network node in the social network, and a randomly generated value in a preset intimacy value interval corresponding to the basic hierarchical relationship is used as the intimacy between the privacy subject node and the network node; The popularity is taken according to a normal distribution.
7. The private information dissemination system in a social network based on user relationships and games as claimed in claim 6, characterized in that: Determining the receiving node that receives the privacy information according to the intimacy between the sending node and the privacy subject node, the intimacy between the receiving node and the privacy subject node, the popularity of the privacy subject node, and the Nash equilibrium threshold preferred by the receiving node includes: Calculate the sending probability of the sending node according to the intimacy between the sending node and the privacy subject node and the popularity of the privacy subject node; Calculate the probability that the receiving node likes the current private message according to the intimacy between the receiving node and the privacy subject node and the popularity of the privacy subject node; It is determined whether the probability that the receiving node likes the current private message is greater than the Nash equilibrium threshold that the receiving node likes; if so, the sending node sends the message with the sending probability, otherwise, the private message is not considered to be sent to the receiving node.
8. The private information dissemination system in a social network based on user relationships and games as claimed in claim 7, characterized in that: The sending probability of the sending node and the probability formula of the receiving node liking the current private message are respectively: u=(1-P intimacy_is ) γ ×P famous_s ; Where: μ is the sending probability of the sending node; P like is the sending probability of the sending node; intimacy_is is the intimacy between node i and the privacy subject node s; P famous_s is the popularity of the privacy subject node s; α, β, η, θ are all coefficients.
