Information recording system based on bidirectional interaction information sharing

Abstract

The invention discloses an information recording system based on bidirectional interaction information sharing, which relates to the technical field of shared information recording and comprises a data acquisition module, a data processing module, a calculation module and an adjustment analysis module. According to the method, the transmission path and the time delay of the information can be optimized by calculating the information propagation degree, the high-bandwidth and low-delay transmission path can be intelligently selected through the system, the resource consumption of the node in the information transmission process can be accurately calculated through the system, the resource distribution of the node can be flexibly adjusted under the cooperation of a scheduling mechanism, and the resource utilization rate of the node is improved. The system can perform detailed evaluation on the data encryption strength, the security protection level and the like of each node to ensure the security of information in a bidirectional interaction process, so that various attacks and information leakage are effectively resisted, and the sharing efficiency of the system is improved. Therefore, the information record has excellent safety and high efficiency.

Description

Technical Field

[0001] The present invention relates to the technical field of shared information recording, and specifically to an information recording system based on two-way interactive information sharing. Background Art

[0002] With the rapid development of Internet technology and the advent of the information age, the transmission and sharing of data have become an indispensable part of all walks of life. In modern information systems, especially in security-sensitive fields such as finance, healthcare, and public safety, two-way interaction of information protection and data transmission has become particularly important. Two-way interaction can provide a more flexible resource scheduling and information feedback mechanism, making information transmission not just a one-way flow, but more adaptable and real-time. A shared information recording system refers to a technology for recording and storing shared information when there is shared information among multiple users.

[0003] In existing information recording systems, most may rely on a one-way information flow mode, which may not be able to form a good information dissemination mechanism among multiple nodes, resulting in possible delays and information loss in the transmission of information between nodes. The low information dissemination degree reduces the efficiency of system response, and may affect the real-time performance of the system. Moreover, in existing information recording systems, it may be difficult to effectively utilize resources between nodes for optimization, leading to possible delays and resource waste during the sharing process. Low information sharing efficiency may affect the real-time performance of information recording and the overall performance of the system. In addition, existing information systems may not be good at security protection, and problems such as information leakage, tampering, and loss may occur during two-way interaction. Therefore, existing information recording systems may have poor security protection performance. Summary of the Invention

[0004] The purpose of the present invention is to provide an information recording system based on two-way interactive information sharing, which solves the problems raised in the above background art.

[0005] To achieve the above purpose, the present invention provides the following technical solution: An information recording system based on two-way interactive information sharing, including:

[0006] Data acquisition module: Collect the encryption algorithm type, key length information, security information, bandwidth utilization rate, latency data, and packet loss rate of each node through the data acquisition module;

[0007] Data processing module: Input the encryption algorithm type, key length information, security information, bandwidth utilization rate, latency data, and packet loss rate of each node into the data processing module. The data processing module cleans the input data and performs standardization processing on the data to output the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node;

[0008] Calculation module: Input the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node into the calculation module. The calculation module outputs the information dissemination degree, information sharing efficiency, and information security;

[0009] Adjustment and analysis module: Input the information dissemination degree, information sharing efficiency, and information security into the adjustment and analysis module. The adjustment and analysis module adjusts the information dissemination strategy based on the input data, reasonably allocates resources, discovers potential security risks, and correspondingly improves the security protection of the nodes.

[0010] Optionally, the calculation module includes: an information dissemination sub-module, an information sharing sub-module, and an information security sub-module.

[0011] Optionally, the calculation formula of the information dissemination sub-module is as follows:

[0012]

[0013] Where:

[0014] LCK refers to the information dissemination degree, n refers to the total number of nodes, LCKA i refers to the strength of the encryption algorithm used by the i-th node, LCKB i refers to the security score of the i-th node, LCKC i refers to the network performance value of the i-th node, LCKD i refers to the connection strength value between the i-th node and the information source, LCKF refers to the maximum dissemination limit of the system, LCKF i refers to the propagation delay of the i-th node, LA refers to LCKF i is the weight coefficient of, LP refers to the information dissemination weight factor;

[0015] refers to the influence of each node in the information dissemination process;

[0016] refers to the information dissemination ability of each node;

[0017] refers to adjusting the influence of the node connection strength on information dissemination;

[0018] The processing process of the information dissemination sub-module is as follows: Input the strength of the encryption algorithm used by the i-th node, LCKA i , the security score of the i-th node, LCKB i , and the network performance value of the i-th node, LCKC i into the information dissemination sub-module, and the information dissemination sub-module outputs the information dissemination degree, LCK.

