CN116662066A - Intelligent scheduling method of privacy calculation coordination center - Google Patents
Intelligent scheduling method of privacy calculation coordination center Download PDFInfo
- Publication number
- CN116662066A CN116662066A CN202310175079.0A CN202310175079A CN116662066A CN 116662066 A CN116662066 A CN 116662066A CN 202310175079 A CN202310175079 A CN 202310175079A CN 116662066 A CN116662066 A CN 116662066A
- Authority
- CN
- China
- Prior art keywords
- privacy computing
- data
- request
- coordination center
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004364 calculation method Methods 0.000 title abstract description 15
- 238000007726 management method Methods 0.000 claims abstract description 19
- 238000013523 data management Methods 0.000 claims abstract description 8
- 210000001503 joint Anatomy 0.000 claims abstract description 6
- 230000008569 process Effects 0.000 claims description 24
- 239000003999 initiator Substances 0.000 claims description 21
- 238000012545 processing Methods 0.000 claims description 17
- 230000000977 initiatory effect Effects 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 8
- 230000001360 synchronised effect Effects 0.000 claims description 5
- 230000005540 biological transmission Effects 0.000 abstract description 18
- 238000004519 manufacturing process Methods 0.000 abstract description 4
- 238000012546 transfer Methods 0.000 abstract description 4
- 238000003032 molecular docking Methods 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 abstract description 2
- 230000003993 interaction Effects 0.000 description 7
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000002452 interceptive effect Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 3
- 102000016550 Complement Factor H Human genes 0.000 description 2
- 108010053085 Complement Factor H Proteins 0.000 description 2
- 238000007477 logistic regression Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000007474 system interaction Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1464—Management of the backup or restore process for networked environments
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1469—Backup restoration techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses an intelligent scheduling method of a privacy computing coordination center. In order to solve the problems that the third party mode and the no third party mode of the technology cannot flexibly schedule according to the characteristics of operators and the environment of calculation, storage and transmission in actual operation, the flexibility is lacking and the overall performance is poor; the application comprises the following contents: the privacy computing nodes are registered in the coordination center, and connection between the privacy computing nodes is carried out through the coordination center according to the connection request; the privacy computing platform is in butt joint with the data transaction platform through user management, data management and project management in the coordination center. The coordination center is used for realizing connection transfer, intelligent scheduling and data backup among privacy computing nodes and when the privacy computing interacts with other systems, so that the production degree is higher, the docking efficiency is higher, and the operation efficiency is higher.
Description
Technical Field
The application relates to the field of privacy computation coordination, in particular to an intelligent scheduling method of a privacy computation coordination center.
Background
The coordination center is a software module in the privacy computing system and is used for communication, butt joint and data transmission between privacy computing nodes and between the privacy computing nodes and other systems. The main technology at present is that the nodes directly write in the connection relation in the database, the privacy computing system is basically not in butt joint with other systems, and no coordination center exists. Most of the privacy computing products on the market exist with a third party or are double-ended by one party.
The third party C distributes the same public key for the two computing (data) parties A and B at the beginning, and the third party C holds the corresponding private key; the A side and the B side respectively perform corresponding calculation on own data, encrypt an intermediate result based on own data by using a public key, and send ciphertext to the third party C; and the third party C decrypts the intermediate result ciphertext from each party by using the private key to obtain intermediate result plaintext of each party, and collects and obtains a complete intermediate result. This process is iterated until the end condition is met.
From the end result, the third party C obtains information which is not obtained by itself in the participation process. Whether or not this information exposes the privacy data of the other parties is structurally related to the algorithm itself that is running: for example, in the logistic regression algorithm, the participant calculates an inner product based on own data and sends it to the coordinator in an encrypted manner, and the coordinator cannot obtain the original data because the inner product data well masks the original data. However, not all intermediate results of the algorithm can be as logistic regression problem without exposing the original data of the participants.
The coordination of the third party does bring great convenience to the design and implementation of the protocol. But in practice the third party itself is built up at a significant cost. However, the so-called double third party, although only two parties participate in the whole process, does not solve the problem existing in the scheme with the third party in practice, wherein the information of one party still has the risk of exposure.
Compared with the scheme with the third party participation, the scheme without the third party participation based on the MPC abandons the coordinator from the beginning of protocol design.
The MPC protocol theoretically requires that the participants not obtain additional information other than the own input and own calculation result output. The MPC has only information interactions between the parties and the interaction process during protocol execution does not leak the parties' private data. This is guaranteed by the bottom layer of the protocol design. For example, in a garbled circuit, the participants map their respective inputs to random keys while maintaining a garbled truth table between the inputs and outputs of the participants. All parties interact with each other only with respect to the ciphertext corresponding to the truth table, without including any input and output data.
The scheme without the participation of the third party based on the MPC protects the privacy data of the participants more thoroughly, and the scheme with the participation of the third party needs to depend on the credibility of the third party or the structure of an intermediate result to ensure the privacy of the data. However, in the prior art, the third party mode and the no third party mode cannot flexibly schedule according to the characteristics of operators and the environment of computing, storing and transmitting during actual operation, so that flexibility is lacked and overall performance is poor.
Disclosure of Invention
The method mainly solves the problems that in the prior art, a third party mode and a no third party mode can not flexibly schedule according to the characteristics of operators and the environment of calculation, storage and transmission, and the method lacks flexibility and has poor overall performance; an intelligent scheduling method of a privacy computation coordination center is provided.
The technical problems of the application are mainly solved by the following technical proposal:
an intelligent scheduling method of a privacy computation coordination center comprises the following steps:
the privacy computing nodes are registered in the coordination center, and connection between the privacy computing nodes is carried out through the coordination center according to the connection request; the privacy computing platform is in butt joint with the data transaction platform through user management, data management and project management in the coordination center.
According to the scheme, the coordination center is used for realizing connection transfer, intelligent scheduling and data backup among privacy computing nodes and when the privacy computing interacts with other systems, so that the production degree is higher, the docking efficiency is higher, and the operation efficiency is higher.
Preferably, the process of registering the privacy computing node in the coordination center is as follows:
the privacy computing node inquires available node numbers from a coordination center, and the coordination center distributes the corresponding node numbers;
the privacy computing node installs the privacy computing node by using the node number; the installed privacy computing nodes comprise various privacy computing frameworks supported;
the installed privacy computing node comprises a coordination center public key, a node private key, node company information and node connection configuration;
the privacy computing node feedback node number, the node public key, the node company information and the node connection configuration are registered in a coordination center, and the coordination center stores the feedback information of the privacy computing node.
Preferably, the connection procedure between the privacy computing nodes includes:
the request process comprises the steps that a connection request of a privacy computing node of a request initiator is sent to the privacy computing node of a request receiver through validity judgment and connection judgment of a coordination center;
and in the response process, the request feedback information of the privacy computing node of the request receiver is sent to the privacy computing node of the request initiator after the validity judgment and the connection judgment of the coordination center.
The connection between the plurality of privacy computing nodes is achieved through a coordination center.
Preferably, the request process specifically includes:
the privacy computing node of the request initiator sends a connection request comprising the node number of the other party to a handshake initiating connection interface of the coordination center;
the coordination center judges whether the privacy computing node of the request receiver exists and is legal according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, the illegal request is fed back to the request initiator;
judging whether the privacy computing node of the request receiver has connection or not, if so, feeding back the existing connection to the request initiator; otherwise, synchronizing the request to the privacy computing node of the request receiver;
the privacy computing node of the request receiver judges whether the request is connected or repeated, if yes, the processing fails, and request repeated information is fed back to the request initiator through the coordination center; if not, the processing is successful, the connection request is recorded, and the information waiting for the receiving of the other party is fed back to the request initiator through the coordination center.
Preferably, the response process specifically includes:
the privacy computing node of the request receiver sends response information comprising agreement or refusal of the node number of the opposite party and the request number to the handshake reply connection interface of the coordination center;
the coordination center judges whether the privacy computing node of the request sender exists and is legal according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, feeding back the illegal request to the request receiver;
judging whether the privacy computing node of the request sender has connection or not, if so, feeding back the connection to the request receiver; otherwise, carrying out connection logic processing;
the request receiver agrees or refuses the request callback and inquires the reply record; judging whether the node agrees with the connection, if so, feeding back the information of agreeing with the connection and interconnecting the nodes to a connection request reply interface of a request sender through a coordination center; if not, the coordination center feeds back a refusal connection process to the connection request reply interface of the request sender;
the request sender judges whether the request receiver agrees with the connection, if yes, the connection processing is agreed, and the privacy encryption node of the request sender acquires the information of the privacy encryption node of the request receiver; if not, refusing the connection processing and recording the connection request.
Preferably, the user management includes synchronizing enterprise authentication information of authenticated enterprise users in the data transaction platform to the privacy computing platform and synchronizing merchant identities of merchant-resident users in the data transaction platform to the privacy computing platform.
Preferably, the data management includes the following steps:
the newly added data is put on line, the coordination center judges whether merchant identities exist in the privacy computing platform, if yes, the intermediate table of the data transaction platform, which is used for synchronizing the data information and the data for the first time after the synchronization, is checked; if not, synchronization is not possible.
Preferably, when the data in the privacy computing platform is off-line, judging whether the data is associated with a valid order, if so, entering the next step of judgment, otherwise, synchronizing the data off-line state to an intermediate table of the data transaction platform;
judging whether a user confirms that the data is offline, if so, synchronizing the data offline state to an intermediate table of the data transaction platform; otherwise, ending;
when deleting the data in the offline state in the privacy computing platform, judging whether the data is associated with a valid order, if so, failing to delete, otherwise, synchronizing the data deleting state to an intermediate table of the data transaction platform.
Preferably, when the data in the offline state is online again in the privacy computing platform, synchronizing the latest data information and the data update state to an intermediate table of the data transaction platform;
when the data in the online state is desynchronized in the privacy computing platform, judging whether the data is associated with a valid order, if so, desynchronizing, otherwise, synchronizing the data and desynchronizing the intermediate table of the data transaction platform;
and when the data in the synchronization canceling state is synchronized again in the privacy computing platform, synchronizing the latest data information and the data updating state to an intermediate table of the data transaction platform.
Preferably, the project management includes the following procedures:
when initiating a project on a privacy computing platform, judging whether an initiating object is an authenticated enterprise user, if so, entering a next step of judgment, otherwise, judging that no order information exists, and ending;
judging whether valid orders are associated and the data state is on, if so, displaying all nodes and data associated with the valid orders; otherwise, ending;
and carrying out project management operation after the nodes and the data associated with the orders are automatically checked, judging whether the valid/invalid states of the associated orders are changed, if so, enabling the data to pass through the automatic checking, and if not, displaying the corresponding manual checking states according to the data use setting.
The beneficial effects of the application are as follows:
according to the scheme, the coordination center is used for realizing connection transfer, intelligent scheduling and data backup among privacy computing nodes and when the privacy computing interacts with other systems, so that the production degree is higher, the docking efficiency is higher, and the operation efficiency is higher.
Drawings
FIG. 1 is a flow chart of a privacy computing node of the present application registered with a coordination center.
Fig. 2 is a flow chart of a connection between privacy computing nodes of the present application.
FIG. 3 is a flow chart of user management of the present application.
FIG. 4 is a flow chart of data management of the present application.
Fig. 5 is a flow chart of the project management of the present application.
Detailed Description
The technical scheme of the application is further specifically described below through examples and with reference to the accompanying drawings.
Examples:
the intelligent scheduling method of the privacy computation coordination center of the embodiment comprises the following steps:
1. the privacy computing nodes are registered in the coordination center, and connection between the privacy computing nodes is carried out through the coordination center according to the connection request.
A) As shown in fig. 1, the process of registering a privacy computing node in a coordination center is:
A1. the privacy computing node inquires available node numbers from a coordination center, and the coordination center distributes the corresponding node numbers.
A2. The privacy computing node installs the privacy computing node using the node number.
The installed privacy computing nodes include various privacy computing frameworks that are supported.
A3. The installed privacy computing node comprises a coordination center public key, a node private key, node company information and node connection configuration.
A4. The privacy computing node feedback node number, the node public key, the node company information and the node connection configuration are registered in a coordination center, and the coordination center stores the feedback information of the privacy computing node.
B) As shown in fig. 2, the connection procedure between privacy computing nodes includes:
B1. and in the request process, the connection request of the privacy computing node of the request initiator is sent to the privacy computing node of the request receiver after the validity judgment and the connection judgment of the coordination center.
And B1-1, the privacy computing node of the request initiator transmits a connection request comprising the number of the opposite node to a handshake initiating connection interface of the coordination center.
B1-2, judging whether the privacy computing node of the request receiver exists and is legal or not by the coordination center according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, the illegal request is fed back to the request initiator.
B1-3, judging whether the privacy computing node of the request receiver has connection, if so, feeding back the connection to the request initiator; otherwise, the request is synchronized with the privacy computing node of the request receiver.
B1-4, the privacy computing node of the request receiver judges whether the request is connected or repeated, if so, the processing fails, and the request repeated information is fed back to the request initiator through the coordination center; if not, the processing is successful, the connection request is recorded, and the information waiting for the receiving of the other party is fed back to the request initiator through the coordination center.
B2. And in the response process, the request feedback information of the privacy computing node of the request receiver is sent to the privacy computing node of the request initiator after the validity judgment and the connection judgment of the coordination center.
And B2-1, the privacy computing node of the request receiver sends response information comprising agreement or rejection of the opposite node number and the request number to the handshake reply connection interface of the coordination center.
B2-2, judging whether the privacy computing node of the request sender exists and is legal or not by the coordination center according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, the illegal request is fed back to the request receiver.
B2-3, judging whether the privacy computing node of the request sender has connection or not, if so, feeding back the connection to the request receiver; otherwise, the connection logic processing is carried out.
B2-4, the request receiver agrees or refuses the request callback and inquires the reply record; judging whether the node agrees with the connection, if so, feeding back the information of agreeing with the connection and interconnecting the nodes to a connection request reply interface of a request sender through a coordination center; if not, the coordination center feeds back the refusal connection processing to the connection request reply interface of the request sender.
B2-5, the request sender judges whether the request receiver agrees to connect, if yes, the connection processing is agreed, and the privacy encryption node of the request sender acquires the information of the privacy encryption node of the request receiver; if not, refusing the connection processing and recording the connection request.
2. The privacy computing platform is in butt joint with the data transaction platform through user management, data management and project management in the coordination center.
C) As shown in fig. 3, user management includes synchronizing enterprise authentication information of authenticated enterprise users in the data transaction platform to the privacy computing platform and synchronizing merchant identities of merchant-resident users in the data transaction platform to the privacy computing platform.
D) As shown in fig. 4, the data management includes the following process:
D1. the newly added data is put on line, the coordination center judges whether merchant identities exist in the privacy computing platform, if yes, the intermediate table of the data transaction platform, which is used for synchronizing the data information and the data for the first time after the synchronization, is checked; if not, synchronization is not possible.
D2. When the data in the privacy computing platform is off-line, judging whether the data is associated with a valid order, if so, entering the next step of judgment, otherwise, synchronizing the data off-line state to an intermediate table of the data transaction platform.
D3. Judging whether a user confirms that the data is offline, if so, synchronizing the data offline state to an intermediate table of the data transaction platform; otherwise, ending.
D4. When deleting the data in the offline state in the privacy computing platform, judging whether the data is associated with a valid order, if so, failing to delete, otherwise, synchronizing the data deleting state to an intermediate table of the data transaction platform.
D5. And when the data in the offline state is online again in the privacy computing platform, synchronizing the latest data information and the data updating state to an intermediate table of the data transaction platform.
D6. When the data in the online state is desynchronized in the privacy computing platform, judging whether the data is associated with a valid order, if yes, desynchronizing, otherwise, synchronizing the data, and desynchronizing the data to an intermediate table of the data transaction platform.
D7. And when the data in the synchronization canceling state is synchronized again in the privacy computing platform, synchronizing the latest data information and the data updating state to an intermediate table of the data transaction platform.
E) As shown in fig. 5, the project management includes the following processes:
E1. when initiating a project on a privacy computing platform, judging whether an initiating object is an authenticated enterprise user, if so, entering a next step of judgment, otherwise, judging that no order information exists, and ending;
e2: judging whether valid orders are associated and the data state is on, if so, displaying all nodes and data associated with the valid orders; otherwise, ending;
E3. and carrying out project management operation after the nodes and the data associated with the orders are automatically checked, judging whether the valid/invalid states of the associated orders are changed, if so, enabling the data to pass through the automatic checking, and if not, displaying the corresponding manual checking states according to the data use setting.
The scheme of the embodiment realizes connection transfer, intelligent scheduling and data backup among privacy computing nodes and when the privacy computing interacts with other systems through the coordination center, and has higher production degree, higher butting efficiency and higher running efficiency.
Embodiment two:
according to the intelligent scheduling method for the privacy computing coordination center, a plurality of coordination centers are deployed in different environments, high scheduling efficiency is achieved through an intelligent task scheduling mechanism, and meanwhile real-time backup of data is conducted among the coordination centers.
By adopting the scheme in the first embodiment, coordination centers are deployed in different environments respectively, and the task scheduling process between multiple coordination centers is as follows:
the coordination centers construct mutual interaction to form a coordination center alliance. The coordination center consortium protocol generates a random circular string key or recurring string key.
Each coordination center intercepts the corresponding digital string from the ring digital string key or the circulated character string key to be used as the corresponding alliance encryption key, and each coordination center records the intercepted position, the number of the digits and the intercepted direction to be used as the alliance decryption key.
When the data transaction platforms in different environments propose interaction, the corresponding coordination center judges whether the opposite party is in the same coordination center alliance, if so, the interaction is performed, and if not, the coordination center is added into the same coordination center alliance.
The interactive data is encrypted by a alliance encryption key of a coordination center where a data sender is located; the interaction data may be plaintext data, ciphertext encrypted by the privacy node, and a private key of the privacy node.
The interactive data receiver decrypts the encrypted interactive data by the alliance decryption key of the coordination center alliance query data sender to obtain the interactive data for system interaction and backup among different environments.
The embodiment only optimizes interaction of coordination centers deployed in different environments, and other contents are the same as the first embodiment.
Embodiment III:
according to the intelligent scheduling method of the privacy computation coordination center, in the scheme of deploying a trusted third party, whether data transmission and computation are performed through the third party is intelligently selected according to operator characteristics, computing resources, storage resources, transmission resources and the like on the premise that data safety and data leakage are guaranteed. High efficiency of privacy computation is achieved.
Specifically, comparing operator characteristics, calculation resources, storage resources and transmission resources with threshold values respectively, converting the operator characteristics, the calculation resources, the storage resources and the transmission resources into numerical values, carrying out normalization processing, and carrying out weighted calculation to obtain judgment factors; when the judgment factor is larger than the judgment threshold, carrying out data transmission and calculation by a third party; otherwise, the data transmission and calculation are not carried out by the third party.
Judgment factor H j The calculation process of (1) is as follows:
H j ＝α 1 ·P o +α 2 ·P c +α 3 ·P r +α 4 ·P t
wherein alpha is 1 、α 2 、α 3 And alpha 4 The weighting coefficients of the operator characteristics, the computing resources, the storage resources and the transmission resources are respectively.
P o As the conversion value of the operator characteristics, when the operator characteristics exist in a preset operator characteristic list, P o Taking 1; otherwise P o Taking 0.
P c For the conversion value of the computing resource, P is calculated when the computing resource is smaller than the preset computing resource threshold c Taking 0; otherwise the first set of parameters is selected,
wherein P is cc P for the current computing resource cs Is a set computational resource threshold.
P r For the conversion value of the storage resource, when the storage resource is smaller than the preset storage resource threshold value, P r Taking 0; otherwise the first set of parameters is selected,
wherein P is rr P is the current storage resource rs And (5) setting a storage resource threshold value.
P t For the conversion value of the transmission resource, when the transmission resource is smaller than the preset transmission resource threshold value, P t Taking 0; otherwise the first set of parameters is selected,
wherein P is tt P for the current transmission resource ts And (5) setting a transmission resource threshold value.
When judging factor H j Greater than the settingWhen judging the threshold value, carrying out data transmission and calculation by a third party; otherwise, the data transmission and calculation are not carried out by the third party.
In this embodiment, only the process of intelligently selecting whether to perform data transmission and calculation by a third party is optimized, and other contents are the same as those in the first embodiment.
It should be understood that the examples are only for illustrating the present application and are not intended to limit the scope of the present application. Furthermore, it should be understood that various changes and modifications can be made by one skilled in the art after reading the teachings of the present application, and such equivalents are intended to fall within the scope of the application as defined in the appended claims.
Claims (10)
1. An intelligent scheduling method of a privacy computation coordination center is characterized by comprising the following steps:
the privacy computing nodes are registered in the coordination center, and connection between the privacy computing nodes is carried out through the coordination center according to the connection request;
the privacy computing platform is in butt joint with the data transaction platform through user management, data management and project management in the coordination center.
2. The intelligent scheduling method of a privacy computing coordination center according to claim 1, wherein the process of registering the privacy computing node in the coordination center is:
the privacy computing node inquires available node numbers from a coordination center, and the coordination center distributes the corresponding node numbers;
the privacy computing node installs the privacy computing node by using the node number; the installed privacy computing nodes comprise various privacy computing frameworks supported;
the installed privacy computing node comprises a coordination center public key, a node private key, node company information and node connection configuration;
the privacy computing node feedback node number, the node public key, the node company information and the node connection configuration are registered in a coordination center, and the coordination center stores the feedback information of the privacy computing node.
3. An intelligent scheduling method for a privacy computing coordination center according to claim 1 or 2, wherein the connection procedure between the privacy computing nodes comprises:
the request process comprises the steps that a connection request of a privacy computing node of a request initiator is sent to the privacy computing node of a request receiver through validity judgment and connection judgment of a coordination center;
and in the response process, the request feedback information of the privacy computing node of the request receiver is sent to the privacy computing node of the request initiator after the validity judgment and the connection judgment of the coordination center.
4. The intelligent scheduling method of the privacy computing coordination center according to claim 3, wherein the request process specifically comprises the following steps:
the privacy computing node of the request initiator sends a connection request comprising the node number of the other party to a handshake initiating connection interface of the coordination center;
the coordination center judges whether the privacy computing node of the request receiver exists and is legal according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, the illegal request is fed back to the request initiator;
judging whether the privacy computing node of the request receiver has connection or not, if so, feeding back the existing connection to the request initiator; otherwise, synchronizing the request to the privacy computing node of the request receiver;
the privacy computing node of the request receiver judges whether the request is connected or repeated, if yes, the processing fails, and request repeated information is fed back to the request initiator through the coordination center; if not, the processing is successful, the connection request is recorded, and the information waiting for the receiving of the other party is fed back to the request initiator through the coordination center.
5. The intelligent scheduling method of the privacy computing coordination center according to claim 3, wherein the response process specifically comprises:
the privacy computing node of the request receiver sends response information comprising agreement or refusal of the node number of the opposite party and the request number to the handshake reply connection interface of the coordination center;
the coordination center judges whether the privacy computing node of the request sender exists and is legal according to the node number of the opposite party; if yes, entering a connection judgment; otherwise, feeding back the illegal request to the request receiver;
judging whether the privacy computing node of the request sender has connection or not, if so, feeding back the connection to the request receiver; otherwise, carrying out connection logic processing;
the request receiver agrees or refuses the request callback and inquires the reply record; judging whether the node agrees with the connection, if so, feeding back the information of agreeing with the connection and interconnecting the nodes to a connection request reply interface of a request sender through a coordination center; if not, the coordination center feeds back a refusal connection process to the connection request reply interface of the request sender;
the request sender judges whether the request receiver agrees with the connection, if yes, the connection processing is agreed, and the privacy encryption node of the request sender acquires the information of the privacy encryption node of the request receiver; if not, refusing the connection processing and recording the connection request.
6. The intelligent scheduling method of claim 1, wherein the user management includes synchronizing enterprise authentication information of authenticated enterprise users in the data transaction platform to the privacy computing platform and synchronizing merchant identities of merchant-resident users in the data transaction platform to the privacy computing platform.
7. The intelligent scheduling method of a privacy computing coordination center according to claim 1 or 6, wherein the data management comprises the following steps:
the newly added data is put on line, the coordination center judges whether merchant identities exist in the privacy computing platform, if yes, the intermediate table of the data transaction platform, which is used for synchronizing the data information and the data for the first time after the synchronization, is checked; if not, synchronization is not possible.
8. The intelligent scheduling method of a privacy computing coordination center according to claim 7, wherein when the data in the privacy computing platform is offline, judging whether the data is associated with a valid order, if yes, entering the next step of judgment, otherwise, synchronizing the offline state of the data to an intermediate table of the data transaction platform;
judging whether a user confirms that the data is offline, if so, synchronizing the data offline state to an intermediate table of the data transaction platform; otherwise, ending;
when deleting the data in the offline state in the privacy computing platform, judging whether the data is associated with a valid order, if so, failing to delete, otherwise, synchronizing the data deleting state to an intermediate table of the data transaction platform.
9. The intelligent scheduling method of a privacy computing coordination center according to claim 7, wherein when the data in the privacy computing platform is online again, the latest data information and the data update state are synchronized to an intermediate table of the data transaction platform;
when the data in the online state is desynchronized in the privacy computing platform, judging whether the data is associated with a valid order, if so, desynchronizing, otherwise, synchronizing the data and desynchronizing the intermediate table of the data transaction platform;
and when the data in the synchronization canceling state is synchronized again in the privacy computing platform, synchronizing the latest data information and the data updating state to an intermediate table of the data transaction platform.
10. The intelligent scheduling method of a privacy computing coordination center according to claim 1 or 6, wherein the project management comprises the following steps:
when initiating a project on a privacy computing platform, judging whether an initiating object is an authenticated enterprise user, if so, entering a next step of judgment, otherwise, judging that no order information exists, and ending;
judging whether valid orders are associated and the data state is on, if so, displaying all nodes and data associated with the valid orders; otherwise, ending;
and carrying out project management operation after the nodes and the data associated with the orders are automatically checked, judging whether the valid/invalid states of the associated orders are changed, if so, enabling the data to pass through the automatic checking, and if not, displaying the corresponding manual checking states according to the data use setting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310175079.0A CN116662066A (en) | 2023-02-15 | 2023-02-15 | Intelligent scheduling method of privacy calculation coordination center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310175079.0A CN116662066A (en) | 2023-02-15 | 2023-02-15 | Intelligent scheduling method of privacy calculation coordination center |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116662066A true CN116662066A (en) | 2023-08-29 |
Family
ID=87726721
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310175079.0A Pending CN116662066A (en) | 2023-02-15 | 2023-02-15 | Intelligent scheduling method of privacy calculation coordination center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116662066A (en) |
-
2023
- 2023-02-15 CN CN202310175079.0A patent/CN116662066A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112287029B (en) | Block chain multi-chain cross-chain system and implementation mechanism thereof | |
| CN110868438B (en) | Block chain network system | |
| CN109936457B (en) | Block chain multi-party witness method, device, equipment and computer readable storage medium | |
| WO2017122187A2 (en) | Methods and systems implemented in a network architecture with nodes capable of performing message-based transactions | |
| CN111445328A (en) | Cross-link gateway interaction system and method and supply chain data management method | |
| US20050018827A1 (en) | Conference call invitation with security | |
| CN109741068B (en) | Online banking cross-row signing method, device and system | |
| CN111338906B (en) | Terminal equipment, edge node and block chain-based application supervision method and system | |
| CN111866042B (en) | Method and device for synchronizing telecommunication account number change | |
| CN115328645A (en) | Computing task scheduling method, computing task scheduling device and electronic equipment | |
| WO2024093426A1 (en) | Federated machine learning-based model training method and apparatus | |
| CN112866380A (en) | Chain network architecture based on block chain | |
| CN110971506B (en) | Decentralized real-time cluster communication method, device, equipment and system | |
| CN114090983A (en) | Heterogeneous federated learning platform communication method and device | |
| CN114202329A (en) | Service processing method, device, node equipment and storage medium | |
| US20220123924A1 (en) | Method for providing a state channel | |
| CN107577700A (en) | The processing method and processing device of database disaster tolerance | |
| CN1649299B (en) | Comlex management system and complex conversation management server for applicating programme | |
| CN112100145A (en) | Digital model sharing learning system and method | |
| CN111709053A (en) | Operation method and operation device based on loose coupling transaction network | |
| CN116662066A (en) | Intelligent scheduling method of privacy calculation coordination center | |
| CN114760602B (en) | Holographic communication method, device, system and computer readable storage medium | |
| CN115865537A (en) | Privacy calculation method based on centralized system management, electronic equipment and storage medium | |
| CN109460388A (en) | Electronic card generation method, device and storage medium | |
| CN115086352A (en) | Block chain event processing method and related device, platform and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |