Joint Management System and Method for Privacy Data of Underground Pipelines by Multiple Departments

By using a multi-departmental underground pipeline privacy data joint management system, homomorphic encryption algorithms are employed to calculate pipeline conflicts in encrypted form. This solves the problem of difficulty in sharing and interoperating urban underground pipeline data, achieving secure data sharing and collaborative computing, and improving the efficiency and security of engineering construction.

CN116089972BActive Publication Date: 2026-11-17ZHEJIANG CHENGGONG SOFTWARE DEV CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202211571781.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-12-08
Publication Date
2026-11-17
Estimated Expiration
2042-12-08

AI Technical Summary

Technical Problem

Urban underground pipelines are diverse, with complex management systems and ownership structures. Strict data confidentiality requirements from various departments make it difficult to achieve data sharing and effective utilization, resulting in data sharing difficulties during project construction and affecting project implementation and safety.

Method used

A joint management system for underground pipeline privacy data from multiple departments is adopted. The system generates public-private key pairs through an encryption module and calculates pipeline conflicts in ciphertext using a homomorphic encryption calculation module. The system includes encrypted data storage, query modules, task division, and result aggregation modules to achieve secure data sharing and collaborative computing.

Benefits of technology

It has enabled deep collaboration among multiple departments, achieved business collaboration while ensuring data security, leveraged the value of data, and solved the problems of data interoperability and effective utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116089972B_ABST
    Figure CN116089972B_ABST
Patent Text Reader

Abstract

This invention discloses a joint management system and method for privacy data of underground pipelines from multiple departments, comprising: an encryption module for key generation and distribution; a data storage module including a plaintext data storage area and an encrypted data storage area; a query module for querying calculation tasks uploaded by task initiators; a task partitioning module for dividing the road segment area to be calculated in the calculation task into a series of smaller areas and finding the corresponding collaborative management parties; a homomorphic encryption calculation module for calculating conflicts between underground pipeline data in sub-tasks; and a result aggregation module for aggregating the encrypted calculation results of each sub-task and sending the calculation results to the query task initiator. This invention achieves deep collaboration among multiple departments and uses a homomorphic encryption algorithm to calculate the conflict between underground pipeline data in encrypted form, maximizing the value of the data and ensuring data security without the data leaving the local machine.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data encryption protection and use, and in particular to a joint management system and method for privacy data of underground pipelines from multiple departments. Background Technology

[0002] Urban underground integrated pipeline (corridor) infrastructure systems are urban underground public facilities that integrate power, communication, gas, heating, drainage, and other supporting engineering projects; they are mostly concealed works. Safety accidents caused by underground pipelines not only affect the daily lives of the public, but major safety accidents can also seriously endanger public personal safety and property.

[0003] Urban underground pipelines are diverse, including over 20 types such as water supply, drainage, gas, heating, electricity, and communications. Their management system and ownership are complex, involving more than 30 functional and authoritative departments. From a planning perspective, pipeline planning and road construction planning lack overall coordination, resulting in a lack of comprehensive urban underground pipeline planning. From a management perspective, underground pipelines are largely constructed independently by each pipeline construction unit, each managing their own closed systems. Underground facility data generally has confidentiality requirements, yet there is a need for data sharing and application. Data under the jurisdiction of each department has strict confidentiality requirements, making it difficult to directly share with other departments. However, in actual engineering construction, it is necessary for each department to share data with the construction team for reference, making it difficult to effectively utilize existing underground pipeline data.

[0004] By establishing a multi-faceted, in-depth collaboration mechanism, we can promote the sharing of information on construction plans, project implementation, operation and maintenance among various departments, and ensure effective business collaboration while safeguarding data security. Summary of the Invention

[0005] The purpose of this invention is to address the shortcomings of existing technologies by proposing a joint management system and method for privacy data of underground pipelines from multiple departments.

[0006] The objective of this invention is achieved through the following technical solution: a joint management system for privacy data of underground pipelines from multiple departments, comprising: an encryption module, a data storage module, a query module, a task partitioning module, a homomorphic encryption calculation module, and a result aggregation module;

[0007] The encryption module is used for key generation and distribution, and provides encryption and decryption services. The encryption module generates public and private key pairs and sends the public key to each collaborative management party.

[0008] The data storage module includes a plaintext data storage area and an encrypted data storage area. The plaintext data storage area is used to store the ground road section data corresponding to the underground pipeline data of each data party, and the encrypted data storage area is used to store the encrypted underground pipeline data of the collaborative management party that selects to perform collaborative privacy calculation on the system.

[0009] The query module is used to upload query tasks. The query task initiator uses a public key to encrypt its own underground pipeline data, and then packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task, which is then sent to the query module of the management system.

[0010] The task division module is used to divide the road segment area to be calculated in the calculation task of the query task initiator into a series of small areas. For each small area, the collaborative management party with underground pipeline data under this road segment area is found, and the participating parties that need to collaborate on privacy calculation are determined.

[0011] The homomorphic encryption calculation module is used to calculate the conflict between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, the module uses addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state.

[0012] The result aggregation module is used to aggregate the encrypted calculation results of the calculation tasks, obtain the aggregated calculation results, decrypt the aggregated calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

[0013] Furthermore, in the data storage module, each collaborative management party uploads the ground area road segment data corresponding to the underground pipeline data to the data storage module. Then, according to the confidentiality requirements of the data, each collaborative management party retains the underground pipeline data with higher confidentiality requirements locally, and uploads the underground pipeline data with lower confidentiality requirements to the system's encrypted data storage module after being encrypted with a public key.

[0014] Furthermore, in the query module, the calculation task of the query task initiator includes the area to be queried and the underground pipeline data encrypted by the query task initiator using a public key.

[0015] Furthermore, in the task partitioning module, the ground road segment data corresponding to the underground pipeline data in the calculation task is divided into small regions, and the participants that need to participate in collaborative privacy calculation in each small region are determined; based on whether the encrypted data of the participants has been uploaded to the encrypted data storage area, the subtask is divided into system calculation subtask and collaborative management local calculation subtask; the system calculation subtask is calculated in the homomorphic encryption calculation module of the system, and the collaborative management local calculation subtask is calculated locally by the collaborative management party.

[0016] Furthermore, in the homomorphic encryption calculation module, the system and the collaborative management party perform calculations on sub-tasks based on the homomorphic encryption algorithm. The underground pipeline location data required for the calculation includes the starting point coordinates, ending point coordinates, starting point elevation, ending point elevation, pipe diameter, pipeline type, and net distance between pipelines. For some underground pipelines, it also includes the requirement that instrument panels or valves extend to the surface, referred to as pipe points, whose data includes planar coordinates and pipe diameter. The specific calculation method is as follows:

[0017] Assume the starting coordinates of pipeline L1 are A(x) A ,y A ), endpoint coordinates B(x) B ,y B The center point elevation h1 and pipe diameter d1, and the starting coordinates C(x) of pipeline L2. C ,y C ), endpoint coordinates D(x) D ,y D The center point elevation h2 and pipe diameter d2, as well as the net distance s between pipelines L1 and L2, are given by S = s + d1 / 2 + d2 / 2, which is the safe distance that the center lines of the two pipelines need to ensure.

[0018] Calculate the pipeline type. If the start and end coordinates remain unchanged, the pipeline is a vertical pipeline; otherwise, it is classified as a horizontal pipeline. Calculate whether there is a conflict between pipelines under these two types of conditions:

[0019] 1) Both pipelines are perpendicular pipelines, and the starting coordinates of the pipelines are A(x) and A(x). A ,y A ), C(x) C ,y C ),set up If n1 > S, then there is no conflict between pipelines; otherwise, there is.

[0020] 2) One pipeline is vertical, and the other is horizontal; the starting coordinate of the vertical pipeline is A(x). A ,y A The coordinates of the starting and ending points of the horizontal pipeline are C(x) and C(x). C ,y C ), D(x D ,y D ),set up

[0021] Calculate the distance Z from the starting point of the vertical pipeline to the horizontal pipeline; let the vector of the horizontal pipeline be L = (x D -x C ,y D -y CThe vectors representing the coordinates of the starting and ending points of the horizontal pipeline to the starting point of the vertical pipeline are L1 = (x... A -x C ,y A -y C L2 = (x) D -x A ,y D -y A ); Calculate the cosine value of the angle between vectors. If both cosine values ​​are greater than 0, then the distance from the vertical pipeline to the horizontal pipeline is... If cosθ1 <= 0, then Z = n1; if cosθ2 <= 0, then Z = n2; then calculate whether Z > S holds true. If it holds true, there is no conflict between pipelines; otherwise, a conflict occurs.

[0022] 3) Both pipelines are horizontal. Calculate whether there is a conflict between the pipelines according to the following procedure:

[0023] 3.1) Does the calculation depth involve intersections?

[0024] Calculate the difference in elevation between the center points of the two pipelines, |h1-h2|. If |h1-h2|>S, then there is no conflict. In the case of pipeline points, in addition to calculating whether there is an intersection in depth, it is also necessary to treat the coordinates of the pipeline points as parameters perpendicular to the pipelines and calculate whether there is a conflict between the pipeline points and the pipelines to be laid according to 2).

[0025] 3.2) Calculate whether the two horizontal pipelines are parallel;

[0026] The vector L1 of pipeline L1 is L1 = (x B -x A ,y B -y A ), the vector of pipeline L2 is L2 = (x D -x C ,y D -y C ),

[0027]

[0028] If const = 0, then the two pipelines are parallel; calculate the distance between the pipelines. If n1 > S, then there is no conflict between pipelines; otherwise, there is a conflict.

[0029] If const ≠ 0, proceed to the next calculation.

[0030] 3.3) Calculate whether there is any intersection or conflict between the two horizontal pipelines;

[0031] For each pipeline, due to pipe diameter and clearance requirements, there are two parallel boundaries on the left and right when projecting it onto a plane. Let the two boundaries of pipeline L1 be L1 and L2, L3, L4, L5, L6, L7, L8, L9, L1, L1, L2, L1, L2, L3, L1, L2, L1, L2, L3, L4, L1, L2, L1, L2, L3, L1, L2 ...3, L1, L2, L3, L1, 11 and L 12 The two boundaries of pipeline L2 are L 21 and L 22 When calculating whether two pipelines conflict, it is necessary to calculate whether there is a conflict between the boundaries of the two pipelines, that is, to calculate the boundary line L separately. 11 With L 21 L 11 With L 22 L 12 With L 21 and L 12 With L 22 Is there a conflict?

[0032] Calculate the endpoints of pipeline L1 at its two boundaries, endpoint A(x) A ,y A The two boundary points corresponding to ) are (x A1 ,y A1 ), (x A2 ,y A2 ):

[0033]

[0034]

[0035] Endpoint B(x) B ,y B The two boundary points corresponding to ) are (x B1 ,y B1 ), (x B2 ,y B2 ):

[0036]

[0037]

[0038] Then the boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 Similarly, the boundary line L 12 The two endpoints are (x A2 ,y A2 ), (x B2 ,y B2 ); Calculate the endpoint C(x) of pipeline L2 in the same way. C ,y C ), D(x D ,yD The two boundary lines L 21 and L 22 endpoint values;

[0039] Boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 Boundary line L 21 The two endpoints are (x C1 ,y C1 ), (x D1 ,y D1 );

[0040] 3.3.1) Calculate whether the x and y coordinates of the endpoints of the two boundary lines intersect;

[0041] (1) Let the condition p = max(x) A1 ,x B1 )>=min(x C1 ,x D1 )&&min(x A1 ,x B1 )<=max(x) C1 ,x D1 )

[0042] (2) Let the condition q = max(y A1 ,y B1 )>=min(y C1 ,y D1 )&&min(y A1 ,y B1 )<=max(y C1 ,y D1 )

[0043] If both p and q are true, proceed to the next calculation; otherwise, there is no conflict.

[0044] 3.3.2) Calculate whether the two pipelines cross each other;

[0045] (1) Calculate L 21 Whether to cross L 11 ;

[0046] Boundary line L 11 The vector is: L 11 =(x B1 -x A1 ,y B1 -y A1 Boundary line L 21 The vector is: L 21 =(x D1 -xC1 ,y D1 -y C1 ). In L 11 Select one endpoint and connect it to L. 21 Connecting the two endpoints yields the vector m1 = (x C1 -x A1 ,y C1 -y A1 ), m2=(x D1 -x A1 ,y D1 -y A1 ), respectively with vector L 11 To perform a vector product operation, let:

[0047]

[0048]

[0049] If a1*b1<=0, then it means L 21 straddle L 11 And further calculate L 11 Whether to cross L 21 Otherwise, there is no conflict;

[0050] (2) Calculate L 11 Whether to cross L 21 ;

[0051] In L 21 Select one endpoint and connect it to L. 11 Connecting the two endpoints yields the vector m3 = (x A1 -x C1 ,y A1 -y C1 ), m4=(x B1 -x C1 ,y B1 -y C1 ), respectively with vector L 21 To perform a vector product operation, let...

[0052]

[0053]

[0054] If a²*b² <= 0, then it means L 11 straddle L 21 This means there is a conflict between pipelines L1 and L2.

[0055] L 11 With L 22 L 12 With L 21 and L12 With L 22 The calculation is performed in the same way. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborating management party, the addition and multiplication homomorphic encryption algorithms are used. Based on the above calculation method and the encrypted pipeline data, the calculation is performed in ciphertext state to determine whether there is a conflict between the pipelines of the query task initiator and the collaborating management party.

[0056] Furthermore, in the result aggregation module, the system and the collaborative management party send the encrypted calculation results obtained in each homomorphic encryption calculation process to the result aggregation module, and aggregate the calculation results according to the ground area; the system decrypts the aggregated calculation results to obtain the plaintext calculation results, and sends the calculation results to the query task initiator; the calculation results include whether the pipeline data of the query task initiator conflicts with the existing underground pipeline data. If there is a conflict, it will indicate in which areas the conflict occurs and at which step in the calculation process the conflict occurs, so as to facilitate the query party to change its designed underground pipeline scheme.

[0057] This invention also provides a method for joint management of privacy data of underground pipelines by multiple departments, the method comprising the following steps:

[0058] (1) Generate a public-private key pair using an encryption algorithm, and send the public key to each collaborative management party;

[0059] (2) Obtain the ground road section data corresponding to the underground pipeline data of each data party, and encrypt the underground pipeline data of each party for collaborative privacy calculation.

[0060] (3) The query task initiator uses a public key to encrypt its own underground pipeline data and packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task.

[0061] (4) Divide the road segment area to be calculated in the calculation task of the query task initiator into a series of small areas. For each small area, find the collaborative management party that has underground pipeline data in this road segment area and determine the participants that need to collaborate on privacy calculation.

[0062] (5) Perform conflict calculation between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, use addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state.

[0063] (6) Summarize the encrypted calculation results of the calculation tasks, obtain the summarized calculation results, decrypt the summarized calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

[0064] The beneficial effects of this invention are as follows: This invention achieves deep collaboration among multiple departments by constructing an underground pipeline management system and method; at the same time, it uses a homomorphic encryption algorithm to calculate the conflict between underground pipeline data in encrypted form, thus maximizing the value of the data without it leaving the local area. Attached Figure Description

[0065] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0066] Figure 1 A workflow framework diagram of the multi-department underground pipeline privacy data joint management system provided by the present invention;