[0019] Optionally, the calculation formula of the information sharing sub-module is as follows:

[0020]

[0021] Where:

[0022] LDP refers to the information sharing efficiency, DA refers to the authentication strength, the comprehensive weight adjustment factor of resource demand and load, LDPA i refers to the authentication strength of the i-th node, LDPB i refers to the resource demand of the i-th node, LDPC i refers to the load of the i-th node;

[0023] refers to the resource consumption of the i-th node during the information sharing process;

[0024] refers to the cost during the information sharing process;

[0025] The processing process of the information sharing sub-module is as follows: Input the information dissemination degree LCK and the security score LCKB of the i-th node i into the information sharing sub-module, and the information sharing sub-module outputs the information sharing efficiency LDP.

[0026] Optionally, the calculation formula of the information security sub-module is as follows:

[0027]

[0028] Where:

[0029] IUG refers to the information security, IA refers to the influence weight factor of the vulnerability part on the information security, IUGA i refers to the attack surface of the i-th node;

[0030] refers to the negative impact on the information security caused by the load, delay and security risk in the system;

[0031] refers to the efficiency of propagation and sharing on which the information security depends;

[0032] The processing process of the information security sub-module is as follows: Input the information dissemination degree LCK, the information sharing efficiency LDP, the load LDPC of the i-th node i and the propagation delay LCKF of the i-th node i into the information security sub-module, and the information security sub-module outputs the information security IUG.

[0033] Optionally, the attack surface IUGA of the i-th node in the information security sub-module i is calculated as follows:

[0034]

[0035] Where:

[0036] k refers to the total number of vulnerabilities;

[0037] PPA i，j refers to the severity of the j-th vulnerability exposed by the i-th node;

[0038] PPB j refers to the attack complexity of the j-th vulnerability.

[0039] Optionally, the data collection module monitors the encryption algorithm type and key length of the node through a security audit tool, scans the defense strategy of each node through a security assessment tool, and collects information about the protection strategy and known vulnerabilities.

[0040] Optionally, the data collection module real-time collects and monitors the bandwidth utilization rate, latency data, and packet loss rate of each node through a network traffic monitoring tool.

[0041] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0042] First, the information dissemination sub-module of the present invention outputs the information dissemination degree. This sub-module is based on the comprehensive evaluation of the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node, ensuring that the information dissemination is not only fast but also secure. This is particularly important for two-way interactive information sharing because the information not only needs to flow between various nodes but also needs to ensure its confidentiality and integrity during the transmission process. At the same time, the propagation delay of the i-th node is an important factor affecting the real-time performance of information sharing. Through the information dissemination degree, it can be determined which nodes play an important role in information dissemination, and the information flow path can be optimized to reduce network congestion. Accurately evaluating the contribution of each node in the information recording system helps to dynamically adjust the information transmission strategy in the system, ensuring that the information can reach the target node quickly and securely, thereby improving the system scalability and fault tolerance. Through reasonable dissemination degree calculation, the system can adapt to the requirements under different network environments and ensure the efficient dissemination of information between different nodes.

[0043] II. The present invention outputs the information sharing efficiency through the information sharing sub-module. This sub-module consists of the authentication strength, resource requirements, security, etc. of the nodes. This sub-module considers the resource consumption in the information sharing process, enabling the system to identify efficient sharing paths and optimize resource allocation. By calculating the information sharing efficiency, it can be evaluated whether the information sharing within the system is efficient, and nodes or paths with excessive resource consumption can be detected in a timely manner. During the information sharing process, the phenomenon of excessive system load and resource waste can be reduced, ensuring the smoothness and efficiency of two-way interaction. By optimizing node authentication and resource requirements, information sharing is made more secure and efficient. The system can dynamically adjust the information distribution strategy according to the change of sharing efficiency, thereby improving the response speed and accuracy in the two-way interaction process.

[0044] III. The present invention outputs the information security through the information security sub-module. The calculation of information security ensures that the security of information can also be maintained to a certain extent during the efficient sharing process. The calculation of information security helps the system to maintain a high level of security during two-way interaction and information sharing to avoid information leakage or tampering. By accurately evaluating the node security, the system can dynamically respond to possible security threats to improve the protection ability during information transmission and sharing. When dealing with sensitive information and important data, the information security result helps the system to take appropriate protection measures according to the actual risk situation to ensure the reliability of the information recording system. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 is the flowchart of the method steps of the information recording system based on two-way interactive information sharing;

