CN113886458A - Distributed hiding query method and system based on task aggregation - Google Patents
Distributed hiding query method and system based on task aggregation Download PDFInfo
- Publication number
- CN113886458A CN113886458A CN202111114101.8A CN202111114101A CN113886458A CN 113886458 A CN113886458 A CN 113886458A CN 202111114101 A CN202111114101 A CN 202111114101A CN 113886458 A CN113886458 A CN 113886458A
- Authority
- CN
- China
- Prior art keywords
- aggregation
- result
- request
- subtask
- coordination center
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/25—Fusion techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Artificial Intelligence (AREA)
- Life Sciences & Earth Sciences (AREA)
- Software Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Mathematical Physics (AREA)
- Fuzzy Systems (AREA)
- Computational Linguistics (AREA)
- Databases & Information Systems (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The disclosure provides a distributed hiding query method and a distributed hiding query system based on task aggregation, and aims to solve the problem of data information leakage when joint calculation or modeling is required to be carried out on data information of other units or mechanisms. The query method comprises the following steps: the operation coordination center receives a query request initiated by a request end and matches a service strategy; the main task is disassembled into subtasks; the operation coordination center aggregates the same type of subtasks; mapping and addressing each aggregation subtask; loading a data calculation algorithm matched with the aggregation subtask to obtain an operation result; carrying out confusion encryption on the operation results of all the participating terminals and sending the confused encryption results; each participating end calculates the encryption result to obtain an intermediate result; the operation coordination center carries out result aggregation on all intermediate results to obtain an aggregation subtask result; the operation coordination center carries out aggregation operation on all subtask results to form a main task result and feeds the main task result back to the request end; the data security is ensured through the disassembly of the main task and the obfuscation encryption.
Description
Technical Field
The disclosure belongs to the technical field of data information query, and particularly relates to a distributed hiding query method and system based on task aggregation.
Background
Currently, in the industries of insurance, banking, education, etc., some data information among various units is isolated and not shared, and one unit obtains some comprehensive data, such as: one unit needs to acquire data information of a certain client in different units, needs to send requests to different units and call the data information of different units to acquire complete data; in the prior art, if these data information are called, on one hand, the request information of the requester is leaked to other units, and on the other hand, the unit providing the data is leaked to the data information of the unit; in addition, the aggregation degree of the requested data in the prior art is low, so that the data operation amount is large, and the calculation efficiency is low.
Disclosure of Invention
The disclosure provides a distributed hiding query method and a distributed hiding query system based on task aggregation, and aims to solve the problem that when other unit data information is acquired, the requested data of a requester and the data information of a unit providing data can be leaked in the prior art.
In order to solve the technical problem, the technical scheme adopted by the disclosure is as follows:
in a first aspect, the present disclosure provides a distributed hiding query method based on task aggregation, including the following steps:
s101, receiving a query request initiated by a request end by an operation coordination center, and performing service policy identification on the query request to obtain a matched service policy;
s102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
s103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
s104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
s105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, performing the operation of the aggregation subtask, and obtaining the operation result of the aggregation subtask;
s106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
s107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end;
s108, each participating end sends the respective intermediate result to the operation coordination center;
s109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
s111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, and a main task result is formed;
and S112, the operation coordination center feeds back the main task result to the request end.
The further improved scheme is as follows: when a business strategy matched with a query request is selected, the query request comprises a standard request and a non-standard request;
when the query request is a standard request, the operation coordination center directly calls a service strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
The further improved scheme is as follows: the request end and the participation end are both data ends with the same authority; and when one data end is a request end, the other data ends are participation ends of the request end.
The further improved scheme is as follows: at least one of the request terminals is provided.
The further improved scheme is as follows: in step S106, the obfuscating encrypting step includes:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
In a second aspect, the present disclosure provides a distributed insidious query system based on task aggregation, including: the operation coordination center and the data terminals are arranged; when one of the data terminals is a request terminal, the other data terminals are participation terminals; when the data terminal initiates a query request to a request terminal, the following steps are executed:
s101, the operation coordination center receives a query request initiated by the request end, and performs service policy identification on the query request to obtain a matched service policy;
s102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
s103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
s104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
s105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, performing the operation of the aggregation subtask, and obtaining the operation result of the aggregation subtask;
s106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
s107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end;
s108, each participating end sends the respective intermediate result to the operation coordination center;
s109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
s111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, and a main task result is formed;
and S112, the operation coordination center feeds back the main task result to the request end.
In a further improved scheme, when a business strategy matched with a query request is selected, the query request comprises a standard request and a non-standard request;
when the query request is a standard request, the operation coordination center directly calls a service strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
In a further improved scheme, at least one of the request terminals is provided.
In a further improved scheme, in step S106, the step of obfuscating the encryption includes:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
The beneficial effect of this disclosure does:
in the disclosure, a main task of a query request is decomposed into a plurality of subtasks through a service request strategy, the subtasks of the same type are aggregated into one aggregated subtask, and the aggregated subtask is calculated; and performing aggregation operation on all subtasks of the main task to form a main task result. The main task is divided into a plurality of subtasks, and the subtasks are used as basic units for inquiring data, so that on one hand, the data can be inquired more accurately, and on the other hand, different subtasks can be combined into various inquiry requests, so that the whole operating system can adopt fewer data calculation algorithms; in addition, by aggregating the same type of subtasks into one aggregated subtask for calculation, repeated calculation can be reduced, and the calculation efficiency is improved.
The main task of the query request is divided into a plurality of subtasks through a service request strategy, and each participating end receives the divided subtasks, so that the main task of the query request cannot be reversely pushed out, and the security of the request data is ensured. Performing confusion encryption on the operation result of the aggregation subtask through each participating end, and sending the confused encryption result to each participating end; the data of each participant terminal acquired by the request terminal can be obfuscated, and data information of a unit providing the data is ensured not to be leaked.
According to the data query method and the data query device, the main task of the query request is firstly disassembled into the subtasks, and then the obtained subtask operation results are aggregated into the operation results of the main task, so that the purpose of data query is achieved.
Drawings
FIG. 1 is a schematic flow chart of a distributed hidden query method based on task aggregation according to the present invention
Detailed Description
The technical solution in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure. It should be understood that the specific embodiments described herein are merely illustrative of the disclosure and are not intended to limit the disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the disclosure without inventive step, are within the scope of the disclosure.
The first embodiment is as follows:
the distributed hiding query method based on task aggregation provided by the embodiment comprises the following steps of:
s101, receiving a query request initiated by a request end by an operation coordination center, and performing service policy identification on the query request to obtain a matched service policy;
the operation coordination center refers to a service end, such as an operation platform end, which provides the whole operation system.
The requesting end and the participating end are both data ends with the same authority; when one of the data terminals is a request terminal, the other data terminals are participation terminals of the request terminal; the data terminal can be a plurality of insurance companies, a plurality of banks and the like.
One or more request terminals may exist at the same time.
When the data end is a plurality of insurance companies, the query request can query the insurance records of a person in the last 3 months of all the participating ends.
The service strategy is a predefined inquiry process and requirement according to the inquiry request.
S102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
the main task disassembling step has the functions of hiding the query purpose and optimizing the query mode. For example: taking insurance application as an example, a request end applies for inquiring whether a person has a fraud or not, and the inquiry result needs to be obtained by comprehensively calculating the inquiry results of a plurality of insurance companies. Therefore, the operation coordination center disassembles the request into subtasks suitable for operation of a single insurance company (a participating end) through policy mapping and the like, such as "record of insurance behavior of a person in the latest 3 months of the insurance company", "record of insurance of a person in the latest 3 months of the insurance company", and the like.
S103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
the same-class subtask aggregation refers to that two or more completely same subtasks are used as one subtask to be calculated, and only one calculation is needed, so that the calculation efficiency is improved.
S104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
wherein, the mapping addressing aims at routing the model or algorithm related to the aggregation subtask to the corresponding participating end; and loading corresponding data calculation models/calculation algorithms by the participating terminals receiving the aggregation subtasks.
And S105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, performing the operation of the aggregation subtask, and obtaining the operation result of the aggregation subtask.
The data calculation algorithm is matched with the corresponding algorithm according to different aggregation subtasks and different algorithms are adopted, and the data calculation algorithm for processing a single aggregation subtask can be realized by the prior art, which does not belong to the innovation point of the invention and is not described again.
S106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
further, the obfuscating encryption step includes:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
For example: and calculating the insurance application records of a certain person at all participating terminals in nearly 3 months, and after receiving the request, locally calculating the insurance application records of the person at the participating terminal by the participating terminal. Assuming 3 participating nodes, the result of all participating nodes is recorded as A, B, C, and the data of the participating nodes is disassembled as shown in table 1:
table 1 participating end results breakdown example
| Participating end | Calculation results | Data No. 1 | Data of 2 nd | Data No. 3 |
| A | A | Xa0 | Xa1 | Xa2 |
| B | B | Xb0 | Xb1 | Xb2 |
| C | C | Xc0 | Xc1 | Xc2 |
Randomly dividing the result of A into 3 parts so that A is equal to Xa0+Xa1+Xa2(ii) a Likewise, B ═ Xb0+Xb1+Xb2、 C＝Xc0+Xc1+Xc2；
Sending two of a to B, C, two of B to A, C, and two of C to B, C, respectively, the following may be possible:
table 2 participant obfuscated encryption results example
| Participating end | Data No. 1 | Data of 2 nd | Data No. 3 |
| A | Xa0 | Xb1 | Xc2 |
| B | Xa2 | Xb2 | Xc3 |
| C | Xa1 | Xb3 | Xc1 |
Since the participating end only obtains one piece of random data of other participating ends and can not deduce the original data of other participating ends, the data privacy of all participating ends can not be revealed.
And S107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end.
Carrying stepExample of step S106: after receiving the encryption result, the participating end uses the same decryption algorithm to operate the result again to obtain an intermediate result Ri of the participating end, in the example of S106, a is confused and then a is calculated to obtain a result Ra＝Xa0+Xb1+Xc2B result of post-obfuscation calculation Rb＝Xa2+Xb2+Xc3C result of calculation after obfuscation Rc＝Xa1+Xb3+Xc1See table 3.
Table 3 participant end result mix calculation example
Since the data are merely replaced with each other and are not changed or increased or decreased, the total number S + B + C-Ra+Rb+RcThe result is computed based on the obfuscated result, so no data privacy is revealed.
And S108, each participating end sends the respective intermediate result to the operation coordination center.
S109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
in the case of S107, S ═ Ra+Rb+RcEqual to the final result a + B + C, but A, B, C is not known to the other participating end.
And S111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, so as to form a main task result.
And S112, the operation coordination center feeds back the main task result to the request end.
On the basis of the scheme, when a business strategy matched with an inquiry request is selected, the inquiry request comprises a standard request and a non-standard request;
when the query request is a standard request (for the standard request, a request end can directly select from a list box), the operation coordination center directly calls a business strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
Example two:
the embodiment provides a distributed hiding query system based on task aggregation, which comprises: the operation coordination center and the data terminals are arranged; when one of the data terminals is a request terminal, the other data terminals are participation terminals; when the data terminal initiates a query request to a request terminal, the following steps are executed:
s101, the operation coordination center receives a query request initiated by the request end, and performs service policy identification on the query request to obtain a matched service policy;
s102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
s103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
s104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
s105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, and obtaining the operation result of the aggregation subtask;
s106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
s107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end;
s108, each participating end sends the respective intermediate result to the operation coordination center;
s109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
s111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, and a main task result is formed;
and S112, the operation coordination center feeds back the main task result to the request end.
On the basis of the scheme, when a business strategy matched with an inquiry request is selected, the inquiry request comprises a standard request and a non-standard request;
when the query request is a standard request, the operation coordination center directly calls a service strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
Wherein, there is at least one of the request terminals.
In step S106, the obfuscating encrypting step includes:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
The present disclosure is not limited to the above alternative embodiments, and any other various forms of products may be obtained by anyone in the light of the present disclosure, but any changes in shape or structure thereof fall within the scope of the present disclosure, which is defined by the claims of the present disclosure.
Claims (9)
1. A distributed hiding query method based on task aggregation is characterized by comprising the following steps:
s101, receiving a query request initiated by a request end by an operation coordination center, and performing service policy identification on the query request to obtain a matched service policy;
s102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
s103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
s104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
s105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, performing the operation of the aggregation subtask, and obtaining the operation result of the aggregation subtask;
s106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
s107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end;
s108, each participating end sends the respective intermediate result to the operation coordination center;
s109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
s111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, and a main task result is formed;
and S112, the operation coordination center feeds back the main task result to the request end.
2. The method according to claim 1, wherein the query request comprises a standard request and a non-standard request when selecting a business strategy matching the query request;
when the query request is a standard request, the operation coordination center directly calls a service strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
3. The distributed hiding query method based on task aggregation as claimed in claim 1, wherein both the requesting side and the participating side are data sides with the same authority; and when one data end is a request end, the other data ends are participation ends of the request end.
4. The method for distributed insidious query based on task aggregation according to claim 1 or 3, wherein at least one of the request terminals is configured.
5. The method for distributed query hiding based on task aggregation as claimed in claim 1, wherein in step S106, said step of obfuscating encryption comprises:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
6. A distributed hidden query system based on task aggregation, comprising: the operation coordination center and the data terminals are arranged; when one of the data terminals is a request terminal, the other data terminals are participation terminals; when the data terminal initiates a query request to a request terminal, the following steps are executed:
s101, the operation coordination center receives a query request initiated by the request end, and performs service policy identification on the query request to obtain a matched service policy;
s102, the operation coordination center conducts main task decomposition on the query request according to the business strategy and decomposes the query request into a plurality of subtasks;
s103, the operation coordination center aggregates the subtasks of the same type into an aggregation subtask;
s104, the operation coordination center maps and addresses each aggregation subtask in the data items owned by each participating end;
s105, loading a data calculation algorithm matched with the aggregation subtask in each participating end according to the mapping addressing result, performing the operation of the aggregation subtask, and obtaining the operation result of the aggregation subtask;
s106, carrying out confusion encryption on the operation results of each participating end, and sending the confused encryption results to each participating end;
s107, after each participating end receives the obfuscated encryption result, the encryption result is operated to obtain an intermediate result of each participating end;
s108, each participating end sends the respective intermediate result to the operation coordination center;
s109, the operation coordination center conducts result aggregation on all the intermediate results to obtain an aggregation subtask result;
s110, looping the steps S104 to S109 until all the aggregation subtask results are obtained;
s111, the operation coordination center obtains all subtask results corresponding to the main task of the query request from all the aggregated subtask results through an aggregation algorithm to perform aggregation operation, and a main task result is formed;
and S112, the operation coordination center feeds back the main task result to the request end.
7. The task aggregation based distributed hiding query system as claimed in claim 6, wherein in selecting the business strategy matching with the query request, the query request comprises a standard request and a non-standard request;
when the query request is a standard request, the operation coordination center directly calls a service strategy matched with the query request;
and when the query request is a non-standard request, matching the business strategy with the highest approximation degree by the operation coordination center through semantic recognition.
8. The task aggregation-based distributed insidious query system according to claim 6, wherein at least one of the requesters is configured.
9. The task aggregation-based distributed insidious query system according to claim 8, wherein the obfuscating encryption comprises:
dividing the operation result of each participating end into a plurality of subdata with the same number as the participating ends, reserving one subdata for each participating end and sending one subdata to each of the other participating ends;
each participant terminal superposes one reserved sub-data and the received sub-data sent by the other participant terminals into an encryption result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111114101.8A CN113886458A (en) | 2021-09-23 | 2021-09-23 | Distributed hiding query method and system based on task aggregation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111114101.8A CN113886458A (en) | 2021-09-23 | 2021-09-23 | Distributed hiding query method and system based on task aggregation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113886458A true CN113886458A (en) | 2022-01-04 |
Family
ID=79010284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111114101.8A Pending CN113886458A (en) | 2021-09-23 | 2021-09-23 | Distributed hiding query method and system based on task aggregation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113886458A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114265873A (en) * | 2022-03-01 | 2022-04-01 | 成都鲁易科技有限公司 | Data processing method and device, storage medium, terminal and server |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233826A (en) * | 2019-05-08 | 2019-09-13 | 西安电子科技大学 | Based on the method for secret protection of data obfuscation, terminal data paradigmatic system between user |
| CN111031144A (en) * | 2019-12-26 | 2020-04-17 | 广州鲁邦通物联网科技有限公司 | Method and system for calling and inquiring distributed micro service |
| CN112395308A (en) * | 2020-11-05 | 2021-02-23 | 深圳市中博科创信息技术有限公司 | Data query method based on HDFS database |
-
2021
- 2021-09-23 CN CN202111114101.8A patent/CN113886458A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233826A (en) * | 2019-05-08 | 2019-09-13 | 西安电子科技大学 | Based on the method for secret protection of data obfuscation, terminal data paradigmatic system between user |
| CN111031144A (en) * | 2019-12-26 | 2020-04-17 | 广州鲁邦通物联网科技有限公司 | Method and system for calling and inquiring distributed micro service |
| CN112395308A (en) * | 2020-11-05 | 2021-02-23 | 深圳市中博科创信息技术有限公司 | Data query method based on HDFS database |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114265873A (en) * | 2022-03-01 | 2022-04-01 | 成都鲁易科技有限公司 | Data processing method and device, storage medium, terminal and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Avudaiappan et al. | Medical image security using dual encryption with oppositional based optimization algorithm | |
| US11263344B2 (en) | Data management method and registration method for an anonymous data sharing system, as well as data manager and anonymous data sharing system | |
| Chen et al. | When homomorphic encryption marries secret sharing: Secure large-scale sparse logistic regression and applications in risk control | |
| Shaneck et al. | Privacy preserving nearest neighbor search | |
| CN106850187B (en) | A kind of privacy character information encrypted query method and system | |
| Gheid et al. | Efficient and privacy-preserving k-means clustering for big data mining | |
| US8533487B2 (en) | Secure logical vector clocks | |
| CN109615021B (en) | Privacy information protection method based on k-means clustering | |
| CN111666460A (en) | User portrait generation method and device based on privacy protection and storage medium | |
| WO2005015462A1 (en) | System for processing data and method thereof | |
| Lohiya et al. | Privacy preserving in data mining using hybrid approach | |
| US20210344489A1 (en) | Communication-efficient secret shuffle protocol for encrypted data based on homomorphic encryption and oblivious transfer | |
| CN112365006B (en) | Parallel training method and system for federal learning | |
| CN114175028B (en) | Cryptographic pseudonym mapping method, computer system, computer program and computer-readable medium | |
| US11853461B2 (en) | Differential privacy security for benchmarking | |
| CN113886458A (en) | Distributed hiding query method and system based on task aggregation | |
| US20240143795A1 (en) | Method and device for intersecting unbalanced private sets | |
| Cui et al. | Secure range query over encrypted data in outsourced environments | |
| CN113821810A (en) | Data processing method and system, storage medium and electronic device | |
| WO2020209793A1 (en) | Privacy preserving system for mapping common identities | |
| CN114144783B (en) | Cryptographic pseudonym mapping method, computer system, computer program and computer-readable medium | |
| CN114520721A (en) | Multi-party secure computation privacy intersection method, device, equipment and storage medium | |
| Gheid et al. | An efficient and privacy-preserving similarity evaluation for big data analytics | |
| Chen et al. | Privacy-preserving spectrum auction design: challenges, solutions, and research directions | |
| CN116091394A (en) | Deep learning-based insect type and number image recognition algorithm |
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 |