[0067] Figure 2 This is a flowchart illustrating how multiple departments can jointly manage privacy data related to underground pipelines. Detailed Implementation

[0068] The specific embodiments of the present invention will be further described in detail below with reference to the accompanying drawings.

[0069] like Figure 1 and Figure 2 As shown, the present invention provides a joint management system for privacy data of underground pipelines from multiple departments. The system includes: an encryption module, a data storage module, a query module, a task division module, a homomorphic encryption calculation module, and a result aggregation module.

[0070] The encryption module is used for key generation and distribution, and provides encryption and decryption services. The encryption module generates public and private key pairs and sends the public key to each collaborative management party.

[0071] The data storage module includes a plaintext data storage area and an encrypted data storage area. The plaintext data storage area is used to store the ground road section data corresponding to the underground pipeline data of each data party, and the encrypted data storage area is used to store the encrypted underground pipeline data of the collaborative management party that selects to perform collaborative privacy calculation on the system.

[0072] The query module is used to upload query tasks. The query task initiator uses a public key to encrypt its own underground pipeline data, and then packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task, which is then sent to the query module of the management system.

[0073] The task division module is used to divide the road segment area to be calculated in the calculation task of the query task initiator into a series of small areas. For each small area, the collaborative management party with underground pipeline data under this road segment area is found, and the participating parties that need to collaborate on privacy calculation are determined.

[0074] The homomorphic encryption calculation module is used to calculate the conflict between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, the module uses addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state.

[0075] The result aggregation module is used to aggregate the encrypted calculation results of the calculation tasks, obtain the aggregated calculation results, decrypt the aggregated calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

[0076] Suppose a city's underground pipelines include power lines, gas lines, heating lines, water supply lines, drainage lines, industrial lines, hazardous chemical lines, communication lines, and traffic video lines, with corresponding responsible departments such as the Development and Reform Bureau, Housing and Urban-Rural Development Bureau, Economic and Information Technology Bureau, Emergency Management Bureau, Comprehensive Law Enforcement Bureau, and Transportation Bureau. If the Economic and Information Technology Bureau designs an underground communication pipeline plan for a certain area and wants to know if the design can be implemented, it's difficult to directly access the data of other departments' underground facilities due to strict confidentiality requirements. However, the Economic and Information Technology Bureau needs data from other departments for reference during actual construction, making it difficult to effectively utilize existing underground pipeline data. This patented multi-department underground pipeline privacy data joint management system can solve this problem. The process of using the management system to solve this issue is described below.

[0077] In this embodiment, the Economic and Information Bureau is the query task initiator Q, and the cooperating management parties include the Development and Reform Bureau (P1), the Housing and Urban-Rural Development Bureau (P2), the Emergency Management Bureau (P3), the Comprehensive Law Enforcement Bureau (P4), and the Transportation Bureau (P5).

[0078] The management system's encryption module generates a public-private key pair and sends the public key to each party. Each party then uploads the corresponding surface area data for its underground pipeline data to the plaintext data storage area of ​​the management system's data storage module. Afterward, each collaborating management party chooses to perform collaborative privacy computation either on the system or locally, based on its data confidentiality requirements and computing capabilities. If privacy computation is performed on the system, the data provider must encrypt its underground pipeline data before uploading it to the encrypted data storage area of ​​the data storage module.

[0079] The task initiator, Q (the Economic and Information Bureau), uses a public key to encrypt its underground pipeline data, then packages it together with the corresponding surface road segment data into a calculation task and sends it to the query module of the management system. The task includes the surface road segment data that the task initiator wants to query and the underground pipeline data in that road segment area, which can be referred to as the calculation road segment area and the calculation content, respectively.

[0080] The management system's task partitioning module divides the road segment area to be calculated in the computation task into a series of smaller areas. For each smaller area, it identifies the collaborating management parties that possess underground pipeline data within that road segment area, thus determining the participants required for collaborative privacy computation. If the participating parties' data is uploaded to the management system's encrypted data storage area, it is classified as a system computation sub-task; otherwise, it is classified as a local computation sub-task by the collaborating management party. By querying the data of road segment R1 in the computation task sub-area within the system, assuming that collaborating management parties P1, P2, and P3 possess underground pipeline data under road segment R1, these three parties are the participants in this computation task. The system then queries whether the above-mentioned collaborating management parties have uploaded encrypted data to the management system to classify whether it is a system computation sub-task. Based on the query results, P1 and P2 perform collaborative privacy computation within the management system, while P3 performs local computation within the department. Therefore, under road segment R1, Q performs system collaborative privacy computation with P1 and P2 respectively, and Q performs collaborative privacy computation with P3 locally on P3's end.

[0081] The calculation of inter-pipeline conflicts mainly uses information such as the location data of underground pipelines, including the coordinates of the starting point and the ending point, the elevation of the starting point and the ending point, the pipe diameter, the type of pipeline, and the clearance between pipelines. For some underground pipelines, there is also the requirement that instrument panels, valves, etc., extend to the surface; we call these pipe points, and their data includes plane coordinates and pipe diameter. One underground pipeline each from Q and P1 under section R1 is selected for inter-pipeline conflict calculation.