[0046] Figure 2 is the overall structure diagram of the information recording system based on two-way interactive information sharing;

[0047] Figure 3 is the structure diagram of the calculation module in the information recording system based on two-way interactive information sharing. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0048] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0049] Regarding the information recording system based on two-way interactive information sharing, it is different from the existing information recording systems. In the existing information recording systems, most rely on the one-way information flow mode, which cannot form a good information dissemination mechanism among multiple nodes, resulting in delays and information loss in the transmission of information between nodes. The low dissemination degree of information reduces the efficiency of system response. Especially in high-demand application scenarios that require real-time data updates, the real-time performance of the system is severely affected. Moreover, in many existing information recording systems, the resources between nodes are not effectively utilized for optimization, leading to delays and resource waste during the sharing process, and the low information sharing efficiency will directly affect the real-time performance of information recording and the overall performance of the system. In addition, there are still shortcomings in the security protection aspect in the current information system, especially problems such as information leakage, tampering, or loss during the two-way interaction process. Since the information may encounter external malicious attacks or internal tampering during the transmission process, the existing information recording systems may have poor security protection performance;

[0050] However, this information recording system can help optimize the information transmission path and time delay by calculating the information dissemination degree. Furthermore, through this system, a transmission path with high bandwidth and low delay can be intelligently selected. And this system can accurately calculate the resource consumption of each node during the information transmission process. Together with the scheduling mechanism, it can flexibly adjust the resource allocation of nodes, avoiding the low sharing efficiency caused by node overload, thereby improving the sharing efficiency of the system. Moreover, this system can conduct a detailed evaluation of the data encryption strength, security protection level, authentication mechanism, etc. of each node to ensure the security of information during the two-way interaction process, thus effectively resisting various attacks and information leakage, making this information recording have excellent security and high efficiency.

[0051] Embodiment 1: Please refer to Figures 1 to 3 , this embodiment provides an information recording system based on two-way interactive information sharing, including:

[0052] Data acquisition module: Collect the encryption algorithm type, key length information, security information, bandwidth utilization rate, delay data, and packet loss rate of each node through the data acquisition module;

[0053] Data processing module: Input the encryption algorithm type, key length information, security information, bandwidth utilization rate, delay data, and packet loss rate of each node into the data processing module. The data processing module cleans the input data and performs standardized processing on the data to output the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node;

[0054] Computing Module: Input the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node into the computing module. The computing module outputs the information dissemination degree, information sharing efficiency, and information security;

[0055] Adjustment and Analysis Module: Input the information dissemination degree, information sharing efficiency, and information security into the adjustment and analysis module. The adjustment and analysis module adjusts the information dissemination strategy based on the input data, reasonably allocates resources, discovers potential security risks, and correspondingly enhances the node security protection;

[0056] The computing module includes: an information dissemination sub-module, an information sharing sub-module, and an information security sub-module.

[0057] In this embodiment: The information dissemination sub-module ensures the effective dissemination of information among nodes. The information sharing sub-module conditions for optimizing resource consumption in the sharing process, avoiding excessive load and resource waste. The information security sub-module ensures that information is not leaked or tampered with during the transmission process, thereby overall improving the reliability and efficiency of two-way interaction in the system. The computing module helps the system effectively control resource consumption and security risks in the information sharing process based on multiple factors such as node performance, resource requirements, and security, thus improving the sharing efficiency of the system. By comprehensively considering factors such as node load, latency, resource consumption, and security, multiple sub-modules of this system can provide flexible optimization means for the information recording system, enabling the system to dynamically adjust resource allocation in the face of different network environments and load conditions, ensuring the security and stability of information recording.

[0058] Please refer to Figures 1 to 3 , the processing process of the information dissemination sub-module is as follows:

[0059]

[0060] Among them:

[0061] LCK refers to the information dissemination degree, and n refers to the total number of nodes;

[0062] LCKA iRefers to the strength of the encryption algorithm used by the i-th node. Common encryption strengths include the number of bits of encryption algorithms such as AES and RSA. For example, AES-256 means an encryption strength of 256 bits. The number of bits of encryption is obtained through algorithm configuration. If AES-128 is used, the encryption strength is 128 bits. This item needs to be normalized using the maximum-minimum normalization method. Subtract the minimum value of the encryption strengths of all nodes from the encryption strength of the i-th node first, and then divide the whole by the difference between the maximum value and the minimum value of the encryption strengths of all nodes. This maximum-minimum normalization method is one of the well-known technical means in this field and other related technical fields;

