Information recording system based on bidirectional interactive information sharing

Abstract

The application discloses an information recording system based on bidirectional interactive information sharing, 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. The application can help optimize the transmission path and time delay of information by calculating the information propagation degree, and then intelligently select a transmission path with high bandwidth and low delay through the system. The system can accurately calculate the resource consumption of nodes in the information transmission process, and flexibly adjust the resource allocation of nodes under the cooperation of the scheduling mechanism, avoid the low sharing efficiency caused by the overload of nodes, and improve the sharing efficiency of the system. The system can evaluate the data encryption strength and security protection level of each node in detail, ensure the safety of information in the bidirectional interaction process, effectively resist various attacks and information leakage, and make the information recording have excellent safety and high efficiency.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of information sharing recording technology, in particular to an information recording system based on bidirectional interactive information sharing. BACKGROUND

[0002] With the rapid development of Internet technology and the advent of the information age, data transmission and sharing have become an indispensable part of various industries. In modern information systems, especially in security-sensitive fields such as finance, medicine, public security, etc., bidirectional interaction of information protection and data transmission becomes particularly important. Bidirectional interaction can provide more flexible resource scheduling and information feedback mechanisms, making information transmission not only a one-way flow, but also more adaptable and real-time. A shared information recording system refers to a technology for recording and saving shared information between multiple users.

[0003] In existing information recording systems, most of them may rely on a one-way information flow mode, which may not form a good information propagation mechanism between multiple nodes, resulting in delays and information loss in the transmission of information between nodes. Low information propagation reduces the efficiency of system response, which may affect the real-time performance of the system. In addition, the existing information recording system may not be able to effectively utilize the resources between nodes for optimization, resulting in delays and resource waste in the sharing process, low information sharing efficiency, which may affect the real-time performance of information recording and the overall performance of the system. In addition, the existing information system may not be good at security protection, and information may be leaked, tampered with, and lost during the bidirectional interaction process. Therefore, the existing information recording system may not have good security protection performance. SUMMARY

[0004] The present application provides an information recording system based on bidirectional interactive information sharing, which solves the problems raised in the background art.

[0005] To achieve the above-mentioned purpose, the present application provides the following technical solution: an information recording system based on bidirectional interactive information sharing, comprising:

[0006] Data acquisition module: collect the encryption algorithm type, key length information, security information, bandwidth utilization, delay 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, delay data and packet loss rate of each node into the data processing module. The data processing module cleans and standardizes the input 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] The calculation module inputs the strength of the encryption algorithm used by the ith node, the security score of the ith node, and the network performance value of the ith node into the calculation module, and the calculation module outputs information propagation degree, information sharing efficiency, and information security;

[0009] The adjustment analysis module inputs the information propagation degree, the information sharing efficiency, and the information security into the adjustment analysis module, the adjustment analysis module adjusts the information propagation strategy based on the input data, and reasonably allocates resources and discovers potential security risks and corresponding improves node security protection.

[0010] Optionally, the calculation module includes an information propagation submodule, an information sharing submodule, and an information security submodule.

[0011] Optionally, the calculation formula of the information propagation submodule is as follows:

[0012]

[0013] Wherein:

[0014] LCK represents information propagation degree, n represents the total number of nodes, LCKA i represents the strength of the encryption algorithm used by the ith node, LCKB i represents the security score of the ith node, LCKC i represents the network performance value of the ith node, LCKD i represents the contact strength value of the ith node and the information source, LCKE i represents the maximum propagation limit of the system, LCKF i represents the propagation delay of the ith node, LA i represents the weight coefficient of LCKF, LP

[0015] represents the influence of each node in the information propagation process;

[0016] represents the information propagation ability of each node;

[0017] represents the influence of node contact strength on information propagation;

[0018] The processing process of the information propagation submodule is as follows: the strength of the encryption algorithm used by the ith node LCKA i , the security score of the ith node LCKB i , and the network performance value of the ith node LCKC i are input into the information propagation submodule, and the information propagation submodule outputs information propagation degree LCK.

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

[0020]

[0021] Wherein:

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

[0023] refers to the resource consumption of the ith node in the information sharing process.

[0024] refers to the cost in the information sharing process.