[0082] Assume that the coordinates of the start and end points, the elevation of the center point, and the pipe diameter of pipeline L1 belonging to Q are A(x) and A(x). A ,y A B(x) B ,y B The coordinates of the start and end points, the elevation of the center point, and the pipe diameter of pipeline L2 belonging to P1 are C(x, h1, d1). C ,y C ), D(x D ,y D h2, d2, and the net distance s between pipelines L1 and L2, let S = s + d1 / 2 + d2 / 2, which is the safe distance that the center lines of the two pipelines need to ensure.

[0083] First, calculate the pipeline types L1 and L2. If the start and end coordinates remain unchanged, the pipeline is a vertical pipeline; otherwise, it is classified as a horizontal pipeline. Then, calculate whether there is a conflict between the pipelines under each type.

[0084] Case 1: Both pipelines are perpendicular, and the starting coordinates of the pipelines are A(x) and A(x). A ,y A ), C(x) C ,y C ),set up If n1 > S, then there is no conflict between pipelines; otherwise, there is.

[0085] Scenario 2: One pipeline is vertical, and the other is horizontal. Assume the starting coordinates of the vertical pipeline are A(x...). A ,y A The coordinates of the starting and ending points of the horizontal pipeline are C(x) and C(x). C ,y C ), D(x D ,y D ),set up

[0086] Calculate the distance Z from the starting point of the vertical pipeline to the horizontal pipeline. Let the vector of the horizontal pipeline be L = (x... D -x C ,y D -y C The vectors representing the coordinates of the starting and ending points of the horizontal pipeline to the starting point of the vertical pipeline are L1 = (x A -x C ,y A -y C L2 = (x) D -x A ,y D -y A Calculate the cosine of the angle between the vectors. If both cosine values ​​are greater than 0, then the distance from the vertical pipeline to the horizontal pipeline is... If cosθ1 <= 0, then Z = n1; if cosθ2 <= 0, then Z = n2. Next, calculate whether Z > S holds true. If it does, there is no conflict between pipelines; otherwise, a conflict occurs.

[0087] Scenario 3: Both pipelines are horizontal. Calculate whether there is a conflict between the pipelines according to the following procedure.

[0088] 3.1 Does the computation depth involve intersections?

[0089] Calculate the difference in elevation between the center points of the two pipelines, |h1-h2|. If |h1-h2|>S, then there is no conflict. For cases where there are pipe points, such as instrument panels and valves that require access to the ground, in addition to calculating whether there is an intersection in depth, it is also necessary to treat the pipe point coordinates as parameters perpendicular to the pipeline and calculate whether there is a conflict between the pipe point and the pipeline to be laid according to 2.2.

[0090] 3.2 Calculate whether the two horizontal pipelines are parallel;

[0091] The vector L1 of pipeline L1 is L1 = (x B -x A ,y B -y A ), the vector of pipeline L2 is L2 = (x D -x C ,y D -y C ),

[0092]

[0093] If const = 0, then the two pipelines are parallel; calculate the distance between the pipelines. If n1 > S, then there is no conflict between pipelines; otherwise, there is a conflict.

[0094] If const≠0, proceed to the next calculation.

[0095] 3.3 Perform projection and vector-related calculations on the plane;

[0096] For each pipeline, due to pipe diameter and clearance requirements, there are two parallel boundaries on the left and right when projecting it onto a plane. Let the two boundaries of pipeline L1 be L1 and L2, L3, L4, L5, L6, L7, L8, L9, L1, L1, L2, L1, L2, L3, L1, L2, L1, L2, L3, L4, L1, L2, L1, L2, L3, L1, L2 ...3, L1, L2, L3, L1, 11 and L 12 The two boundaries of pipeline L2 are L 21 and L 22 When calculating whether two pipelines conflict, it is necessary to separately calculate whether there is a conflict between the boundaries of the two pipelines, that is, to separately calculate the boundary line L. 11 With L 21 L 11 With L 22 L 12 With L 21 and L 12 With L 22 Is there a conflict?

[0097] Taking pipeline L1 as an example, calculate the endpoints of its two boundaries, endpoint A(x) A ,y A The two boundary points corresponding to ) are (x A1 ,y A1 ), (x A2,y A2 ):

[0098]

[0099]

[0100] Endpoint B(x) B ,y B The two boundary points corresponding to ) are (x B1 ,y B1 ), (x B2 ,y B2 ):

[0101]

[0102]

[0103] Then the boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 Similarly, the boundary line L 12 The two endpoints are (x A2 ,y A2 ), (x B2 ,y B2 ). Connect the endpoint C(x) of pipeline L2 C ,y C ), D(x D ,y D By replacing the boundary lines L2, we can deduce the two boundary lines L1 of pipeline L2. 21 and L 22 The endpoint value.

[0104] Two boundary lines are selected as examples for calculation; the calculation of other boundary lines should refer to these examples.

[0105] Boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 Boundary line L 21 The two endpoints are (x C1 ,y C1 ), (x D1 ,y D1 ).

[0106] 3.3.1 Calculate whether the x and y coordinates of the endpoints of the two boundary lines intersect;

[0107] (1) Let the condition p = max(x) A1 ,xB1 )>=min(x C1 ,x D1 )&&min(x A1 ,x B1 )<=max(x) C1 ,x D1 )