[0063] LCKB i Refers to the security score of the i-th node, which is evaluated by vulnerability scanning tools Nessus and OpenVAS. The higher the score, the stronger the security. Scan the node with Nessus and OpenVAS and get a score from 0 to 10 to represent the security of the node. Input the security score obtained by the scanning tool into this formula;

[0064] LCKC i Refers to the network performance value of the i-th node;

[0065] LCKC i =SA i / SB i

[0066] Where: SA i Refers to the bandwidth value of node i. Use iperf to test the bandwidth, and the result unit is Mbps;

[0067] SB i Refers to the latency value of node i. Use the ping tool to measure the round-trip time of the node, and the unit is ms;

[0068] Then, when normalizing, perform maximum-minimum normalization on SA i and SB i respectively and then input them into this formula;

[0069] LCKD i Refers to the connection strength value between the i-th node and the information source. LCKD i is usually measured by the number of connections and the number of requests per second. Obtain the number of connections and requests with the information source through a network connection monitoring tool;

[0070] LCKD i =MA i / MB i

[0071] Where: MA iDenotes the connection times of node i, MB i Denotes the measured time period, in seconds;

[0072] When inputting MA i and MB i into the calculation formula of this LCKD i , it is necessary to first perform min-max normalization on the obtained MA i and MB i . Simply put, MA i is first subtracted by the minimum value of MA i , and then the whole is divided by the maximum value of MA i minus the minimum value of MA i . This is the means of normalization in the prior art;

[0073] LCKE denotes the maximum propagation limit of the system, which is set by the system designer and is usually a preset limit in network design and architecture. This system is defined as the maximum bandwidth value, such as 1 Gbps;

[0074] LCKF i Denotes the propagation delay of the i-th node, representing the propagation delay of information from the source node to the target node, and measures the delay from the source node to the target node through the network testing tool ping;

[0075] LA denotes the weight coefficient of LCKF i ;

[0076] LP denotes the information propagation weight factor;

[0077] Denotes the influence of each node in the information propagation process. The role of this summation formula is to sum up the propagation degrees of all nodes. In the information recording system based on two-way interactive information sharing, the propagation ability of each node is closely related to factors such as encryption strength, node security, and network performance. This summation formula can comprehensively consider the characteristics of each node;

[0078] Denotes the information propagation ability of each node. The strength of the encryption algorithm LCKA used by the i-th node i will affect the transmission speed of information on the node. Strong encryption may require more processing power and thus reduce the transmission speed. The security score LCKB of the i-th node i represents the protection ability of the node. A node with high security can better ensure that information is not interfered. The network performance value LCKC of the i-th node iIt directly affects the transmission efficiency and latency of information. This part reflects the effectiveness of each node in information dissemination. For an information recording system, the information dissemination capabilities of different nodes will affect the overall information flow efficiency of the system. For example, a node with poor network performance, that is, LCKC i has a lower value, which will slow down the information dissemination, while a node with high encryption strength and strong security will ensure the security and confidentiality of information;

[0079] refers to the adjustment of the influence of node connection strength on information dissemination. The role of the logarithm is to suppress the growth of connection strength and avoid exponential growth of dissemination degree when the connection strength is too large. The role of adding 1 is to prevent LCKD i from being too small and resulting in a logarithmic value of 0, that is, the bottom of the logarithmic function, thus avoiding the value of the dissemination degree being infinitely compressed. This term ensures that the connection strength of the node does not increase the information dissemination degree without limit. Instead, while the dissemination degree increases, it moderately adjusts the connection strength of the information source. For a two-way interaction system, reasonable adjustment of the connection strength can ensure the balanced dissemination of information in the network;

[0080] The processing process of the information dissemination sub-module is as follows: The strength LCKA of the encryption algorithm used by the i-th node i , the security score LCKB of the i-th node i and the network performance value LCKC of the i-th node i are input into the information dissemination sub-module, and the information dissemination sub-module outputs the information dissemination degree LCK.

