A multi-level encrypted cloud chat social record synchronization system
The cloud-based chat and social record synchronization system with multi-level encryption solves the problems of uneven storage, high data synchronization latency, and key leakage in traditional cloud storage systems. It achieves secure and reliable distributed storage and dynamic encrypted synchronization of social records, making it suitable for complex multi-user scenarios.
Patent Information
- Application Number
- CN202510604645.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-12
- Publication Date
- 2025-11-07
- Estimated Expiration
- 2045-05-12
AI Technical Summary
Traditional cloud-based social record storage systems suffer from problems such as uneven load on storage nodes, low efficiency in cross-node data retrieval, high data synchronization latency, easy data loss during recovery, and encryption strategies that cannot adapt to different device terminals. In particular, they are prone to key leakage risks and secondary data leakage in multi-user scenarios.
The cloud-based chat and social record synchronization system employs multi-level encryption. It constructs an interactive network through a storage node management module, and combines object retrieval, node location, and data recovery modules to implement a dynamic encryption synchronization mechanism. Multi-level encryption is performed based on terminal device type and sensitivity level. The Pagerank algorithm is used to calculate the optimal storage node, ensuring that data is distributed and stored in low-association-weight node groups and verified through dynamic key authorization.
It significantly improves the security and reliability of cloud backup of social records, avoids the single point of attack risk of centralized storage, ensures the tamper-proof and privacy-preserving nature of the data chain, and is suitable for complex social scenarios involving multiple devices and multiple users.
Smart Images