[0108] (2) Let the condition q = max(y A1 ,y B1 )>=min(y C1 ,y D1 )&&min(y A1 ,y B1 )<=max(y C1 ,y D1 )

[0109] If both p and q are true, proceed to the next calculation; otherwise, there is no conflict.

[0110] 3.3.2 Calculate whether the two pipelines cross each other;

[0111] (1) Calculate L 21 Whether to cross L 11 ;

[0112] Boundary line L 11 The vector is: L 11 =(x B1 -x A1 ,y B1 -y A1 Boundary line L 21 The vector is: L 21 =(x D1 -x C1 ,y D1 -y C1 ). In L 11 Select one endpoint and connect it to L. 21 Connecting the two endpoints yields the vector m1 = (x C1 -x A1 ,y C1 -y A1 ), m2=(x D1 -x A1 ,y D1 -y A1 ), respectively with vector L 11 To perform a vector product operation, let...

[0113]

[0114]

[0115] If a1*b1<=0, then it means L 21 straddle L 11 And further calculate L 11 Whether to cross L 21 Otherwise, there would be no conflict.

[0116] (2) Calculate L 11 Whether to cross L 21 ;

[0117] In L 21 Select an endpoint C and connect it to L. 11 Connecting the two endpoints A and B yields the vector m3 = (x A1 -x C1 ,y A1 -y C1 ), m4=(x B1 -x C1 ,y B1 -y C1 ), respectively with vector L 21 To perform a vector product operation, let:

[0118]

[0119]

[0120] If a²*b² <= 0, then it means L 11 straddle L 21 This means there is a conflict between pipelines L1 and L2.

[0121] L 11 With L 22 L 12 With L 21 and L 12 With L 22 The calculation is performed in the same way. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborating management party, the addition and multiplication homomorphic encryption algorithms are used. Based on the above calculation method and the encrypted pipeline data, the calculation is performed in ciphertext state to determine whether there is a conflict between the pipelines of the query task initiator and the collaborating management party.

[0122] Calculators P1, P2, and local calculator P3 send the encrypted computation results obtained from each subtask in the query task through homomorphic encryption to the system's intermediate result aggregation module. This module aggregates the sent intermediate results according to the ground area. The system decrypts the aggregated computation results to obtain the plaintext computation results and sends the results to the query task initiator. In this example, the final result can show that the underground pipelines designed by the Economic and Information Bureau under road segment R1 conflict with the underground pipelines of the Development and Reform Bureau and the Emergency Management Bureau, and will show under what circumstances the conflict occurred. The Economic and Information Bureau can modify its underground pipeline design plan based on this result.

[0123] Corresponding to an embodiment of the multi-department underground pipeline privacy data joint management system of the present invention, the present invention also provides an embodiment of a multi-department underground pipeline privacy data joint management method, the specific steps of which are as follows:

[0124] (1) Generate a public-private key pair using an encryption algorithm, and send the public key to each collaborative management party;

[0125] (2) Obtain the ground road section data corresponding to the underground pipeline data of each data party, and encrypt the underground pipeline data of each party for collaborative privacy calculation.

[0126] (3) The query task initiator uses a public key to encrypt its own underground pipeline data and packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task.

[0127] (4) Divide the road segment area to be calculated in the calculation task of the query task initiator into a series of small areas. For each small area, find the collaborative management party that has underground pipeline data in this road segment area and determine the participants that need to collaborate on privacy calculation.

[0128] (5) Perform conflict calculation between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, use addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state.

[0129] (6) Summarize the encrypted calculation results of the calculation tasks, obtain the summarized calculation results, decrypt the summarized calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

[0130] The specific implementation steps of each embodiment of the multi-department underground pipeline privacy data joint management method provided by the present invention can be referred to the implementation process of each module in the multi-department underground pipeline privacy data joint management system provided by the present invention.

[0131] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of the present invention. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made on the basis of the technical solution of the present invention should be included within the scope of protection of the present invention.

Claims

1. A joint management system for privacy data of underground pipelines from multiple departments, characterized in that, The system includes: an encryption module, a data storage module, a query module, a task partitioning module, a homomorphic encryption calculation module, and a result aggregation module; The encryption module is used for key generation and distribution, and provides encryption and decryption services. The encryption module generates public and private key pairs and sends the public key to each collaborative management party. The data storage module includes a plaintext data storage area and an encrypted data storage area. The plaintext data storage area is used to store the ground road section data corresponding to the underground pipeline data of each data party, and the encrypted data storage area is used to store the encrypted underground pipeline data of the collaborative management party that selects to perform collaborative privacy calculation on the system. The query module is used to upload query tasks. The query task initiator uses a public key to encrypt its own underground pipeline data, and then packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task, which is then sent to the query module of the management system. The task partitioning module is used to divide the ground road segment data corresponding to the underground pipeline data in the calculation task of the query task initiator into small regions. For each small region, it finds the collaborative management party that has underground pipeline data in this road segment region and determines the participants that need to collaborate on privacy calculations. Based on whether the encrypted data of the participants has been uploaded to the encrypted data storage area, the subtask is divided into system calculation subtasks and collaborative management party local calculation subtasks. The system calculation subtask is calculated in the homomorphic encryption calculation module of the system, and the collaborative management party local calculation subtask is calculated in the local homomorphic encryption calculation of the collaborative management party. The homomorphic encryption calculation module is used to calculate the conflict between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, the module uses addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state. The result aggregation module is used to aggregate the encrypted calculation results of the calculation tasks, obtain the aggregated calculation results, decrypt the aggregated calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

2. The multi-department underground pipeline privacy data joint management system according to claim 1, characterized in that, In the data storage module, each collaborative management party uploads the ground area road segment data corresponding to the underground pipeline data to the data storage module. Then, according to the confidentiality requirements of the data, each collaborative management party keeps the underground pipeline data with higher confidentiality requirements locally, and uploads the underground pipeline data with lower confidentiality requirements to the system's encrypted data storage module after being encrypted with a public key.

3. The multi-department underground pipeline privacy data joint management system according to claim 1, characterized in that, In the query module, the calculation task of the query task initiator includes the area to be queried and the underground pipeline data encrypted by the query task initiator using a public key.

4. The multi-department underground pipeline privacy data joint management system according to claim 1, characterized in that, In the homomorphic encryption calculation module, the system and the collaborative management party calculate sub-tasks based on the homomorphic encryption algorithm. The underground pipeline location data required for the calculation includes the starting point coordinates, ending point coordinates, starting point elevation, ending point elevation, pipe diameter, pipeline type, and net distance between pipelines. For some underground pipelines, it also includes the requirement that instrument panels or valves connect to the surface, referred to as pipe points, whose data includes planar coordinates and pipe diameter. The specific calculation method is as follows: Assume the starting coordinates of pipeline L1 are A(x) A ,y A ), endpoint coordinates B(x) B ,y B The center point elevation h1 and pipe diameter d1, and the starting coordinates C(x) of pipeline L2. C ,y C ), endpoint coordinates D(x) D ,y D The center point elevation h2 and pipe diameter d2, as well as the net distance s between pipelines L1 and L2, are given by S = s + d1 / 2 + d2 / 2, which is the safe distance that the center lines of the two pipelines need to ensure. Calculate the pipeline type. If the start and end coordinates remain unchanged, the pipeline is a vertical pipeline; otherwise, it is classified as a horizontal pipeline. Calculate whether there are any conflicts between the pipelines based on the two types: 1) Both pipelines are perpendicular pipelines, and the starting coordinates of the pipelines are A(x) and A(x). A ,y A ), C(x) C ,y C Let n1 = AC = If n1 > S, then there is no conflict between pipelines; otherwise, there is. 2) One pipeline is vertical, and the other is horizontal; the starting coordinate of the vertical pipeline is A(x). A ,y A The starting and ending coordinates of the horizontal pipeline are C(x) and C(x). C ,y C ), D(x D ,y D Let n1 = AC = n2=AD= ; Calculate the distance Z from the starting point of the vertical pipeline to the horizontal pipeline; let the vector of the horizontal pipeline be L = (x D -x C ,y D -y C The vectors representing the coordinates of the starting and ending points of the horizontal pipeline to the starting point of the vertical pipeline are L1 = (x... A -x C ,y A -y C L2 = (x) D -x A ,y D -y A ); Calculate the cosine of the angle between the vectors , If both cosine values ​​are greater than 0, then the distance from the vertical pipeline to the horizontal pipeline is... ;like If <= 0, then Z = n1; if If Z is less than or equal to 0, then Z = n2; then calculate whether Z > S is true. If it is true, there is no conflict between pipelines; otherwise, a conflict occurs. 3) Both pipelines are horizontal. Calculate whether there is a conflict between the pipelines according to the following procedure: 3.1) Does the computation depth involve intersections? Calculate the difference in elevation between the center points of the two pipelines, |h1-h2|. If |h1-h2|>S, then there is no conflict. In the case of pipeline points, in addition to calculating whether there is an intersection in depth, it is also necessary to treat the coordinates of the pipeline points as parameters perpendicular to the pipelines and calculate whether there is a conflict between the pipeline points and the pipelines to be laid according to 2). 3.2) Calculate whether the two horizontal pipelines are parallel; The vector L1 of pipeline L1 is L1 = (x B -x A ,y B -y A ), the vector L2 of pipeline L2 = (x D -x C ,y D -y C ), ; If const = 0, then the two pipelines are parallel, and the distance between the pipelines n1 = AC = If n1 > S, then there is no conflict between pipelines; otherwise, there is a conflict. If const ≠ 0, proceed to the next calculation. 3.3) Calculate whether there is any intersection or conflict between the two horizontal pipelines; For each pipeline, due to pipe diameter and clearance requirements, there are two parallel boundaries on the left and right when projecting it onto the plane. Let the two boundaries of pipeline L1 be L1, L2, L3, L4, L5, L6, L7, L8, L9, L1, L1, L1, L2, L1, L2, L3 ... 11 and L 12 The two boundaries of pipeline L2 are L 21 and L 22 When calculating whether two pipelines conflict, it is necessary to calculate whether there is a conflict between the boundaries of the two pipelines, that is, to calculate the boundary line L separately. 11 With L 21 L 11 With L 22 L 12 With L 21 and L 12 With L 22 Is there a conflict? Calculate the endpoints of pipeline L1 at its two boundaries, and the coordinates of the starting point A(x) of pipeline L1. A ,y A The two boundary points corresponding to ) are (x A1 ,y A1 ), (x A2 ,y A2 ): , , The end point coordinate B (x B ,y B ) of the pipeline L1 corresponds to two boundary points (x B1 ,y B1 ), (x B2 ,y B2 ). , , Then the boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 Similarly, the boundary line L 12 The two endpoints are (x A2 ,y A2 ), (x B2 ,y B2 ); Calculate the starting coordinates C(x) of pipeline L2 in the same way. C ,y C ) and the endpoint coordinates D(x) D ,y D The two boundary lines L 21 and L 22 endpoint values; Boundary line L 11 The two endpoints are (x A1 ,y A1 ), (x B1 ,y B1 ), boundary line L 21 The two endpoints are (x C1 ,y C1 ), (x D1 ,y D1 ); 3.3.1) Calculate whether the x and y coordinates of the endpoints of the two boundary lines intersect; (1) Let the condition p = max(x) A1 , x B1 )>=min(x C1 , x D1 )&&min(x A1 , x B1 )<=max(x C1 , x D1 ) (2) Let condition q = max(y A1 , y B1 )>=min(y C1 , y D1 )&&min(y A1 , y B1 )<=max(y C1 , y D1 ) If both p and q are true, proceed to the next calculation; otherwise, there is no conflict. 3.3.2) Calculate whether the two pipelines cross each other; (1) Calculate L 21 Whether to cross L 11 ; Boundary line L 11 The vector is: L 11 =( x B1 - x A1 , y B1 - y A1 Boundary line L 21 The vector is: L 21 =( x D1 - x C1 ,y D1 - y C1 ); in L 11 Select one endpoint and connect it to L. 21 Connecting the two endpoints yields the vector m1 = (x C1 - x A1 , y C1 -y A1 ), m2=(x D1 -x A1 ,y D1 -y A1 ), respectively with vector L 11 To perform a vector product operation, let: If a1*b1<=0, then it means L 21 straddle L 11 And further calculate L 11 Whether to cross L 21 Otherwise, there is no conflict; (2) Calculate L 11 Whether to cross L 21 ; In L 21 Select one endpoint and connect it to L. 11 Connecting the two endpoints yields the vector m3 = (x A1 - x C1 , y A1 - y C1 m4=( x B1 - x C1 , y B1 - y C1 ), respectively with vector L 21 To perform a vector product operation, let... If a²*b²<=0, then it means L 11 straddle L 21 This means that there is a conflict between pipelines L1 and L2; L 11 With L 22 L 12 With L 21 and L 12 With L 22 The calculation is performed in the same way. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborating management party, the addition and multiplication homomorphic encryption algorithms are used. Based on the above calculation method and the encrypted pipeline data, the calculation is performed in ciphertext state to determine whether there is a conflict between the pipelines of the query task initiator and the collaborating management party.

5. The multi-department underground pipeline privacy data joint management system according to claim 1, characterized in that, In the result aggregation module, the system and the collaborative management party send the encrypted calculation results obtained in each homomorphic encryption calculation process to the result aggregation module, and aggregate the calculation results according to the ground area; The system decrypts the aggregated calculation results to obtain the plaintext calculation results, and then sends the calculation results to the query task initiator. The calculation results include whether the pipeline data of the query task initiator conflicts with existing underground pipeline data. If a conflict exists, it will indicate which areas the conflict occurs in and at which step of the calculation process the conflict occurs, making it easier for the querying party to modify its designed underground pipeline plan.

6. A method for joint management of underground pipeline privacy data based on the multi-department underground pipeline privacy data joint management system according to any one of claims 1-5, characterized in that, The method includes the following steps: (1) Generate a public-private key pair using an encryption algorithm and send the public key to each collaborative management party; (2) Obtain the ground road section data corresponding to the underground pipeline data of each data party, and encrypt the underground pipeline data of each party for collaborative privacy calculation; (3) The query task initiator uses a public key to encrypt its own underground pipeline data and packages it together with the ground road section data corresponding to the underground pipeline data into a calculation task; (4) Divide the ground road segment data corresponding to the underground pipeline data in the calculation task of the query task initiator into small areas. For each small area, find the collaborative management party that has underground pipeline data in this road segment area and determine the participants that need to collaborate on privacy calculation. According to whether the encrypted data of the participants has been uploaded to the encrypted data storage area, divide the subtask into system calculation subtask and collaborative management party local calculation subtask. The system calculation subtask is calculated in the homomorphic encrypted calculation module of the system, and the collaborative management party local calculation subtask is calculated in the local homomorphic encrypted calculation of the collaborative management party. (5) Perform conflict calculation between underground pipeline data in the calculation task. Based on the encrypted underground pipeline data of the query task initiator and the encrypted underground pipeline data of the collaborative management party, use addition and multiplication homomorphic encryption algorithms to calculate whether there is a conflict between the pipelines of the query party and the data party in the ciphertext state. (6) Summarize the encrypted calculation results of the calculation task, obtain the summarized calculation results, decrypt the summarized calculation results to obtain the plaintext calculation results, and send the calculation results to the query task initiator.

Citation Information

Patent Citations

  • Blockchain privacy protection method based on multi-party security computing

    CN110414272A

  • Multi-party joint privacy data processing method and device

    CN112989368A