[0081] In this embodiment: This sub-module calculates the information dissemination degree, which is an index to evaluate the effectiveness and strength of information dissemination from one node to another. In an information recording system based on two-way interactive information sharing, the dissemination effect of information directly affects the breadth and timeliness of information sharing. Based on the comprehensive evaluation of the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node, it ensures that the information dissemination is not only fast, that is, high network performance, but also secure, that is, high encryption strength and high node security. This is particularly important for two-way interactive information sharing because the information not only needs to flow between various nodes, but also must ensure its confidentiality and integrity during transmission. At the same time, the dissemination latency of the i-th node is an important factor affecting the real-time nature of information sharing. The dissemination latency term LA×LCKF in the formula iConsidering the negative impact of time delay on the information dissemination degree, the system can better manage the response speed of nodes during information recording and sharing. By calculating the information dissemination degree LCK, it can be determined which nodes play important roles in information dissemination, thereby optimizing the information flow path, reducing network congestion. In a two-way interactive information recording system, accurately evaluating the contribution of each node helps to dynamically adjust the information transmission strategy in the system, ensuring that information can reach the target node quickly and safely, which is used to improve the scalability and fault tolerance of the system. Through reasonable dissemination degree calculation, the system can adapt to the requirements under different network environments and ensure the efficient dissemination of information among different nodes.

[0082] Please refer to Figures 1 to 3 , the processing process of the information sharing sub-module is as follows:

[0083]

[0084] Among them:

[0085] LDP refers to the information sharing efficiency, DA refers to the comprehensive weight adjustment factor of the authentication strength, resource demand, and load;

[0086] LDPA i refers to the authentication strength of the i-th node. When using two-factor authentication 2FA, the strength is 2, and when using single password authentication, the strength is 1. It is determined according to the system authentication configuration and security policy. Input this value according to the type and strength of the authentication method and perform normalization processing;

[0087] LDPB i refers to the resource demand of the i-th node, which refers to the resource consumption of the node when sharing information, usually including CPU, memory, storage, etc. The resource occupancy of the node is monitored in real time through system monitoring tools such as top and htop;

[0088] LDPB i =(CA i +CB i +CC i ) / 3;

[0089] Among them: CA i refers to the CPU usage ratio of node i, CB i refers to the memory usage ratio of node i, CC i refers to the disk usage ratio of node i;

[0090] CA i 、CB i and CC i When input into this LDPB iPrior to the calculation formula, it is necessary to perform normalization processing on the maximum and minimum values in advance. This normalization processing method is one of the well-known technical means in this field and other related fields, so it will not be elaborated here;

[0091] LDPC i Refers to the load of the i-th node, LDPC i Represents the resources consumed by the node during the information sharing process. Considering the usage of CPU, memory, and disk comprehensively, real-time load information can be obtained through system monitoring tools such as the top command and htop, and normalization processing is performed on the final stage through the maximum and minimum value normalization processing method;

[0092] Refers to the resource consumption situation of the i-th node during the information sharing process. This item can balance the resource consumption and security of the node during information sharing. Excessive resource requirements and authentication intensity will reduce the sharing efficiency of the system, which is reflected in the denominator part of the formula;

[0093] Refers to the cost during the information sharing process. This item includes factors such as the resource consumption, authentication requirements, and security of all nodes, and adds the load of the node, considering the resource consumption and load of all nodes. As the load or consumption increases, the sharing efficiency will decrease, thus affecting the overall sharing efficiency of the system;

[0094] The processing process of the information sharing sub-module is as follows: input the information dissemination degree LCK and the security score LCKB of the i-th node i into the information sharing sub-module, and the information sharing sub-module outputs the information sharing efficiency LDP.

[0095] In this embodiment: This sub-module calculates the information sharing efficiency, which measures the efficiency of information sharing in the entire system. The information sharing efficiency balances the information dissemination degree and the resource consumption during the sharing process, which is determined by factors such as the authentication intensity, resource requirements, security, and load of the node. The resource consumption during the information sharing process considered by this sub-module enables the system to identify efficient sharing paths and optimize resource allocation. The load of each node will affect the information sharing efficiency. This sub-module adds the load item LDPC iTo reflect the negative impact of high-load nodes on the system information sharing efficiency, nodes with too high load will increase the sharing cost. Therefore, it is necessary to dynamically adjust the task allocation of nodes with high load. By calculating the information sharing efficiency LDP, it can be evaluated whether the information sharing within the system is efficient, and nodes or paths with excessive resource consumption can be discovered in a timely manner. During the information sharing process, the phenomena of too high system load and resource waste can be reduced, and the smoothness and efficiency of two-way interaction can be ensured. By optimizing the authentication and resource requirements of nodes, the information sharing can be made more secure and efficient. The system can dynamically adjust the information distribution strategy according to the change of sharing efficiency, so as to improve the response speed and accuracy during the two-way interaction process.

[0096] Please refer to Figures 1 to 3 , the processing process of the information security sub-module is as follows:

[0097]

[0098] Among them:

[0099] IUG refers to information security, IA refers to the weight factor of the impact of vulnerabilities on information security, IUGA i refers to the attack surface of the i-th node, IUGA i represents the security vulnerabilities and potential attack risks exposed by the node, which is usually evaluated according to the number of known vulnerabilities and exposed services. The node is scanned by the vulnerability scanning tool Nessus to evaluate its exposed ports, services and known vulnerabilities. Finally, the IUGA i is processed by the maximum-minimum normalization method;

[0100]

[0101] Among them:

[0102] k refers to the total number of vulnerabilities;

[0103] PPA i，j refers to the severity of the j-th vulnerability exposed by the i-th node. Each vulnerability has a different risk level. Usually, the CVSS score is used to quantify the severity of the vulnerability. The scoring range is from 0 to 10. The higher the score, the greater the danger of the vulnerability. The vulnerability scanning tools, OpenVAS and Nessus, are used to perform a security scan on node i. The tools will list all the discovered vulnerabilities and assign a CVSS score to each vulnerability;

[0104] PPB jRefers to the attack complexity of the j-th vulnerability. The attack complexity is obtained through the analysis of security experts and the scoring criteria in the vulnerability database. For some vulnerabilities, their complexity is evaluated according to known attack methods. Vulnerabilities with higher complexity may require special attack tools or advanced skills. Generally, the attack complexity PPB j A larger value of

[0105] Refers to the negative impact of the load, latency, and security risks in the system on information security. By introducing a subtraction form to reduce the score of information security, the subtracted form is used to reflect the risks and negative impacts, that is, the greater the negative factors, the lower the security of the system. Through this adjustment of the security score, the security assessment of information can be dynamically adjusted. If the load of a node is too large, the latency is too long, or the attack surface is too wide, the security of the system will be reduced, and high load, latency, and attack surface are avoided from affecting the overall information security of the system;

[0106] Refers to the efficiency of dissemination and sharing on which information security depends. The information dissemination degree and information sharing efficiency jointly affect the information security guarantee ability. Combining the information dissemination degree and sharing efficiency ensures that information can not only be effectively disseminated but also maintain a high sharing efficiency during the dissemination process, thereby guaranteeing the security of information;

[0107] The processing process of the information security sub-module is as follows: Input the information dissemination degree LCK, information sharing efficiency LDP, the load LDPC of the i-th node i and the propagation delay LCKF of the i-th node i into the information security sub-module, and the information security sub-module outputs the information security IUG.

[0108] In this embodiment: This sub-module calculates information security, which is particularly important in the system. Especially during two-way interaction and information sharing, the product of the information dissemination degree LCK and the information sharing efficiency LDP by this sub-module is the basis for security guarantee. Only when information can be effectively disseminated and shared efficiently can the system achieve secure two-way interaction. This system ensures that during the efficient sharing process, the security of information can also be maintained. The calculation of information security helps the system maintain a high level of security guarantee during two-way interaction and information sharing, avoiding information leakage or tampering. By accurately evaluating the security of nodes, the system can dynamically respond to possible security threats and improve the protection ability during information transmission and sharing. When processing sensitive information or important data, the calculated security result helps the system take appropriate protection measures according to the actual risk situation to ensure the reliability of the information recording system.

[0109] It should be noted that further operations on the information sharing efficiency LDP are used to affect the information dissemination weight factor LP in the information dissemination sub-module, and then continuously optimize the information dissemination degree LCK, the information sharing efficiency LDP, and the information security IUG. The specific processing process is as follows:

[0110] First: LP new = LP old ×(1 + α × LDP);

[0111] Second: Set the iteration termination conditions:

[0112] Termination condition one: The number of iterations is 100 times;

[0113] Termination condition two: |LP new − LP old | < 0.001;

[0114] Among them:

[0115] LP new refers to the updated information dissemination weight factor, LP old refers to the information dissemination weight factor before update, and α refers to the adjustment coefficient, which is used to control the influence intensity of information sharing efficiency on weight adjustment.