[0025] The processing process of the information sharing sub-module is as follows: the information propagation degree LCK and the security score LCKB i of the ith node are input 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] Wherein:

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

[0030] refers to the negative influence of load, delay and security risk in the system on information security.

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

[0032] The processing process of the information security sub-module is as follows: the information propagation degree LCK, the information sharing efficiency LDP, the load LDPC i of the ith node and the propagation delay LCKF i of the ith node are input 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 The calculation process is as follows:

[0034]

[0035] Wherein:

[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 acquisition 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 evaluation tool, and collects information about the protection strategy and known vulnerabilities.

[0040] Optionally, the data acquisition 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.

[0041] Compared with the prior art, the present application has the following advantages:

[0042] First, the information propagation sub-module outputs the information propagation degree, which 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 propagation of information is not only fast but also safe, which is important for bidirectional interactive information sharing, because information not only flows between nodes, but also guarantees its confidentiality and integrity during transmission. 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 propagation degree, it can be determined which nodes play an important role in information propagation, and the information flow path can be optimized to reduce network congestion. Precise evaluation of the contribution of each node in the information recording system helps to dynamically adjust the transmission strategy of information in the system, ensuring that information can quickly and safely reach the target node, thereby improving the scalability and fault tolerance of the system. Through reasonable propagation degree calculation, the system can adapt to the needs of different network environments and ensure efficient propagation of information between different nodes.

[0043] Secondly, the information sharing efficiency is output by the information sharing submodule, which is composed of authentication strength, resource demand and security of nodes, etc., and the resource consumption in the information sharing process is considered to enable the system to identify efficient sharing paths and optimize resource allocation, and the information sharing efficiency calculation can evaluate whether the information sharing in the system is efficient, and can timely find nodes or paths with excessive resource consumption, and can reduce the phenomenon of excessive system load and resource waste in the information sharing process, ensure the smoothness and efficiency of bidirectional interaction, and make the information sharing more secure and efficient through optimizing node authentication and resource demand, and the system can dynamically adjust the information distribution strategy according to the change of the sharing efficiency, and further improve the response speed and accuracy in the bidirectional interaction process.

[0044] Thirdly, the information security is output by the information security submodule, and the calculation of the information security ensures that the information security can be maintained to a certain extent in the efficient sharing process, and the calculation of the information security helps the system to maintain high security in the bidirectional interaction and information sharing process to avoid information leakage or tampering, and through accurate evaluation of node security, the system can dynamically respond to possible security threats to improve the protection capability in the information transmission and sharing process, and 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 when processing sensitive information and important data. BRIEF DESCRIPTION OF DRAWINGS

[0045] Figure 1 The method step flow chart of the information recording system based on bidirectional interaction information sharing;

[0046] Figure 2 The overall structure schematic diagram of the information recording system based on bidirectional interaction information sharing;

[0047] Figure 3 The structure schematic diagram of the calculation module in the information recording system based on bidirectional interaction information sharing. DETAILED DESCRIPTION

[0048] The technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor fall within the scope of protection of the present application.

[0049] The information recording system based on bidirectional interaction information sharing is different from the existing information recording system. Most of the existing information recording systems rely on a one-way information flow mode and cannot form a good information propagation mechanism between multiple nodes, resulting in delays and information loss in the transmission between nodes. The low degree of information propagation 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, many existing information recording systems do not effectively utilize resources between nodes for optimization, resulting in delays and resource waste during sharing, and low information sharing efficiency directly affects the real-time performance of information recording and the overall performance of the system. In addition, there are still shortcomings in security protection in current information systems, especially in the process of bidirectional interaction, such as information leakage, tampering, or loss. Since information may be subject to external malicious attacks or internal tampering during transmission, the existing information recording system may not have good security protection performance.

[0050] The information recording system can help optimize the transmission path and time delay of information by calculating the information propagation degree. The system can intelligently select high-bandwidth and low-delay transmission paths, and can accurately calculate the resource consumption of each node during information transmission. In addition, the system can flexibly adjust the resource allocation of nodes under the scheduling mechanism to avoid low sharing efficiency due to node overload, thereby improving the sharing efficiency of the system. Moreover, the system can evaluate the data encryption strength, security level, authentication mechanism, and other aspects of each node in detail to ensure the security of information during bidirectional interaction, thereby effectively resisting various attacks and information leakage, making the information recording system have excellent security and high efficiency.

[0051] Embodiment one: please refer to Figures 1 to 3 The embodiment provides an information recording system based on bidirectional interaction information sharing, which includes:

[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 and standardizes the input 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] The calculation module inputs 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, and outputs information propagation degree, information sharing efficiency and information security;

[0055] The adjustment analysis module inputs the information propagation degree, the information sharing efficiency and the information security into the adjustment analysis module, adjusts the information propagation strategy based on the input data, reasonably allocates resources, and discovers potential security risks and corresponding improves node security protection.

[0056] The calculation module comprises an information propagation submodule, an information sharing submodule and an information security submodule.

[0057] In the embodiment, the information propagation submodule ensures effective propagation of information between nodes, the information sharing submodule provides conditions for optimizing resource consumption in the sharing process, avoids excessive load and resource waste, and the information security submodule ensures that information is not leaked or tampered with during transmission, thereby improving the reliability and efficiency of bidirectional interaction in the system as a whole. The calculation module considers multiple factors such as node performance, resource demand and security, helps the system to effectively control resource consumption and security risks in the information sharing process, thereby improving the sharing efficiency of the system. The system considers factors such as node load, time delay, resource consumption and security, and multiple submodules can provide flexible optimization means for the information recording system, which enables the system to dynamically adjust resource allocation under different network environments and load conditions, and ensures the security and stability of information recording.

[0058] Please refer to Figures 1 to 3 , the processing process of the information propagation submodule is as follows:

[0059]

[0060] Among them:

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

[0062] LCKA iLCKA refers to the encryption strength of the i th node, common encryption strengths include the bit number of encryption algorithms such as AES, RSA, etc., such as AES-256, which is 256-bit encryption strength, the bit number of encryption is obtained through algorithm configuration, if AES-128 is used, it is 128-bit encryption strength, this item needs to be normalized, the maximum and minimum value normalization processing form is adopted, the encryption strength of the i th node is first subtracted from the minimum value of the encryption strength of all nodes, and then divided by the maximum value of the encryption strength of all nodes minus the minimum value, the maximum and minimum value normalization processing means is one of the technical means known in the art and other similar technical fields;

[0063] LCKB i LCK refers to the security score of the i th node, which is evaluated by the vulnerability scanning tools Nessus and OpenVAS, the higher the score, the stronger the security, the node is scanned by Nessus and OpenVAS, and a score of 0 to 10 is obtained, indicating the security of the node, the security score obtained by the scanning tool is input into the formula;

[0064] LCKC i LCK refers to the network performance value of the i th node;

[0065] LCKC i =SA i / SB i

[0066] Wherein: SA i LCK refers to the bandwidth value of node i, which is tested by iperf, and the result unit is Mbps;

[0067] SB i LCK refers to the delay value of node i, which is measured by the ping tool to measure the round trip time of the node, and the unit is ms;

[0068] Then during normalization, SA i and SB i are normalized by the maximum and minimum values and then input into the formula;

[0069] LCKD i LCK refers to the contact 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, and the number of connections and the number of requests between the information source are obtained through network connection monitoring tools;

[0070] LCKD i =MA i / MB i

[0071] Wherein: MA iThe number of connections refers to node i, MB i The measured time period is referred to in seconds;

[0072] In the formula for calculating the MA i and MB i input into the LCKD i , it is necessary to prioritize the normalization of the MA i and MB i obtained by the maximum and minimum value processing method, simply put, MA i first subtract the minimum value of MA i , and then divide the whole by the maximum value of MA i minus the minimum value of MA i , which is the normalization processing means of the prior art;

[0073] LCKE refers to 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. The system defines it as the maximum bandwidth value, such as 1Gbps;

[0074] LCKF i refers to the propagation delay of the i-th node, which represents the propagation delay of information from the source node to the target node, measured by the network test tool ping from the source node to the target node;

[0075] LA refers to the weight coefficient of LCKF i ;

[0076] LP refers to the information propagation weight factor;

[0077] Refers to the influence of each node in the process of information propagation, the function of this summation formula is to sum the propagation degrees of all nodes, in the information recording system based on bidirectional interactive information sharing, the propagation ability of each node is closely related to the encryption strength, node security and network performance and other factors, this summation formula can consider the characteristics of each node;

[0078] Refers to the information propagation ability of each node, the strength of the encryption algorithm used by the i-th node LCKA 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 of the i-th node LCKB i represents the protection ability of the node, the node with high security can better ensure that the information is not disturbed, the network performance value of the i-th node LCKC idirectly affects the transmission efficiency and delay of information, this part reflects the effectiveness of each node in information propagation, for information recording system, the information propagation ability of different nodes will affect the overall information flow efficiency of the system, such as a node with poor network performance, that is, LCKC i The lower the value, the slower the propagation of information, and the node with high encryption strength and high security will ensure the security and confidentiality of information;

[0079] refers to the influence of adjusting the contact strength of the node on information propagation, the logarithm function suppresses the growth of contact strength, and avoids the exponential growth of propagation degree caused by excessive contact strength, and the effect of adding 1 is to prevent the value of LCKD i Too small will result in a logarithm value of 0, which is the bottom of the logarithm function, thereby avoiding the value of propagation degree being infinitely compressed, which ensures that the contact strength of the node will not increase the information propagation degree unlimitedly, but will moderate the contact strength of the information source while increasing the propagation degree, for a bidirectional interaction system, reasonable adjustment of the contact strength can ensure balanced propagation of information in the network;

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

[0081] In this embodiment: this submodule calculates the information propagation degree, which is an index for evaluating the effectiveness and strength of information propagation from one node to another node, in an information recording system based on bidirectional interactive information sharing, the propagation 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 ith node, the security score of the ith node, and the network performance value of the ith node, it is ensured that the propagation of information is not only fast, that is, the network performance is high, but also safe, that is, the encryption strength is high and the node security is high, which is particularly important for bidirectional interactive information sharing, because information not only flows between nodes, but also must ensure its confidentiality and integrity during transmission, at the same time, the propagation delay of the ith node is an important factor affecting the real-time performance of information sharing, the propagation delay term LA×LCKF iThe negative impact of the time delay on the information propagation degree is considered, so that the system can better manage the response speed of the nodes when recording and sharing information. By calculating the information propagation degree LCK, it can be determined which nodes play an important role in information propagation, thereby optimizing the information flow path, reducing network congestion, and in a bidirectional interactive information recording system, accurately assessing the contribution of each node helps to dynamically adjust the transmission strategy of information in the system, ensuring that information can quickly and safely reach the target node, which is used to improve the scalability and fault tolerance of the system. Through reasonable propagation degree calculation, the system can adapt to the needs of different network environments and ensure efficient propagation of information between different nodes.

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

[0083]

[0084] Among them:

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

[0086] LDPA i refers to the authentication strength of the ith node, which is 2 when using double authentication 2FA and 1 when using single password authentication, determined by 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 ith node, which refers to the resource consumption of the node when sharing information, usually including CPU, memory, storage, etc., which is monitored in real time by 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, and CC i refers to the disk usage ratio of node i;

[0090] CA i , CB i and CC i are input to the LDPB iThe maximum and minimum values need to be normalized in the calculation formula, and the normalization method is one of the commonly known methods in the field and other similar fields, which will not be described here.

[0091] LDPC i LDPi represents the load of the i-th node, LDPC i LDPi represents the load of the i-th node, LDPC i LDPi represents the load of the i-th node, LDPC

[0092] LDPi represents the load of the i-th node, LDPC

[0093] LDPi represents the load of the i-th node, LDPC

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

[0095] In this embodiment: this submodule calculates the information sharing efficiency, which measures the efficient degree of information sharing in the whole system. The information sharing efficiency balances the information propagation degree and the resource consumption in the sharing process, which is determined by the authentication strength, resource demand, security and load of the node. The resource consumption in the information sharing process considered by this submodule enables the system to identify efficient sharing paths and optimize resource allocation. The load of each node affects the efficiency of information sharing. This submodule adds the load term LDPC iThe high-load node can reflect the negative impact of the system information sharing efficiency, and the node with too high load can increase the sharing cost, so it is necessary to dynamically adjust the task allocation of the node with high load. Through the calculation of the information sharing efficiency LDP, it can be evaluated whether the information sharing in the system is efficient, and the node or path with excessive resource consumption can be found in time. In the information sharing process, the phenomenon of excessive system load and resource waste is reduced, the smoothness and efficiency of bidirectional interaction are ensured, the authentication and resource demand of the node are optimized, the information sharing is safer and more efficient, and the system can dynamically adjust the information distribution strategy according to the change of the sharing efficiency, so as to improve the response speed and accuracy in the bidirectional interaction process.

[0096] Please refer to Figures 1 to 3 The processing process of the information security submodule is as follows:

[0097]

[0098] Among them:

[0099] 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, IUGA i represents the security vulnerabilities exposed by the node and the potential attack risk. It 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 the exposed ports, services and known vulnerabilities. Finally, the IUGA i is normalized by the maximum and minimum value normalization processing 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. The CVSS score is usually used to quantify the severity of the vulnerability. The score ranges from 0 to 10. The higher the score, the greater the risk of the vulnerability. The node i is scanned by the vulnerability scanning tool, OpenVAS and Nessus. The tool will list all the discovered vulnerabilities and assign a CVSS score to each vulnerability.

[0104] PPB jPPB j refers to the attack complexity of the jth vulnerability, and the attack complexity is obtained through analysis of security experts and scoring criteria in a vulnerability database, some vulnerabilities are evaluated according to known attack methods, and a vulnerability with high complexity may require special attack tools or high-level skills, generally, the value of the attack complexity PPB j is larger, indicating that the attack is more difficult, and the smaller value indicates that the attack is easier, the attack complexity can be inferred from the public description and related information of the vulnerability, or directly referenced from the public score in the vulnerability database;

[0105] refers to the negative impact of load, delay and security risk on information security, and the score of information security is reduced by introducing a subtraction form to reflect the risk and negative impact, 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 the node is too large, the delay is too long or the attack surface is too wide, the security of the system will be reduced, and the influence of high load, delay and attack surface on the overall information security of the system is avoided;

[0106] refers to the efficiency of propagation and sharing on which the information security depends, and the information propagation degree and the information sharing efficiency jointly affect the security protection capability of information, the information propagation degree and the information sharing efficiency are combined together to ensure that the information not only can be effectively propagated, but also can maintain a high sharing efficiency in the propagation process, so as to protect the security of information;

[0107] The processing process of the information security submodule is as follows: the information propagation degree LCK, the information sharing efficiency LDP, the load LDPC i of the ith node and the propagation delay LCKF i of the ith node are input into the information security submodule, and the information security submodule outputs the information security IUG.

[0108] In this embodiment: the sub-module calculates the information security, which plays an important role in the system, especially in the process of bidirectional interaction and information sharing. The product of the information dissemination degree LCK and the information sharing efficiency LDP is the basis for security protection. Only if the information can be effectively disseminated and shared efficiently, the system can realize safe bidirectional interaction. The system ensures that the information security can be maintained in the process of efficient sharing. The calculation of information security helps the system to maintain high security in the process of bidirectional interaction and information sharing, avoid information leakage or tampering, and improve the protection capability in the process of information transmission and sharing. Through accurate assessment of the security of nodes, the system can dynamically respond to possible security threats and improve the protection capability in the process of information transmission and sharing. When dealing with sensitive information or important data, the calculated security result helps the system to take appropriate protective measures according to the actual risk situation to ensure the reliability of the information recording system.

[0109] It is worth noting that the further operation of information sharing efficiency LDP affects the information dissemination weight factor LP in the information dissemination sub-module, and then continuously optimizes the information dissemination degree LCK, information sharing efficiency LDP and information security IUG. The specific processing process is as follows:

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

[0111] Second: set the iteration termination condition:

[0112] Termination condition one: the iteration number is 100 times;

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

[0114] Wherein:

[0115] LP new denotes the updated information dissemination weight factor, LP old denotes the updated information dissemination weight factor, and α denotes the adjustment coefficient, which is used to control the influence strength 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 its information sharing efficiency. If some nodes consume more resources in the information sharing process, i.e., the information sharing efficiency is low, their propagation weight will decrease, and vice versa. This dynamic adjustment helps the system adapt to changing network conditions and node performance. In a bidirectional 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 propagation path of information according to the real-time performance and information sharing efficiency of the nodes, ensuring that information can be propagated through the most effective channel. The iterative process also helps maintain the security of information. 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 some extent. By iteratively adjusting LP, the system can optimize the role of nodes in information propagation according to information sharing efficiency. Information sharing efficiency directly reflects the resource consumption and contribution of each node in the information sharing process. A high sharing efficiency of a node means it can efficiently participate in information propagation, so we should increase its weight in the propagation process. Conversely, if the sharing efficiency is low, its weight should be reduced. By correlating sharing efficiency and 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, the information recording system system is composed of multiple sub-modules in the method. By using the strength LCKA i of the encryption algorithm used by the ith node, the security score LCKB i of the ith node, and the network performance value LCKC iThe information propagation degree LCK is output by the information propagation submodule. The information propagation submodule is based on the comprehensive evaluation of the strength of the encryption algorithm used by the ith node, the security score of the ith node, and the network performance value of the ith node, to ensure that the propagation of information is not only fast but also secure, which is important for bidirectional interactive information sharing. Because information not only flows between nodes but also must ensure its confidentiality and integrity during transmission, the propagation delay of the ith node is an important factor affecting the real-time performance of information sharing. By calculating the information propagation degree LCK, it can be determined which nodes play an important role in information propagation, and the information flow path can be optimized to reduce network congestion. Accurate assessment of the contribution of each node in the bidirectional interactive information recording system helps to dynamically adjust the transmission strategy of information in the system, ensuring that information can quickly and securely reach the target node, which improves the scalability and fault tolerance of the system. By reasonably calculating the propagation degree, the system can adapt to the needs of different network environments and ensure efficient propagation of information between different nodes.

[0118] The information propagation degree LCK and the security score LCKB of the ith node are combined to calculate the information sharing efficiency LDP of the ith node. i The information sharing efficiency LDP is output by the information sharing submodule. The information sharing submodule is composed of the authentication strength, resource demand, security, and load of the node. The submodule considers the resource consumption in the information sharing process to enable the system to identify efficient sharing paths and optimize resource allocation. 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 in the system is efficient, and the nodes or paths with excessive resource consumption can be found in a timely manner to reduce the phenomenon of excessive system load and resource waste during information sharing, ensuring the smoothness and efficiency of bidirectional interaction. By optimizing node authentication and resource demand, information sharing is more secure and efficient. The system can dynamically adjust the information distribution strategy according to the changes in sharing efficiency, thereby improving the response speed and accuracy during bidirectional interaction.

[0119] The information propagation degree LCK, the information sharing efficiency LDP, the load LDPC of the ith node, and the propagation delay LCKF of the ith node are combined to calculate the information sharing efficiency LDP of the ith node. i i ​The input is input into the information security submodule, and the information security submodule outputs information security IUG. The calculation of this submodule ensures that the security of the information can be maintained to a certain extent in the efficient sharing process. The information security calculation helps the system to maintain high security in the process of bidirectional interaction and information sharing to avoid information leakage or tampering. Through accurate assessment of the security of the nodes, the system can dynamically respond to possible security threats, improve the protection capability in the process of information transmission and sharing, and calculate the security result when handling sensitive information and important data. The system can help the system to take appropriate protective measures according to the actual risk situation to ensure the reliability of the information recording system.

[0120] Embodiment two: please refer to Figure 1 、 Figure 2 and Figure 3 , the data acquisition module monitors the encryption algorithm type, key length of the node through the security audit tool, scans the defense strategy of each node through the security evaluation tool, and collects information about the protection strategy and known vulnerabilities; the data acquisition module collects and monitors the bandwidth utilization, delay data and packet loss rate of each node in real time through the network traffic monitoring tool.

[0121] In this embodiment: the security audit tool is OpenSSL, Wireshark and Cryptool, etc., to monitor the encryption algorithm type, key length and complexity of the encryption process of the node, and the network traffic monitoring tool is Wireshark, NetFlow and iperf, etc., which can collect and monitor the bandwidth utilization, delay, packet loss rate of each node in real time, and measure the response time and packet loss rate through periodic Ping test between nodes as the index of network performance.

[0122] Although the embodiments of the present application have been shown and described, it can be understood by those of ordinary skill in the art that various changes, modifications, replacements and variations can be made to these embodiments without departing from the principles and spirits of the present application, and the scope of the present application 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 acquisition module: Collects information on encryption algorithm type, key length, security information, bandwidth utilization, latency data, and packet loss rate for each node. Data processing module: Input the encryption algorithm type, key length information, security information, bandwidth utilization, latency data and packet loss rate of each node into the data processing module. The data processing module cleans the input data and performs data standardization 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: Based on the strength of the encryption algorithm used by the i-th node, LCKA i The security score LCKB of the i-th node i The network performance value LCKC of the i-th node i The connection strength value (LCKD) between the i-th node and the information source i The system's maximum propagation limit LCKE and the propagation delay LCKF of the i-th node. i The system outputs the information propagation limit (LCK). By calculating the information propagation limit (LCK), the system can adapt to the needs of different network environments and ensure the efficient propagation of information between different nodes. LDPA based on the authentication strength of the i-th node i The resource requirement LDPB of the i-th node i and the load of the i-th node LDPC i It combines information dissemination efficiency (LCK) to output information sharing efficiency (LDP). By calculating information sharing efficiency (LDP), the information distribution strategy can be dynamically adjusted according to changes in sharing efficiency, thereby improving the response speed and accuracy in the two-way interaction process. The weighting factor IA, which determines the impact of the vulnerability on information security, and the attack surface IUGA of the i-th node. i It combines Information Dissemination Capacity (LCK) and Information Sharing Efficiency (LDP) to output Information Security Guarantee (IUG). The calculation of Information Security Guarantee (IUG) ensures that information security can be maintained to a certain extent during efficient sharing, and maintains a high level of security during two-way interaction and information sharing to prevent information from being leaked or tampered with. Adjustment and Analysis Module: Input information dissemination rate, information sharing efficiency, and information security into the adjustment and analysis module. Based on the input data, the adjustment and analysis module adjusts the information dissemination strategy, allocates resources reasonably, and identifies potential security risks and correspondingly improves node security protection.

2. The information recording system based on two-way interactive information sharing according to claim 1, 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, characterized in that: The calculation formula for the information sharing submodule is as follows: ； in: LDP refers to Information Sharing Efficiency, DA refers to Authentication Strength, Resource Requirements, and Load Weighting Adjustment Factor, and LDPA refers to... i Refers to the authentication strength of the i-th node, LDPB i Refers to the resource requirements of the i-th node, LDPC i Refers to the load of the i-th node; This refers to the resource consumption of the i-th node during the information sharing process; It refers to the cost in the process of information sharing; The processing procedure 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, which then outputs the information sharing efficiency (LDP).

4. The information recording system based on two-way interactive information sharing according to claim 3, characterized in that: The calculation formula for the information security submodule is as follows: ； in: IUG refers to Information Security, IA refers to the weighting factor of the impact of vulnerabilities on Information Security, and IUGA refers to... i Refers to the attack surface of the i-th node; This refers to the negative impact of system load, latency, and security risks on information security. It refers to the efficiency of dissemination and sharing upon which information security depends; The processing procedure of the information security submodule is as follows: Information propagation degree (LCK), information sharing efficiency (LDP), and the load of the i-th node (LDPC) are calculated. i The propagation delay LCKF of the i-th node i Input is sent to the information security submodule, which then outputs the information security IUG.

5. The information recording system based on two-way interactive information sharing according to claim 4, 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 This refers to the severity of the j-th vulnerability exposed by the i-th node; PPB j This refers to the attack complexity of the j-th vulnerability.

6. The information recording system based on two-way interactive information sharing according to claim 1, characterized in that: The data acquisition module uses security auditing tools to monitor the encryption algorithm type and key length of nodes, and uses security assessment tools to scan the defense strategy of each node, collecting information about the protection strategy and known vulnerabilities.

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

Images