Figure FT_1 
Figure FT_2 
Figure FT_3
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of cloud encryption, in particular to a multi-level encrypted cloud chat social record synchronization system. BACKGROUND
[0002] With the rapid development of mobile internet technology, cloud storage has become the core supporting technology for cross-device synchronization of social chat records. Traditional cloud social record storage systems usually use single-node centralized storage or simple distributed backup strategies, which have problems such as uneven load distribution of storage nodes, low cross-node data retrieval efficiency, etc. Especially in the multi-user association scenario, since the topological relationship of chat objects on the cloud storage node is not considered, frequent cross-node access is caused during data synchronization, increasing transmission delay and storage redundancy. In addition, existing systems rely on local backup or cloud redundant copies for data recovery, which can easily cause the associated data chain to break when the main storage node fails, making it difficult to achieve integrity recovery based on the social relationship network.
[0003] In terms of data security, existing encryption synchronization mechanisms often use fixed-level encryption and decryption strategies, which cannot adapt to different device terminal types and dynamically changing sensitive data protection needs. For example, when a user requests to synchronize historical chat records through a new device, the traditional scheme cannot verify the trust relationship between devices, which can easily cause key leakage risks. At the same time, the permission control of the restored data and the original data lacks differentiated processing, which can cause secondary leakage of the repaired data. SUMMARY
[0004] To solve the above technical problems, a multi-level encrypted cloud chat social record synchronization system is provided, which solves at least one of the technical problems mentioned in the background.
[0005] To achieve the above purposes, the technical scheme adopted by the present application is:
[0006] A multi-level encrypted cloud chat social record synchronization system, comprising:
[0007] A storage node management module for obtaining all storage nodes of a cloud storage center and constructing an interaction association network between the storage nodes according to historical operation and maintenance data;
[0008] An object retrieval module for identifying the self object of the social record to be uploaded, retrieving the storage record of the self object in the cloud storage center, and triggering:
[0009] A record updating unit for updating the corresponding storage content using the new chat social record of the terminal when there is a storage record;
[0010] An associated object acquisition unit extracts the opposite object in all chat social records of the terminal when there is no storage record;
[0011] A node positioning module is configured to query the distribution of all associated opposite objects in the corresponding storage nodes of the cloud storage center;
[0012] A storage optimization decision module determines the optimal storage node of the social record based on the storage node distribution of the opposite object and the interaction association network through node access frequency analysis and path topology calculation;
[0013] A data recovery module extracts the corresponding chat record from the storage node of the associated opposite object for recovery when detecting the loss of cloud storage record, and adds an identifiable recovery mark to the recovered data;
[0014] A security synchronization module implements a multi-level encryption synchronization mechanism including transmission encryption and storage encryption according to the terminal device type and the sensitivity level of the synchronization record when the device terminal requests data synchronization.
[0015] Preferably, the multi-level encryption synchronization mechanism is specifically:
[0016] If the requested device terminal and the uploaded device terminal identification code are the same, and the request to synchronize the chat social record has no recovery mark, then direct synchronization is performed;
[0017] If the requested device terminal and the uploaded device terminal identification code are the same, and the request to synchronize the chat social record has a recovery mark, then the request to synchronize the chat social record is encrypted, and the opposite object identity is used as the key. Only when the requested device terminal obtains the key authorization of the opposite object, synchronization is performed;
[0018] If the requested device terminal and the uploaded device terminal identification code are not the same, the request to synchronize the chat social record is encrypted, and the uploaded device terminal identification code is used as the key. Only when the requested device terminal obtains the key authorization of the uploaded device terminal, synchronization is performed.
[0019] Preferably, the specific steps of acquiring all storage nodes of the cloud storage center and constructing the interaction association network between the storage nodes based on historical operation and maintenance data are as follows:
[0020] If there is a direct communication link between the two storage nodes, a direct communication link is established;
[0021] If there is no direct communication link between the two storage nodes but there is a multi-hop path composed of intermediate nodes, a multi-hop communication link is established;
[0022] For a direct communication link, the propagation weight between the storage nodes is directly obtained based on historical operation and maintenance interaction data between the storage nodes.
[0023] For multi-hop communication link, the propagation weight between two nodes is the product of the propagation weight between all adjacent nodes that constitute the multi-hop propagation link;
[0024] The propagation weight of a storage node to itself is set to 1.
[0025] Preferably, the optimal storage node of the social record is determined based on the distribution of the storage nodes of the opposite object and the interaction correlation network, through node access frequency analysis and path topology calculation, and specifically includes:
[0026] Based on the storage nodes of the opposite object, a first storage node set is constructed;
[0027] Based on the propagation weight between each element in the first storage node set and each storage node, the central index value of each storage node to the first storage node set is calculated;
[0028] The storage node corresponding to the minimum value of the central index value is screened out as the optimal storage node of the social record.
[0029] Preferably, the calculation of the central index value of each storage node to the first storage node set based on the propagation weight between each element in the first storage node set and each storage node specifically includes:
[0030] Based on the Pagerank algorithm, a global central index formula is constructed;
[0031] Based on the global central index formula, at least one iteration calculation is performed to obtain the global central index value of the elements of the first storage node set;
[0032] Based on the global central index value of the elements of the first storage node set and the propagation weight between each element in the first storage node set and each storage node, the central index value of the storage node is calculated through the central index formula;
[0033] The global central index formula is specifically:
[0034]
[0035] The central index formula is specifically:
[0036]
[0037] Wherein, is a set composed of all storage nodes in the cloud storage center, is the total number of all storage nodes in the cloud storage center, is the sum of the propagation weights of t to all other storage nodes, a propagation weight of the jth element in the first storage node set for t, a kth iteration value of the global center index for t, a kth iteration value of the global center index of the jth element in the first storage node set;
[0038] a kth iteration value of the center index of the ith storage node, a damping coefficient, a first storage node set, a jth element in the first storage node set, a sum of the propagation weights of the jth element in the first storage node set for all storage nodes, a propagation weight of the jth element in the first storage node set for the ith storage node.
[0039] Preferably, when the cloud storage record loss is detected, the corresponding chat record is extracted from the storage node of the associated opposite object for recovery, and a recognizable recovery mark is added to the recovered data, and the recovery mark specifically comprises:
[0040] When the cloud storage record loss is detected, the opposite object corresponding to the lost data is obtained, which is recorded as a backup object, and the chat social record storage node of the backup object is retrieved from the cloud storage center, which is recorded as a backup storage node;
[0041] The backup object is taken as the self object value, and the self object corresponding to the lost data is taken as the opposite object value, all chat social records meeting the conditions are retrieved from the backup storage node, which are recorded as backup chat social records;
[0042] The lost chat social record data is recovered based on the content of the backup chat social record.
[0043] Compared with the prior art, the present application has the following beneficial effects:
[0044] The application significantly improves the security and reliability of social record cloud backup through intelligent storage node distribution and dynamic encryption mechanism. The core advantage is that based on the storage node topology analysis of chat associated objects, the multi-party object data with social association is stored in the independent node group with low interaction link weight or physical isolation, so that it is difficult for attackers to obtain complete associated data chain through a single intrusion path, effectively avoiding the risk of "single point attack and whole chain leakage" in traditional centralized storage. At the same time, combined with the propagation weight calculation of multi-hop communication link, the necessary recovery path between associated object storage nodes is ensured, and the attack isolation degree between node groups is maintained, forming a "distributed storage and associated recovery" security backup architecture. Even if part of the nodes are attacked or fail, the complete record can still be quickly reconstructed through the dispersed nodes of the other objects, and the recovered data needs to be authorized and verified by dynamic key, which double guarantees the anti-tampering and privacy of the data chain.
[0045] The application dynamically adjusts the key rule according to the device identification and recovery mark through the multi-level encryption synchronization mechanism, so that the backup data stored in dispersion needs to meet the node topology authorization and device identity verification to access, even if the attacker obtains part of the node data, still cannot decrypt the complete social chain due to the lack of associated device key. This "topology isolation + dynamic encryption" double protection mechanism fundamentally solves the vulnerability that the backup data is easily penetrated horizontally in the traditional scheme, and is especially suitable for complex social scenarios across devices and multiple users. BRIEF DESCRIPTION OF DRAWINGS
[0046] Figure 1 The multi-level encryption cloud chat social record synchronization system structure block diagram proposed by the application;
[0047] Figure 2 The working flow chart of the multi-level encryption cloud chat social record synchronization system proposed by the application;
[0048] Figure 3 The method flow chart for determining the optimal storage node of the social record proposed by the application;
[0049] Figure 4 The architecture diagram of the electronic device in the present scheme;
[0050] Figure 5 The structure diagram of the computer readable storage medium in the present scheme.
[0051] The figure mark is:
[0052] 500-electronic device; 501-bus; 502-CPU; 503-ROM; 504-RAM; 505-communication port; 506-input / output component; 507-hard disk; 508-user interface; 600-computer readable storage medium. Detailed Implementation
[0053] The following description is intended to disclose the invention and enable those skilled in the art to implement it. The preferred embodiments described below are merely examples, and other obvious variations will occur to those skilled in the art.
[0054] Reference Figure 1 As shown, a multi-level encrypted cloud-based chat social record synchronization system includes:
[0055] The storage node management module is used to obtain all storage nodes in the cloud storage center and build an interactive network between storage nodes based on historical operation and maintenance data.
[0056] The object retrieval module is used to identify the user's social media records that need to be uploaded, retrieve the stored records of that user from the cloud storage center, and trigger actions based on the retrieval results.
[0057] The record update unit updates the corresponding stored content using newly added chat and social records from the terminal when stored records exist.
[0058] The associated object retrieval unit extracts the other party object from all chat and social records of the terminal when no stored record exists.
[0059] The node location module is used to query the distribution of storage nodes corresponding to all associated peer objects in the cloud storage center;
[0060] The storage optimization decision module determines the optimal storage node for social records based on the storage node distribution and interactive relationship network of the other party object, through node access frequency analysis and path topology calculation.
[0061] The data recovery module, when it detects the loss of records in cloud storage, retrieves the corresponding chat history from the storage node of the associated other party for recovery, and adds a recognizable recovery mark to the recovered data;
[0062] The secure synchronization module implements a multi-level encrypted synchronization mechanism, including transmission encryption and storage encryption, based on the terminal device type and the sensitivity level of the record to be synchronized when the device terminal requests data synchronization.
[0063] Specifically, refer to Figure 2 As shown, the working steps of the above system are as follows:
[0064] Obtain all storage nodes in the cloud storage center;
[0065] Based on historical operation and maintenance data of the cloud storage center, construct an interactive network between all storage nodes of the cloud storage center;
[0066] The chat social record of the own object needs to be uploaded to the cloud storage center, and the cloud storage center is searched to determine whether the own object has a storage record in the cloud storage center. If yes, the storage record is updated based on the chat social record of the terminal. If no, all chat social records of the terminal are obtained;
[0067] All the storage nodes of the opposite objects in the cloud storage center are obtained;
[0068] Based on the storage nodes of all opposite objects in the cloud storage center, the optimal storage node of the chat social record is determined in combination with the interaction association network between all storage nodes of the cloud storage center;
[0069] The chat social record is uploaded to the determined optimal storage node of the chat social record;
[0070] If the storage record of the cloud storage center is lost, the chat social record of the opposite object is extracted from the opposite object based on the lost storage record, and the lost storage record is recovered, and the recovered storage record is attached with a recovery identifier;
[0071] The specific implementation is as follows:
[0072] When the cloud storage record is detected to be lost, the opposite object corresponding to the lost data is obtained, which is recorded as a backup object, and the chat social record storage node of the backup object is retrieved from the cloud storage center, which is recorded as a backup storage node;
[0073] The backup object is taken as the own object value, and the own object corresponding to the lost data is taken as the opposite object value, all chat social records meeting the conditions are retrieved from the backup storage node, which are recorded as backup chat social records;
[0074] The lost chat social record data is recovered based on the content of the backup chat social record;
[0075] When the device terminal requests to synchronize the chat social record from the cloud, the multi-level encryption is adopted for record synchronization based on the device terminal attribute and the chat social record attribute of the request synchronization.
[0076] The security and reliability of the social record cloud backup are significantly improved through intelligent storage node distribution and dynamic encryption mechanism. The core advantage is that based on the storage node topology analysis of the chat associated object, the multi-party object data with social association is stored in the independent node group with low interaction link weight or physical isolation, so that the attacker cannot obtain the complete associated data chain through a single intrusion path, effectively avoiding the risk of "single point attack and whole chain leakage" in traditional centralized storage. At the same time, combined with the propagation weight calculation of multi-hop communication link, the necessary recovery path between the associated object storage nodes is ensured, and the attack isolation degree between the node groups is maintained, forming a "distributed storage and associated recovery" security backup architecture. Even if part of the nodes are attacked or failed, the complete record can still be quickly reconstructed through the dispersed nodes of the opposite object, and the recovered data needs to be authorized and verified by the dynamic key, which double guarantees the anti-tampering and privacy of the data chain.
[0077] Specifically, the multi-level encryption synchronization mechanism is:
[0078] If the device terminal of the request and the device terminal identification code of the upload are the same, and there is no recovery identification for the request to synchronize the chat social record, then the synchronization is directly performed;
[0079] If the device terminal of the request and the device terminal identification code of the upload are the same, and there is a recovery identification for the request to synchronize the chat social record, then the chat social record is encrypted, and the opposite object identification is used as the key. Only when the device terminal of the request obtains the key authorization of the opposite object, the synchronization is performed.
[0080] If the device terminal of the request and the device terminal identification code of the upload are not the same, the chat social record is encrypted, and the identification code of the upload device terminal is used as the key. Only when the device terminal of the request obtains the key authorization of the upload device terminal, the synchronization is performed.
[0081] Through the multi-level encryption synchronization mechanism, the key rules are dynamically adjusted according to the device identification and recovery mark, so that the backup data stored in dispersion needs to meet the node topology authorization and device identity verification to access. Even if the attacker obtains part of the node data, it is still impossible to decrypt the complete social chain due to the lack of associated device key. This "topology isolation + dynamic encryption" double protection mechanism fundamentally solves the vulnerability of horizontally penetrating backup data in traditional solutions, and is especially suitable for complex social scenarios across devices and multiple users.
[0082] The specific steps for obtaining all storage nodes of the cloud storage center and constructing the interactive association network between the storage nodes according to the historical operation and maintenance data are as follows:
[0083] If there is a direct communication link between the two storage nodes, a direct communication link is established;
[0084] If there is no direct communication link between two storage nodes but there is a multi-hop path composed of intermediate nodes, a multi-hop communication link is established;
[0085] For a direct communication link, the propagation weight between storage nodes is directly obtained based on historical operation and maintenance interaction data between storage nodes;
[0086] For a multi-hop communication link, the propagation weight between two nodes is the product of the propagation weights between all adjacent nodes that constitute the multi-hop propagation link;
[0087] The propagation weight of a storage node to itself is set to 1.
[0088] In a direct communication link, the propagation weight between nodes is calculated by collecting the attack propagation link direction between nodes within a set update period, and the calculation method is: , is the updated propagation weight between node a and node b, is the propagation weight between node a and node b after the last update period, is the ratio of the number of attack events propagated by node a and node b to the number of attack events involving node a in the current period, and α and β are time forgetting coefficients. When the propagation weight between nodes is updated in multiple periods, the value of β is increased to ensure that the propagation weight can accurately reflect the node interaction state in the latest period. The propagation weight reflects the probability of propagating attacks from one node to another node;
[0089] For a multi-hop communication link, the propagation weight between nodes is calculated by the product of the propagation weights between all adjacent nodes that constitute the multi-hop propagation link. It can be understood that if there are multiple multi-hop propagation links between two nodes, the propagation weight between the two nodes is the maximum value of the propagation weights of the multiple multi-hop propagation links.
[0090] Referring to Figure 3 , based on the storage node distribution and interaction association network of the opposite object, the optimal storage node of the social record is determined by node access frequency analysis and path topology calculation, which specifically includes:
[0091] Based on the storage node of the opposite object, a first storage node set is constructed;
[0092] Based on the propagation weight between each element in the first storage node set and each storage node, the central index value of each storage node to the first storage node set is calculated.
[0093] The storage node corresponding to the minimum central index value is selected as the optimal storage node of the social record.
[0094] The social record storage security and access efficiency are synergistically optimized through a topologically-aware storage node dynamic screening mechanism. Specifically, based on the first storage node set constructed according to the nodes where the associated objects are located, combined with the multi-level calculation of the propagation weight in the interaction association network, the pivotal degree and risk exposure of each candidate node in the global topology can be accurately quantified. By preferentially selecting the node with the minimum central indicator value as the optimal storage location, the data is effectively stored in the marginalized nodes with low connection density and weak path dependence in the association network topology, significantly reducing the risk of chain data leakage caused by attacks or failures of high centrality nodes. At the same time, this dynamic site selection strategy causes the chat records of associated objects to be stored in multiple independent node groups with low association weight, making it difficult for attackers to infer the complete social relationship chain through topological links even if they invade some nodes, forming a natural "data island" protection barrier. In addition, the central indicator calculation integrates the propagation weight of multi-hop paths between nodes, ensuring that the selected storage nodes can meet the path accessibility for cross-node data recovery, and reducing the security risks caused by high-frequency access by minimizing the topological centrality, ultimately achieving a triple improvement in storage security, fault tolerance, and synchronization efficiency.
[0095] The global central indicator value of each element in the first storage node set is calculated based on the propagation weight between each element in the first storage node set and each storage node.
[0096] A global central indicator formula is constructed based on the Pagerank algorithm.
[0097] The global central indicator value of each element in the first storage node set is obtained by at least one iteration calculation based on the global central indicator formula.
[0098] The central indicator value of each storage node is calculated based on the global central indicator value of each element in the first storage node set and the propagation weight between each element in the first storage node set and each storage node.
[0099] The global central indicator formula is specifically:
[0100]
[0101] The central indicator formula is specifically:
[0102]
[0103] wherein, is a set composed of all storage nodes in the cloud storage center, is the total number of all storage nodes in the cloud storage center, is the sum of the propagation weight of t to all other storage nodes, is the propagation weight of t to j. Let t be the (k-1)th iteration value of the global center index. The k-th iteration value of the global center index of the j-th element in the first storage node set;
[0104] Let be the k-th iteration value of the central index of the i-th storage node. The damping coefficient is... For the first set of storage nodes, It is the j-th element in the first set of storage nodes. Let be the sum of the propagation weights of the j-th element in the first set of storage nodes to all storage nodes. Let be the propagation weight of the j-th element in the first set of storage nodes to the i-th storage node.
[0105] in, The attack frequency of node t in the previous period is calculated using the global centrality index formula. Combined with the propagation weights between nodes, the probability of an element in the first set of storage nodes being attacked can be effectively calculated. This probability is used as its global centrality index value. Then, when determining the optimal storage node... This represents the probability of an attack chain leading to i being generated. Let j be the probability of being attacked. Let i and j be the probability of being involved in the same attack chain. By accumulating the probability of all elements in the first storage node set being involved in the same attack chain as i, and filtering out the minimum value, we can comprehensively filter out the node with the smallest overall probability of being involved in the same attack chain as the elements in the first storage node set. Using this node as the optimal storage node can effectively avoid the probability of both parties' cloud data being attacked and lost at the same time, and ensure the security of data storage.
[0106] Furthermore, the method according to the embodiments of this application can also be achieved by means of... Figure 4 The architecture of the electronic device shown is used to implement this. For example... Figure 4 As shown, the electronic device 500 may include a bus 501, one or more CPUs 502, a read-only memory (ROM) 503, a random access memory (RAM) 504, a communication port 505 connected to a network, an input / output component 506, a hard disk 507, etc. The storage device in the electronic device 500, such as the ROM 503 or the hard disk 507, may store the control method of the multi-level encrypted cloud chat social record synchronization system provided in this application. The electronic device 500 may also include a user interface 508. Of course, Figure 4 The architecture shown is merely exemplary and can be omitted as needed when implementing different devices. Figure 4 One or more components in the illustrated electronic device.
[0107] Figure 5 is a computer readable storage medium structure diagram provided by an embodiment of the present application. As shown in Figure 5 is a computer readable storage medium 600 according to an embodiment of the present application. The computer readable storage medium 600 stores computer readable instructions. When the computer readable instructions are run by a processor, the control method of the multi-level encrypted cloud chat social record synchronization system according to the present application described with reference to the above figures can be executed. The storage medium 600 includes, but is not limited to, for example, volatile memory and / or non-volatile memory. The volatile memory may, for example, include random access memory (RAM) and cache memory, etc. The non-volatile memory may, for example, include read-only memory (ROM), hard disk, flash memory, etc.
[0108] In summary, the advantages of the present application are that through dynamic topology analysis and attack probability quantification model, intelligent dispersion of associated object data storage and significant improvement of anti-coordinated attack ability are realized. Specifically, based on multi-level calculation of node propagation weight in interactive correlation network, combined with global centrality index iterative screening mechanism, the chat records of the associated objects are preferentially stored in the edge nodes with the lowest association degree with the attack link of the first storage node set. This strategy makes the cloud data of the chat parties dispersed in the independent node groups with weak topology propagation weight and extremely small probability of being penetrated by the same attack chain. Even if a certain associated node is broken, the attacker cannot quickly locate other associated nodes due to the extremely low "j→i attack chain probability" accumulated in the center index value calculation, effectively avoiding the chain-type leakage of social relationship chain data. At the same time, through the recovery marker and dynamic key authorization mechanism, it is ensured that the backup data of the dispersed storage needs to meet the node topology isolation rule and device identity verification to be decrypted, forming a double protection of "physical isolation attack surface + logical encryption verification", which fundamentally solves the hidden danger of multi-associated object data centralized storage vulnerable to coordinated attacks, and significantly improves the disaster tolerance and anti-infiltration ability of cloud social record storage.
[0109] The basic principles, main features and advantages of the present application are shown and described above. Those skilled in the art should understand that the present application is not limited to the above embodiments, and the above embodiments and descriptions in the specification are only the principles of the present application. Without departing from the spirit and scope of the present application, various changes and improvements can be made to the present application, and these changes and improvements all fall within the scope of the claimed present application. The scope of protection claimed by the present application is defined by the appended claims and their equivalents.
Claims
1. A multi-tiered encrypted cloud chat social record synchronization system, comprising: The method comprises the following steps: a storage node management module is configured to obtain all storage nodes of a cloud storage center and construct an interaction association network among the storage nodes according to historical operation and maintenance data; an object retrieval module is configured to identify a self object of a social record to be uploaded, retrieve a storage record of the self object in the cloud storage center, and trigger the following according to a retrieval result: a record updating unit, when the storage record exists, uses new chat social records of a terminal to update corresponding storage content; an associated object acquisition unit, when the storage record does not exist, extracts opposite objects in all chat social records of the terminal; a node positioning module is configured to query distribution of all associated opposite objects in corresponding storage nodes of the cloud storage center; a storage optimization decision module is configured to determine an optimal storage node of a social record through node access frequency analysis and path topology calculation based on the distribution of the opposite objects in the storage nodes and the interaction association network; a data recovery module is configured to extract corresponding chat records from storage nodes of associated opposite objects to recover the chat records when it is detected that cloud storage records are lost, and add identifiable recovery marks to the recovered data; a security synchronization module is configured to implement a multi-level encryption synchronization mechanism including transmission encryption and storage encryption according to a terminal device type and a sensitivity level of records to be synchronized when a device terminal requests data synchronization; the multi-level encryption synchronization mechanism specifically comprises: if an identification code of a requested device terminal is the same as that of an uploaded device terminal, and there is no recovery mark in chat social records to be synchronized, the chat social records are directly synchronized; if the identification code of the requested device terminal is the same as that of the uploaded device terminal, and there is a recovery mark in the chat social records to be synchronized, the chat social records to be synchronized are encrypted, and an identity of an opposite object is used as a key, and the synchronization is performed only when the requested device terminal obtains authorization of the key of the opposite object; if the identification code of the requested device terminal is different from that of the uploaded device terminal, the chat social records to be synchronized are encrypted, and the identification code of the uploaded device terminal is used as the key, and the synchronization is performed only when the requested device terminal obtains authorization of the key of the uploaded device terminal.
2. The multi-tiered encrypted cloud chat social recording synchronization system of claim 1, wherein, The specific steps of obtaining all storage nodes of the cloud storage center and constructing the interaction association network among the storage nodes according to the historical operation and maintenance data are as follows: if there is a direct communication link between two storage nodes, the direct communication link is established; if there is no direct communication link between two storage nodes but there is a multi-hop path composed of intermediate nodes, a multi-hop communication link is established; for the direct communication link, a propagation weight between the storage nodes is directly obtained based on historical operation and maintenance interaction data between the storage nodes; for the multi-hop communication link, the propagation weight between two nodes is the product of propagation weights between all adjacent nodes of the multi-hop propagation link; the propagation weight of a storage node to itself is set to 1.
3. The multi-tiered encrypted cloud chat social recording synchronization system of claim 2, wherein, The specific steps of determining the optimal storage node of the social record through the node access frequency analysis and the path topology calculation based on the distribution of the opposite objects in the storage nodes and the interaction association network comprise the following steps: a first storage node set is constructed based on the storage nodes of the opposite objects; calculating a center index value of each storage node based on the propagation weight between each element in the first set of storage nodes and each storage node; filtering out the storage node corresponding to the minimum value of the center index value as the optimal storage node of the social record.
4. The multi-tiered encrypted cloud chat social recording synchronization system of claim 3, wherein, The calculation of the center index value of each storage node based on the propagation weight between each element in the first set of storage nodes and each storage node specifically includes: constructing a global center index formula based on the Pagerank algorithm; iteratively calculating the global center index value of the elements in the first set of storage nodes based on the global center index formula at least once; calculating the center index value of the storage node based on the global center index value of the elements in the first set of storage nodes and the propagation weight between each element in the first set of storage nodes and each storage node through the center index formula; The global center index formula is specifically: ; The center index formula is specifically: ; wherein, is a set of all storage nodes in the cloud storage center, is the total number of all storage nodes in the cloud storage center, is the sum of the propagation weights of t to all other storage nodes, is the propagation weight of t to j, is the value of the k-1th iteration of the global center indicator of t, is the value of the kth iteration of the global center indicator of the jth element in the first storage node set. the value of the kth iteration of the central indicator for the ith storage node, is a damping coefficient, is a first set of storage nodes, is the jth element in the first set of storage nodes, is the sum of the propagation weights of the jth element in the first set of storage nodes to all storage nodes, is the propagation weight of the jth element in the first set of storage nodes to the ith storage node.
5. The multi-tiered encrypted cloud chat social recording synchronization system of claim 4, wherein, When detecting that the cloud storage record is lost, the corresponding chat record is extracted from the storage node of the associated opposite object for recovery, and a recognizable recovery mark is added to the recovered data. When detecting that the cloud storage record is lost, the corresponding opposite object of the lost data is obtained, denoted as a backup object, and the chat social record storage node of the backup object is retrieved from the cloud storage center, denoted as a backup storage node. Taking the backup object as the self object value and the lost data corresponding self object as the opposite object value, all chat social records meeting the conditions are retrieved from the backup storage node, denoted as backup chat social records. Based on the content of the backup chat social records, the lost chat social record data is recovered.
6. The multi-tiered encrypted cloud chat social recording synchronization system of claim 1, wherein, The working steps of the system are: obtaining all storage nodes of the cloud storage center; constructing an interaction association network between all storage nodes of the cloud storage center based on historical operation and maintenance data of the cloud storage center; obtaining the self object of the chat social record to be uploaded to the cloud storage center, and performing retrieval in the cloud storage center to determine whether the self object has a storage record in the cloud storage center, if yes, updating the storage record based on the chat social record of the terminal, if not, obtaining all opposite objects of the chat social records of the terminal; obtaining the storage nodes of all opposite objects in the cloud storage center; determining the optimal storage node of the chat social record based on the storage nodes of all opposite objects in the cloud storage center and the interaction association network between all storage nodes of the cloud storage center; uploading the chat social record to the determined optimal storage node of the chat social record; if the storage record of the cloud storage center is lost, extracting the chat social record of the opposite object from the opposite object and recovering the lost storage record, and adding a recovery mark to the recovered storage record; When the device terminal requests to synchronize the chat social record from the cloud, the multi-level encryption is adopted for record synchronization based on the device terminal attribute and the chat social record attribute to be synchronized.
7. An electronic device, comprising: It includes: at least one processor; and a memory connected in communication with the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to drive the multi-level encrypted cloud chat social record synchronization system of any one of claims 1-5 to operate according to the system operational steps of claim 6.
8. A computer-readable storage medium storing computer-readable instructions, the computer-readable instructions comprising: the computer readable instructions, when executed by the processor, enable the multi-level encrypted cloud chat social record synchronization system of any one of claims 1-5 to operate according to the system operational steps of claim 6.
Citation Information
Patent Citations
Storage node selection method based on double-layer egocentric network
CN106131121A
Chat record recovery method, chat record recovery device and electronic equipment
CN113268381A