[0116] In this embodiment: By iteratively updating the information propagation weight factor LP, the system can adjust the weight of each node in the information propagation process according to the information sharing efficiency of each node. If some nodes consume more resources during information sharing, that is, the information sharing efficiency is low, then their propagation degree weight will decrease, and vice versa. This dynamic adjustment helps the system adapt to changing network conditions and node performance. In a two-way interactive information recording system, information propagation is not just one-way transmission, but needs to flow bidirectionally among multiple nodes. By iteratively adjusting the information propagation weight factor LP, the system can dynamically adjust the information propagation path according to the real-time performance of the nodes and the information sharing efficiency, ensuring that information can be propagated through the most effective channels. The iterative process also helps maintain information security. When the information sharing efficiency is low, the propagation weight of the node decreases, reducing the risk of information exposure. Therefore, the iterative process not only optimizes the efficiency of information propagation, but also enhances the confidentiality and security of information to a certain extent. By iteratively adjusting LP, the system can optimize the role of nodes in information propagation according to the information sharing efficiency. The information sharing efficiency directly reflects the resource consumption and contribution of each node during information sharing. A high sharing efficiency of a node means that it can participate in information propagation efficiently. Therefore, we should increase its weight in the propagation process. Conversely, if the sharing efficiency is low, its weight should be reduced. By associating the sharing efficiency with the weight through the iterative formula, the system can dynamically adjust the role of each node in information propagation, ensuring the efficiency and stability of information propagation.

[0117] In the specific implementation process, a variety of sub-modules in this method are used to form the information recording system architecture. By using the strength LCKA of the encryption algorithm used by the i-th node i , the security score LCKB of the i-th node i and the network performance value LCKC of the i-th node iInput into the information dissemination sub-module, the information dissemination sub-module outputs the information dissemination degree LCK. This sub-module ensures that the information dissemination is not only fast but also secure based on the comprehensive evaluation of the strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node. This is important for two-way interactive information sharing because the information not only needs to flow between various nodes but also must ensure its confidentiality and integrity during the transmission process. At the same time, the propagation delay of the i-th node is an important factor affecting the real-time nature of information sharing. By calculating the information dissemination degree LCK, it can be determined which nodes play important roles in information dissemination, and then optimize the information flow path to reduce network congestion. Precise evaluation of the contribution of each node in the two-way interactive information recording system helps to dynamically adjust the information transmission strategy in the system to ensure that the information can reach the target node quickly and securely, which is used to improve the system scalability and fault tolerance. Through reasonable dissemination degree calculation, the system can adapt to the requirements under different network environments and ensure the efficient dissemination of information between different nodes;

[0118] By inputting the information dissemination degree LCK and the security score LCKB of the i-th node i Input into the information sharing sub-module, the information sharing sub-module outputs the information sharing efficiency LDP. This sub-module consists of the authentication strength, resource requirements, security, and load of the nodes. This sub-module enables the system to identify efficient sharing paths and optimize resource allocation considering the resource consumption during the information sharing process. The load of each node affects the efficiency of information sharing. By calculating the information sharing efficiency LDP, it can be evaluated whether the information sharing within the system is efficient, and timely discover nodes or paths with excessive resource consumption, reducing the phenomena of excessive system load and resource waste during the information sharing process, ensuring the smoothness and efficiency of two-way interaction. By optimizing node authentication and resource requirements, the information sharing becomes more secure and efficient. The system can dynamically adjust the information distribution strategy according to the change of sharing efficiency, thereby improving the response speed and accuracy during the two-way interaction process;

[0119] By inputting the information dissemination degree LCK, the information sharing efficiency LDP, the load LDPC of the i-th node i and the propagation delay LCKF of the i-th node iInput into the information security submodule, the information security submodule outputs the information security IUG. The calculation of this submodule ensures that the security of information can be maintained to a certain extent during the efficient sharing process. The information security calculation helps the system to maintain a high level of security during two-way interaction and information sharing to avoid information leakage or tampering. By accurately evaluating the security of the nodes, the system can dynamically respond to possible security threats and improve the protection capabilities during information transmission and sharing. When processing sensitive information and important data, the security results are calculated to help the system take appropriate protection measures according to the actual risk situation to ensure the reliability of the information recording system.

[0120] Example 2: Please refer to Figure 1 , Figure 2 and Figure 3 The data acquisition module uses security audit tools to monitor the encryption algorithm type and key length of the node, scans the defense strategy of each node through security assessment tools, and collects information about protection strategies and known vulnerabilities; the data acquisition module uses network traffic monitoring tools to collect and monitor the bandwidth utilization, delay data and packet loss rate of each node in real time.

[0121] In this embodiment: the security auditing tools include OpenSSL, Wireshark, Cryptool, etc., which are used to monitor the encryption algorithm type, key length and complexity of the encryption process of the node; the network traffic monitoring tools include Wireshark, NetFlow, iperf, etc., which can collect and monitor the bandwidth utilization, delay, packet loss rate, etc. of each node in real time, and measure the response time and packet loss rate by performing regular Ping tests between nodes as indicators of network performance.

[0122] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. An information recording system based on two-way interactive information sharing, characterized in that: include: Data collection module: The data collection module collects the encryption algorithm type, key length information, security information, bandwidth utilization, delay data and packet loss rate of each node; Data processing module: The encryption algorithm type, key length information, security information, bandwidth utilization, delay data and packet loss rate of each node are input into the data processing module. The data processing module cleans the input data and performs standardization processing on the data to output the strength of the encryption algorithm used by the i-th node, the security score of the i-th node and the network performance value of the i-th node; Calculation module: The strength of the encryption algorithm used by the i-th node, the security score of the i-th node, and the network performance value of the i-th node are input into the calculation module, and the calculation module outputs the information dissemination degree, information sharing efficiency, and information security; Adjustment and analysis module: Information dissemination degree, information sharing efficiency and information security are input into the adjustment and analysis module. The adjustment and analysis module adjusts the information dissemination strategy based on the input data, reasonably allocates resources, discovers potential security risks and improves node security protection accordingly.

2. The information recording system based on two-way interactive information sharing according to claim 1 is characterized in that: The computing module includes: an information dissemination submodule, an information sharing submodule and an information security submodule.

3. The information recording system based on two-way interactive information sharing according to claim 2 is characterized in that: The calculation formula of the information dissemination submodule is as follows: in: LCK refers to the degree of information dissemination, n refers to the total number of nodes, LCKA i Refers to the strength of the encryption algorithm used by the i-th node, LCKB i Refers to the security score of the i-th node, LCKC i Refers to the network performance value of the i-th node, LCKD i refers to the connection strength value between the i-th node and the information source, LCKE refers to the maximum propagation limit of the system, and LCKF i refers to the propagation delay of the i-th node, LA refers to LCKF i The weight coefficient, LP refers to the information propagation weight factor; Refers to the influence of each node in the process of information dissemination; Refers to the information dissemination capability of each node; Refers to the effect of node connection strength on information dissemination used to regulate; The processing process of the information dissemination submodule is as follows: the strength of the encryption algorithm used by the i-th node LCKA i , the security score of the i-th node LCKB i and the network performance value LCKC of the i-th node i Input into the information propagation submodule, and the information propagation submodule outputs the information propagation degree LCK.

4. The information recording system based on two-way interactive information sharing according to claim 3 is characterized in that: The calculation formula of the information sharing submodule is as follows: in: LDP refers to information sharing efficiency, DA refers to authentication strength, the comprehensive weight adjustment factor of resource demand and load, LDPA i Refers to the authentication strength of the i-th node, LDPB i Refers to the resource demand of the i-th node, LDPC i Refers to the load of the ith node; Refers to the resource consumption of the i-th node during the information sharing process; Refers to the cost of information sharing process; The processing process of the information sharing submodule is as follows: the information propagation degree LCK and the security score LCKB of the i-th node are combined i The information is input into the information sharing submodule, and the information sharing submodule outputs the information sharing efficiency LDP.

5. The information recording system based on two-way interactive information sharing according to claim 4 is characterized in that: The calculation formula of the information security submodule is as follows: in: IUG refers to information security, IA refers to the weight factor of the vulnerability part on information security, and IUGA i Refers to the attack surface of the ith node; Refers to the negative impact of load, latency, and security risks on information security in the system; Refers to the efficiency of dissemination and sharing on which information security depends; The processing process of the information security submodule is as follows: the information propagation degree LCK, the information sharing efficiency LDP, the load LDPC of the i-th node i and the propagation delay LCKF of the i-th node i Input into the information security submodule, and the information security submodule outputs information security IUG.

6. The information recording system based on two-way interactive information sharing according to claim 5 is characterized in that: The attack surface IUGA of the i-th node in the information security submodule i The calculation process is as follows: in: k refers to the total number of vulnerabilities; PPA i，j Refers to the severity of the jth vulnerability exposed by the i-th node; PPB j Refers to the attack complexity of the j-th vulnerability.

7. The information recording system based on two-way interactive information sharing according to claim 1 is characterized in that: The data acquisition module monitors the encryption algorithm type and key length of the node through the security audit tool, scans the defense strategy of each node through the security assessment tool, and collects information about the protection strategy and known vulnerabilities.

8. The information recording system based on two-way interactive information sharing according to claim 1 is characterized in that: The data collection module collects and monitors the bandwidth utilization, delay data and packet loss rate of each node in real time through a network traffic monitoring tool.

Images