CN113438078B - Privacy protection method and system in multi-client intersection data calculation process - Google Patents

Privacy protection method and system in multi-client intersection data calculation process Download PDF

Info

Publication number
CN113438078B
CN113438078B CN202110984789.9A CN202110984789A CN113438078B CN 113438078 B CN113438078 B CN 113438078B CN 202110984789 A CN202110984789 A CN 202110984789A CN 113438078 B CN113438078 B CN 113438078B
Authority
CN
China
Prior art keywords
computing server
auxiliary computing
auxiliary
client
protocol
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.)
Active
Application number
CN202110984789.9A
Other languages
Chinese (zh)
Other versions
CN113438078A (en
Inventor
王皓
牛梓宇
李智
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Confident Information Co.,Ltd.
Original Assignee
Shandong Normal University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shandong Normal University filed Critical Shandong Normal University
Priority to CN202110984789.9A priority Critical patent/CN113438078B/en
Publication of CN113438078A publication Critical patent/CN113438078A/en
Application granted granted Critical
Publication of CN113438078B publication Critical patent/CN113438078B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
    • 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/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G06F21/6263—Protecting personal data, e.g. for financial or medical purposes during internet communication, e.g. revealing personal data from cookies
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/12—Details relating to cryptographic hardware or logic circuitry
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46—Secure multiparty computation, e.g. millionaire problem
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Business, Economics & Management (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Development Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Power Engineering (AREA)
  • Medical Informatics (AREA)
  • Accounting & Taxation (AREA)
  • Software Systems (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Computer And Data Communications (AREA)

Abstract

The invention relates to a privacy protection method and a privacy protection system in a multi-client intersection data calculation process in the technical field of privacy protection, wherein a private index set is set in each participant client; randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client; acquiring a calculation demand; according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client; and the main participant client sends the statistical calculation result to the slave participant client. And completing the statistical calculation of the intersection of the multi-party set and the related data on the premise of not revealing private data of all parties.

Description

Privacy protection method and system in multi-client intersection data calculation process
Technical Field
The invention relates to the technical field of privacy protection, in particular to a privacy protection method and a privacy protection system in a multi-client intersection data calculation process.
Background
The statements in this section merely provide background information related to the present disclosure and may not constitute prior art.
In many data application scenarios, different participants each hold their own private data, which can often be represented in sets. For multiple participants, they often focus on intersection data, and associated statistical calculations based on the intersection data. For example, in a collaboration scenario of multiple financial institutions, each institution independently grasps its set of customers, and when they conduct a collaboration service, it is desirable to obtain a common set of customers (an intersection of the respective sets of customers) and perform correlation calculations based on these customer data. Any participant does not wish to share its own set of private customers to other participants for the benefit of the respective business and for the privacy of the customers.
The existing solution only supports privacy protection calculation of intersection related data of two participants, and cannot support the situation of more than two participants. The existing calculation processes of two participants usually adopt a pure data encryption mode to carry out respective data management, and the calculation process of rapidness, high efficiency and privacy protection cannot be realized.
Disclosure of Invention
In order to solve the defects of the prior art, the invention provides a privacy protection method and a privacy protection system in the calculation process of multi-client intersection data; the method can complete the statistical calculation of the intersection of the multi-party set and the related data on the premise of not revealing private data of all parties.
In a first aspect, the invention provides a privacy protection method in a multi-client intersection data calculation process;
the privacy protection method in the multi-client intersection data calculation process comprises the following steps:
assuming that there are several participant clients and two helper computing servers; each participant client is provided with a private index set; randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
acquiring a calculation demand; according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
and the main participant client sends the statistical calculation result to the slave participant client.
In a second aspect, the invention provides a privacy protection system in a multi-client intersection data calculation process;
privacy protection system in many client intersection data computational process includes:
a random assignment module configured to: randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
an acquisition module configured to: acquiring a calculation demand;
a privacy protection module configured to: according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
a feedback module configured to: and the main participant client sends the statistical calculation result to the slave participant client.
Compared with the prior art, the invention has the beneficial effects that:
the multiple participants can complete intersection solving and statistical calculation of related data on the premise of not revealing respective private index set data, including the size of the intersection, the sum of the intersection related data, the mean of the intersection related data, the variance of the intersection related data, the maximum and minimum of the intersection related data and the like.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, or may be learned by practice of the invention.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
Fig. 1 is a schematic configuration diagram of the first embodiment.
Detailed Description
Description of terms:
(1) bugu hash and simple hash
Hash of cloth grain: (
Figure 228941DEST_PATH_IMAGE001
) By passing
Figure 150760DEST_PATH_IMAGE002
A hash function
Figure 73717DEST_PATH_IMAGE003
Will be provided with
Figure 321159DEST_PATH_IMAGE004
Element mapping to
Figure 532828DEST_PATH_IMAGE005
In each box, at most one element is placed in each box. The mapping rules are as follows: initialization
Figure 789497DEST_PATH_IMAGE006
An empty box, note
Figure 301381DEST_PATH_IMAGE007
(wherein
Figure 516462DEST_PATH_IMAGE008
). For elements
Figure 746586DEST_PATH_IMAGE009
Calculating
Figure 72525DEST_PATH_IMAGE010
If, if
Figure 704495DEST_PATH_IMAGE011
If there is a free box, it will
Figure 28160DEST_PATH_IMAGE012
Randomly putting one empty box; if it is
Figure 745580DEST_PATH_IMAGE013
If none are empty, one is randomly selected
Figure 78472DEST_PATH_IMAGE014
Will be provided with
Figure 33790DEST_PATH_IMAGE009
The mixture is put into a furnace to be treated,
Figure 129873DEST_PATH_IMAGE015
the original existing elements are taken out and replaced according to the above rules. If the process does not terminate after a certain number of iterations, the elements that are eventually evicted are placed uniformly in a region (referred to as a region)
Figure 803431DEST_PATH_IMAGE016
). Use of this patent
Figure 408856DEST_PATH_IMAGE017
Of
Figure 749839DEST_PATH_IMAGE016
Hash of the seed when
Figure 415306DEST_PATH_IMAGE018
When it is needed
Figure 576160DEST_PATH_IMAGE019
Has a probability of only
Figure 250855DEST_PATH_IMAGE020
And can be ignored.
A simple hash is used in conjunction with the valley hash.
Simple hash (
Figure 446344DEST_PATH_IMAGE021
) By passing
Figure 813872DEST_PATH_IMAGE002
A hash function
Figure 462022DEST_PATH_IMAGE022
Will be provided with
Figure 409249DEST_PATH_IMAGE023
Element mapping to
Figure 990403DEST_PATH_IMAGE024
In each box, a plurality of elements meeting the conditions can be placed in each box. The mapping rules are as follows: initialization
Figure 263253DEST_PATH_IMAGE025
An empty box, note
Figure 929858DEST_PATH_IMAGE026
(wherein
Figure 946355DEST_PATH_IMAGE027
). For elements
Figure 647595DEST_PATH_IMAGE028
Calculating
Figure 356925DEST_PATH_IMAGE029
In a
Figure 510826DEST_PATH_IMAGE030
All put in
Figure 331014DEST_PATH_IMAGE028
Until all elements are put. Corresponding to the hash of the valley, the invention uses
Figure 621181DEST_PATH_IMAGE031
The simple hash scheme of (1).
(2) Yao's chaotic circuit protocol
The yao-shi chaotic circuit is an encrypted form of the boolean circuit. The yao-shi chaos circuit protocol allows two participating parties to compute correct circuit output results layer by layer in a overwhelming manner without knowing the true input values of the other parties. The whole calculation process does not reveal any additional information except the output of the circuit. The Yao's chaotic circuit protocol can efficiently and safely complete any calculable calculation task on the premise of ensuring the input privacy of both parties.
(3) Secret sharing
The secret sharing scheme used by this patent involves two parametersHefang (Chinese character of 'He')
Figure 501413DEST_PATH_IMAGE032
And
Figure 611451DEST_PATH_IMAGE033
the two parties respectively hold secret data
Figure 704172DEST_PATH_IMAGE034
In proportion of
Figure 317687DEST_PATH_IMAGE035
And
Figure 368820DEST_PATH_IMAGE036
neither party can obtain the relation
Figure 231733DEST_PATH_IMAGE034
But shares of both parties can be recovered together
Figure 128145DEST_PATH_IMAGE037
. Will be provided with
Figure 596167DEST_PATH_IMAGE034
The process of splitting into shares and distributing to both parties is called sharing, and the shares of both parties are used for jointly recovering
Figure 552621DEST_PATH_IMAGE034
The process of (2) is called reconstruction. The secret sharing method used in this patent includes arithmetic sharing (A)
Figure 902831DEST_PATH_IMAGE038
) Boolean sharing (
Figure 602934DEST_PATH_IMAGE039
) And Yao Shao
Figure 722200DEST_PATH_IMAGE040
) The representation is as follows:
and (3) arithmetic sharing:
Figure 115135DEST_PATH_IMAGE041
and
Figure 952641DEST_PATH_IMAGE042
to represent
Figure 722014DEST_PATH_IMAGE043
Is equal to the arithmetic share of
Figure 226945DEST_PATH_IMAGE044
。
Boolean sharing:
Figure 525202DEST_PATH_IMAGE045
and
Figure 115583DEST_PATH_IMAGE046
to represent
Figure 688647DEST_PATH_IMAGE047
A Boolean share of
Figure 516926DEST_PATH_IMAGE048
。
Sharing between yao and other crops:
Figure 517243DEST_PATH_IMAGE049
and
Figure 63762DEST_PATH_IMAGE050
to represent
Figure 174937DEST_PATH_IMAGE051
The share of the yao pin of (1),
Figure 123302DEST_PATH_IMAGE052
，
Figure 294520DEST_PATH_IMAGE053
wherein
Figure 328335DEST_PATH_IMAGE054
，
Figure 977622DEST_PATH_IMAGE055
。
(4) Secure multiplication protocol
Participant side
Figure 46072DEST_PATH_IMAGE056
And
Figure 388192DEST_PATH_IMAGE057
respectively hold secret values
Figure 174882DEST_PATH_IMAGE058
And
Figure 627861DEST_PATH_IMAGE059
is calculated as a secret share of
Figure 550817DEST_PATH_IMAGE060
And
Figure 798259DEST_PATH_IMAGE061
respectively obtained by executing multiplication protocol
Figure 72245DEST_PATH_IMAGE062
Is calculated as a secret share of
Figure 63335DEST_PATH_IMAGE063
And
Figure 840798DEST_PATH_IMAGE064
. The protocol can be implemented by homomorphic encryption, a ubiquitous transmission protocol,
Figure 524721DEST_PATH_IMAGE065
Multiplication triplets, and the like. The protocol can be extended to matrix multiplication according to the operation principle of matrix multiplication.
（5）
Figure 754845DEST_PATH_IMAGE066
Conversion protocol
Figure 549625DEST_PATH_IMAGE066
Translating protocols for participants
Figure 447174DEST_PATH_IMAGE067
Share of arithmetic to be held
Figure 301998DEST_PATH_IMAGE068
Conversion to Boolean shares, note
Figure 550577DEST_PATH_IMAGE069
。
Figure 149048DEST_PATH_IMAGE066
Translating protocols for participants
Figure 346507DEST_PATH_IMAGE070
Share of arithmetic to be held
Figure 372232DEST_PATH_IMAGE071
Conversion to Boolean shares, note
Figure 842528DEST_PATH_IMAGE072
。
（6）
Figure 979111DEST_PATH_IMAGE073
Conversion protocol
Figure 585673DEST_PATH_IMAGE073
Converting protocols for participants
Figure 47878DEST_PATH_IMAGE074
And
Figure 739891DEST_PATH_IMAGE075
share the arithmetic held by each
Figure 414586DEST_PATH_IMAGE076
And
Figure 141233DEST_PATH_IMAGE077
the share of the Yao is converted into the share of the Yao which is taken as the input of the Yao chaotic circuit and is respectively recorded as
Figure 774340DEST_PATH_IMAGE078
And
Figure 953649DEST_PATH_IMAGE079
。
（7）
Figure 432034DEST_PATH_IMAGE080
conversion protocol
Figure 13189DEST_PATH_IMAGE080
The conversion protocol enables the participants to
Figure 286038DEST_PATH_IMAGE081
And
Figure 952643DEST_PATH_IMAGE082
shares of the respective own Yao
Figure 969140DEST_PATH_IMAGE083
And
Figure 670380DEST_PATH_IMAGE084
converted into arithmetic share shares, respectively
Figure 114131DEST_PATH_IMAGE085
And
Figure 268032DEST_PATH_IMAGE086
。
(8) arithmetic sharing equivalence test protocol
In an arithmetic sharing equivalence test protocol, participants
Figure 353799DEST_PATH_IMAGE087
And
Figure 643966DEST_PATH_IMAGE088
each input is
Figure 524198DEST_PATH_IMAGE058
And
Figure 899815DEST_PATH_IMAGE059
after the protocol operation is finished, if
Figure 258116DEST_PATH_IMAGE089
Then set up
Figure 668368DEST_PATH_IMAGE090
Otherwise
Figure 453922DEST_PATH_IMAGE091
，
Figure 582415DEST_PATH_IMAGE092
And
Figure 744406DEST_PATH_IMAGE093
respectively output
Figure 274744DEST_PATH_IMAGE094
Is shared with the other part of the arithmetic
Figure 231199DEST_PATH_IMAGE095
And
Figure 581409DEST_PATH_IMAGE096
satisfy the following requirements
Figure 547091DEST_PATH_IMAGE097
And in addition does not reveal any additional information.
Example one
The embodiment provides a privacy protection method in a multi-client intersection data calculation process;
the privacy protection method in the multi-client intersection data calculation process comprises the following steps:
s101: assuming that there are several participant clients and two helper computing servers; each participant client is provided with a private index set; randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
s102: acquiring a calculation demand; according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
s103: and the main participant client sends the statistical calculation result to the slave participant client.
Further, the computing requirements include: calculating the intersection set, the size of the intersection set, the sum of the intersection set, the mean of the intersection set, the variance of the intersection set, the maximum of the intersection set and the minimum of the intersection set.
Further, the statistical calculation result includes the intersection set itself, the size of the intersection set, the sum of the intersection set, the mean of the intersection set, the variance of the intersection set, the maximum of the intersection set, and the minimum of the intersection set.
Functional description of the protocol: for the participating party
Figure 666357DEST_PATH_IMAGE098
Separately grasp the index sets
Figure 59292DEST_PATH_IMAGE099
The data in the index set refers to a client list, for example; for the
Figure 896798DEST_PATH_IMAGE100
Index in
Figure 400591DEST_PATH_IMAGE101
，
Figure 639943DEST_PATH_IMAGE102
Hold additional data sets
Figure 469359DEST_PATH_IMAGE103
Wherein
Figure 59740DEST_PATH_IMAGE104
And
Figure 101645DEST_PATH_IMAGE105
corresponds to (
Figure 461082DEST_PATH_IMAGE106
) The extra data refers to
Figure 195820DEST_PATH_IMAGE107
Indexing corresponding attribute values, e.g.
Figure 7918DEST_PATH_IMAGE108
Refer to the customer
Figure 119094DEST_PATH_IMAGE109
，
Figure 67458DEST_PATH_IMAGE110
For the customer
Figure 973097DEST_PATH_IMAGE111
The amount of consumption of (c). Introducing two collusion-free helper computing servers in a protocol
Figure 6913DEST_PATH_IMAGE081
And
Figure 390620DEST_PATH_IMAGE112
auxiliary meterThe compute server has no input (as shown in figure 1). In actual deployment, the auxiliary computing server may adopt two different public cloud platforms. Here collusion means that both parties do not share their private data with each other (except for the interaction required by the protocol), thereby protecting the private data.
The protocol can safely calculate the intersection and the intersection size of the multi-party set and aim at the intersection
Figure 459071DEST_PATH_IMAGE113
The value corresponding to the middle index
Figure 535611DEST_PATH_IMAGE114
Performing relevant statistical calculations including sum, mean, variance, maximum, minimum, etc.,
Figure 322301DEST_PATH_IMAGE115
and obtaining a final calculation result. The whole calculation process (interactive process) is in a finite field
Figure 509700DEST_PATH_IMAGE116
Is carried out by
Figure 432657DEST_PATH_IMAGE117
Large prime number) that do not reveal about the collection
Figure 680099DEST_PATH_IMAGE118
And
Figure 688506DEST_PATH_IMAGE119
any of (3).
The formalization is described as follows:
inputting:
Figure 945175DEST_PATH_IMAGE120
is inputted as
Figure 988217DEST_PATH_IMAGE121
；
Figure 406560DEST_PATH_IMAGE122
Having extra input
Figure 902264DEST_PATH_IMAGE123
；
Figure 697044DEST_PATH_IMAGE124
There is no input.
And (3) outputting:
Figure 329014DEST_PATH_IMAGE125
、
Figure 918258DEST_PATH_IMAGE126
no output;
Figure 901258DEST_PATH_IMAGE122
and (3) outputting:
(1) set intersection
Figure 499729DEST_PATH_IMAGE127
；
(2) Size of intersection
Figure 986206DEST_PATH_IMAGE128
；
(3) Sum value
Figure 11930DEST_PATH_IMAGE129
；
(4) Mean value
Figure 216647DEST_PATH_IMAGE130
；
(5) Variance (variance)
Figure 87651DEST_PATH_IMAGE131
；
(6) Collection
Figure 694213DEST_PATH_IMAGE132
Max, min.
Note that the above calculations for (1), (2), (3), (4), (5), and (6) are independent, and may be all or only some of them.
Further, in S102, when the computation requirement is to compute the intersection set itself, the executed secure statistical computation protocol includes the following steps:
(1-1) Main participant client
Figure 914276DEST_PATH_IMAGE133
Set its private index
Figure 340710DEST_PATH_IMAGE134
Performing hash of the grains to obtain
Figure 280984DEST_PATH_IMAGE135
One box
Figure 7631DEST_PATH_IMAGE136
；
Figure 109579DEST_PATH_IMAGE137
Representing the total number of bins;
(1-2) slave participant client
Figure 554467DEST_PATH_IMAGE138
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain the second hash
Figure 32853DEST_PATH_IMAGE139
A slave client
Figure 348428DEST_PATH_IMAGE140
One box
Figure 152436DEST_PATH_IMAGE141
Of 1 at
Figure 819041DEST_PATH_IMAGE142
A slave client
Figure 101117DEST_PATH_IMAGE143
One box
Figure 802357DEST_PATH_IMAGE144
The elements in (A) are represented by
Figure 246108DEST_PATH_IMAGE145
Wherein, in the step (A),
Figure 665588DEST_PATH_IMAGE146
，
Figure 485776DEST_PATH_IMAGE147
the size of each box is simply hashed;
(1-3) Main participant client
Figure 41523DEST_PATH_IMAGE148
Will be provided with
Figure 656175DEST_PATH_IMAGE149
Arithmetic sharing as being sent to a first helper computing server
Figure 297372DEST_PATH_IMAGE150
Is an arithmetic portion of
Figure 921251DEST_PATH_IMAGE151
And to be sent to a second auxiliary computing server
Figure 331504DEST_PATH_IMAGE152
Is an arithmetic portion of
Figure 648216DEST_PATH_IMAGE153
Respectively sent to the first auxiliary computing server
Figure 511129DEST_PATH_IMAGE154
And a second auxiliary computing server
Figure 938700DEST_PATH_IMAGE088
；
(1-4) for
Figure 469038DEST_PATH_IMAGE155
From the participant client
Figure 691072DEST_PATH_IMAGE156
Calculating a polynomial:
Figure 41282DEST_PATH_IMAGE157
，
wherein the content of the first and second substances,
Figure 272543DEST_PATH_IMAGE158
representing secondary participant clients
Figure 391809DEST_PATH_IMAGE159
Corresponds to
Figure 50323DEST_PATH_IMAGE160
A polynomial of the data in the individual bins;
Figure 91092DEST_PATH_IMAGE161
the expression of the independent variable is shown,
Figure 204672DEST_PATH_IMAGE162
show that
Figure 647286DEST_PATH_IMAGE163
And
Figure 148806DEST_PATH_IMAGE164
then the difference result is multiplied together,
Figure 270346DEST_PATH_IMAGE165
coefficients representing a polynomial; if and only if handle
Figure 187617DEST_PATH_IMAGE166
When the data is substituted into a polynomial, the value of the polynomial is 0 (i.e., by the polynomial)
Figure 750317DEST_PATH_IMAGE167
Is 0 to determine whether the carry-in calculation is
Figure 485054DEST_PATH_IMAGE168
Medium data).
Will be provided with
Figure 31573DEST_PATH_IMAGE169
The arithmetic sharing is as
Figure 611590DEST_PATH_IMAGE170
And
Figure 559955DEST_PATH_IMAGE171
；
Figure 731173DEST_PATH_IMAGE172
to represent
Figure 233830DEST_PATH_IMAGE173
A constituent set of all coefficients of (a);
dividing the polynomial coefficient fraction
Figure 883117DEST_PATH_IMAGE174
Sending to the first auxiliary computing server
Figure 217146DEST_PATH_IMAGE175
(ii) a Dividing the polynomial coefficient fraction
Figure 559266DEST_PATH_IMAGE176
Sending to a second auxiliary computing server
Figure 80377DEST_PATH_IMAGE177
；
(1-5) for
Figure 533355DEST_PATH_IMAGE178
First auxiliary computing server
Figure 456312DEST_PATH_IMAGE179
According to the data received in the step (1-3) and the step (1-4), calling a safe multiplication protocol for multiple times, and calculating an arithmetic share
Figure 969333DEST_PATH_IMAGE180
(ii) a The second auxiliary computing server calls the safe multiplication protocol for multiple times according to the data received in the step (1-3) and the step (1-4) to compute the arithmetic share
Figure 977740DEST_PATH_IMAGE181
；
(1-6) for
Figure 968830DEST_PATH_IMAGE182
First auxiliary computing server
Figure 11872DEST_PATH_IMAGE179
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure 899057DEST_PATH_IMAGE183
Second auxiliary computing server
Figure 660339DEST_PATH_IMAGE184
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure 189541DEST_PATH_IMAGE185
；
(1-7) first auxiliary computing Server
Figure 352669DEST_PATH_IMAGE186
And a second auxiliary computing server
Figure 207492DEST_PATH_IMAGE088
Will be provided with
Figure 924913DEST_PATH_IMAGE187
And
Figure 523384DEST_PATH_IMAGE188
send to the Main participant client
Figure 275440DEST_PATH_IMAGE189
；
Main participant client
Figure 301165DEST_PATH_IMAGE190
Computing
Figure 505881DEST_PATH_IMAGE191
，
Figure 908043DEST_PATH_IMAGE192
Is shown if
Figure 780184DEST_PATH_IMAGE193
Then, then
Figure 687794DEST_PATH_IMAGE194
Are intersection elements.
Figure 645386DEST_PATH_IMAGE195
Representing the final sought set intersection.
Further, in S102, when the computation requirement is the size of the computation intersection set, the executed secure statistical computation protocol includes the following steps:
(2-1) Main participant client
Figure 585660DEST_PATH_IMAGE196
Set its private index
Figure 312307DEST_PATH_IMAGE197
Performing hash to obtain
Figure 414255DEST_PATH_IMAGE198
；
（2-2）
Figure 859143DEST_PATH_IMAGE199
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain
Figure 337529DEST_PATH_IMAGE200
Each box
Figure 918683DEST_PATH_IMAGE201
The elements in (A) are represented by
Figure 722691DEST_PATH_IMAGE202
(wherein
Figure 389296DEST_PATH_IMAGE203
，
Figure 936952DEST_PATH_IMAGE204
Hash the size of each box for simplicity);
(2-3) Main participant client
Figure 107033DEST_PATH_IMAGE205
Will be provided with
Figure 81942DEST_PATH_IMAGE206
The arithmetic sharing is as
Figure 970264DEST_PATH_IMAGE207
And
Figure 56032DEST_PATH_IMAGE208
will be
Figure 611778DEST_PATH_IMAGE209
Sending to the first auxiliary computing server
Figure 757589DEST_PATH_IMAGE067
Will be
Figure 133206DEST_PATH_IMAGE210
Sending to a second auxiliary computing server
Figure 22665DEST_PATH_IMAGE088
；
(2-4) for
Figure 167338DEST_PATH_IMAGE211
，
Figure 484050DEST_PATH_IMAGE212
Calculating polynomial
Figure 612543DEST_PATH_IMAGE213
And will be
Figure 40113DEST_PATH_IMAGE214
The arithmetic sharing is as
Figure 304873DEST_PATH_IMAGE215
And
Figure 526907DEST_PATH_IMAGE216
will be
Figure 877117DEST_PATH_IMAGE217
Sending to the first auxiliary computing server
Figure 108378DEST_PATH_IMAGE218
Will be
Figure 493223DEST_PATH_IMAGE219
Sending to a second auxiliary computing server
Figure 151737DEST_PATH_IMAGE152
；
(2-5) for
Figure 989243DEST_PATH_IMAGE220
First auxiliary computing server
Figure 493037DEST_PATH_IMAGE150
And a second auxiliary computing server
Figure 997967DEST_PATH_IMAGE221
Multiple invocation of secure multiplication protocol, computing
Figure 827383DEST_PATH_IMAGE222
And
Figure 886606DEST_PATH_IMAGE223
；
(2-6) for
Figure 459670DEST_PATH_IMAGE224
Based on
Figure 819107DEST_PATH_IMAGE225
First auxiliary computing server
Figure 553845DEST_PATH_IMAGE056
Calculate out
Figure 365943DEST_PATH_IMAGE226
(ii) a Based on
Figure 211539DEST_PATH_IMAGE227
Second auxiliary computing server
Figure 425483DEST_PATH_IMAGE033
Calculate out
Figure 596701DEST_PATH_IMAGE228
；
(2-7) for
Figure 896096DEST_PATH_IMAGE229
First auxiliary computing server
Figure 545383DEST_PATH_IMAGE081
To be provided with
Figure 613833DEST_PATH_IMAGE230
Invoking
Figure 690373DEST_PATH_IMAGE231
Converting the arithmetic quota into a Boolean quota to obtain a corresponding Boolean quota
Figure 477064DEST_PATH_IMAGE232
(ii) a Second auxiliary computing server
Figure 195621DEST_PATH_IMAGE184
To be provided with
Figure 118578DEST_PATH_IMAGE233
Invoking
Figure 366019DEST_PATH_IMAGE234
Converting the arithmetic quota into a Boolean quota to obtain a corresponding Boolean quota
Figure 640006DEST_PATH_IMAGE235
；
(2-8) for
Figure 896675DEST_PATH_IMAGE236
First auxiliary computing server
Figure 674138DEST_PATH_IMAGE237
To be provided with
Figure 358060DEST_PATH_IMAGE238
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 119343DEST_PATH_IMAGE239
(ii) a Second auxiliary computing server
Figure 648544DEST_PATH_IMAGE240
To be provided with
Figure 546093DEST_PATH_IMAGE235
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 666496DEST_PATH_IMAGE241
；
(2-9) first auxiliary computing Server
Figure 649495DEST_PATH_IMAGE242
Computing
Figure 982388DEST_PATH_IMAGE243
(ii) a Second helper computing server computing
Figure 22DEST_PATH_IMAGE244
(ii) a First auxiliary computing server
Figure 760168DEST_PATH_IMAGE245
Will be provided with
Figure 230464DEST_PATH_IMAGE246
Send to the Main participant client
Figure 632626DEST_PATH_IMAGE247
The second auxiliary computing server will
Figure 504767DEST_PATH_IMAGE248
Send to the Main participant client
Figure 435814DEST_PATH_IMAGE249
The main participant client
Figure 393406DEST_PATH_IMAGE250
Computing
Figure 333680DEST_PATH_IMAGE251
。
Further, in S102, when the calculation requirement is to calculate a sum of intersection set related data, the executed security statistic calculation protocol includes the following steps:
(3-1) Main participant client
Figure 60327DEST_PATH_IMAGE252
Set its private index
Figure 693434DEST_PATH_IMAGE253
Performing hash to obtain
Figure 872743DEST_PATH_IMAGE254
；
（3-2）
Figure 351129DEST_PATH_IMAGE255
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain
Figure 932283DEST_PATH_IMAGE256
Each box
Figure 470711DEST_PATH_IMAGE257
The elements in (A) are represented by
Figure 402895DEST_PATH_IMAGE258
(wherein
Figure 684972DEST_PATH_IMAGE259
，
Figure 120633DEST_PATH_IMAGE260
Hash the size of each box for simplicity);
(3-3) Main participant client
Figure 95542DEST_PATH_IMAGE261
Will be provided with
Figure 7301DEST_PATH_IMAGE262
The arithmetic sharing is as
Figure 93069DEST_PATH_IMAGE263
And
Figure 648815DEST_PATH_IMAGE264
will be
Figure 529046DEST_PATH_IMAGE265
Sending to the first auxiliary computing server
Figure 170243DEST_PATH_IMAGE266
Will be
Figure 794122DEST_PATH_IMAGE267
Sending to a second auxiliary computing server
Figure 204375DEST_PATH_IMAGE268
；
(3-4) for
Figure 255508DEST_PATH_IMAGE269
，
Figure 384001DEST_PATH_IMAGE270
Calculating polynomial
Figure 545992DEST_PATH_IMAGE271
And will be
Figure 810751DEST_PATH_IMAGE272
The arithmetic sharing is as
Figure 32785DEST_PATH_IMAGE273
And
Figure 117416DEST_PATH_IMAGE274
and will be
Figure 348677DEST_PATH_IMAGE275
Sending to the first auxiliary computing server
Figure 733522DEST_PATH_IMAGE276
(ii) a Will be provided with
Figure 860878DEST_PATH_IMAGE277
Sending to a second auxiliary computing server
Figure 698384DEST_PATH_IMAGE268
；
(3-5) for
Figure 467757DEST_PATH_IMAGE278
First auxiliary computing server
Figure 441529DEST_PATH_IMAGE279
Multiple invocation of secure multiplication protocol, computing
Figure 5365DEST_PATH_IMAGE280
(ii) a Second auxiliary computing server
Figure 330168DEST_PATH_IMAGE221
Multiple invocation of secure multiplication protocol, computing
Figure 903231DEST_PATH_IMAGE281
；
(3-6) for
Figure 731510DEST_PATH_IMAGE224
First auxiliary computing server
Figure 731827DEST_PATH_IMAGE282
Computing
Figure 278346DEST_PATH_IMAGE283
(ii) a Second auxiliary computing server
Figure 389522DEST_PATH_IMAGE184
Computing
Figure 337886DEST_PATH_IMAGE284
；
(3-7) for
Figure 243525DEST_PATH_IMAGE285
First auxiliary computing server
Figure 277340DEST_PATH_IMAGE237
To be provided with
Figure 661048DEST_PATH_IMAGE286
Invoking
Figure 729498DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 71618DEST_PATH_IMAGE287
(ii) a Second auxiliary computing server
Figure 592729DEST_PATH_IMAGE288
To be provided with
Figure 45707DEST_PATH_IMAGE289
Invoking
Figure 968664DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 216106DEST_PATH_IMAGE290
；
(3-8) for
Figure 490092DEST_PATH_IMAGE229
First auxiliary computing server
Figure 746761DEST_PATH_IMAGE237
To be provided with
Figure 789803DEST_PATH_IMAGE291
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 208146DEST_PATH_IMAGE292
(ii) a Second auxiliary computing server
Figure 703850DEST_PATH_IMAGE293
To be provided with
Figure 498631DEST_PATH_IMAGE294
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 396179DEST_PATH_IMAGE295
；
(3-9) use
Figure 985424DEST_PATH_IMAGE296
To represent
Figure 234002DEST_PATH_IMAGE297
A set of corresponding values for the middle element; main participant client
Figure 832474DEST_PATH_IMAGE250
Will be provided with
Figure 318950DEST_PATH_IMAGE298
The arithmetic sharing is as
Figure 610254DEST_PATH_IMAGE299
And
Figure 814971DEST_PATH_IMAGE300
sending out
Figure 951554DEST_PATH_IMAGE301
To the first auxiliary computing server
Figure 558116DEST_PATH_IMAGE302
Sending out
Figure 20321DEST_PATH_IMAGE303
To a second auxiliary computing server
Figure 977913DEST_PATH_IMAGE293
；
(3-10) for
Figure 652608DEST_PATH_IMAGE304
First auxiliary computing server
Figure 113676DEST_PATH_IMAGE237
To be provided with
Figure 481203DEST_PATH_IMAGE305
For input, a second auxiliary computing server
Figure 660512DEST_PATH_IMAGE093
To be provided with
Figure 138898DEST_PATH_IMAGE306
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 985631DEST_PATH_IMAGE087
Obtain an output
Figure 258481DEST_PATH_IMAGE307
Second auxiliary computing server
Figure 925085DEST_PATH_IMAGE308
Obtain an output
Figure 207162DEST_PATH_IMAGE309
；
(3-11) first auxiliary computing Server
Figure 642823DEST_PATH_IMAGE310
Computing
Figure 352153DEST_PATH_IMAGE311
Second auxiliary computing server
Figure 771633DEST_PATH_IMAGE152
Computing
Figure 591821DEST_PATH_IMAGE312
And sent to the client of the main participant
Figure 147567DEST_PATH_IMAGE313
The main participant client
Figure 27799DEST_PATH_IMAGE314
Computing
Figure 668996DEST_PATH_IMAGE315
。
Further, in S102, when the calculation requirement is to calculate a mean value of the intersection set related data, the executed security statistic calculation protocol includes the following steps:
(4-1) Main participant client
Figure 292875DEST_PATH_IMAGE316
Set its private index
Figure 703128DEST_PATH_IMAGE253
Performing hash to obtain
Figure 754260DEST_PATH_IMAGE317
；
（4-2）
Figure 593737DEST_PATH_IMAGE318
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain
Figure 21307DEST_PATH_IMAGE256
Each box
Figure 286066DEST_PATH_IMAGE319
The elements in (A) are represented by
Figure 773679DEST_PATH_IMAGE320
(wherein
Figure 389468DEST_PATH_IMAGE259
，
Figure 355150DEST_PATH_IMAGE321
Hash the size of each box for simplicity);
(4-3) Main participant client
Figure 474416DEST_PATH_IMAGE322
Will be provided with
Figure 132931DEST_PATH_IMAGE323
The arithmetic sharing is as
Figure 236016DEST_PATH_IMAGE324
And
Figure 739810DEST_PATH_IMAGE325
，
will be provided with
Figure 979161DEST_PATH_IMAGE326
Sending to the first auxiliary computing server
Figure 808577DEST_PATH_IMAGE310
Will be
Figure 133379DEST_PATH_IMAGE327
Sending to a second auxiliary computing server
Figure 175284DEST_PATH_IMAGE328
；
(4-4) for
Figure 534721DEST_PATH_IMAGE329
From the participant client
Figure 535038DEST_PATH_IMAGE330
Calculating a polynomial:
Figure 347137DEST_PATH_IMAGE331
，
from the participant client to the client
Figure 458312DEST_PATH_IMAGE332
The arithmetic sharing is as
Figure 672256DEST_PATH_IMAGE333
And
Figure 577895DEST_PATH_IMAGE334
(ii) a Will be provided with
Figure 877289DEST_PATH_IMAGE335
Sending to the first auxiliary computing server
Figure 526576DEST_PATH_IMAGE276
(ii) a Will be provided with
Figure 595026DEST_PATH_IMAGE336
Sending to a second auxiliary computing server
Figure 937146DEST_PATH_IMAGE184
；
(4-5) for
Figure 723836DEST_PATH_IMAGE337
First auxiliary computing server
Figure 911235DEST_PATH_IMAGE237
Multiple invocation of secure multiplication protocol, computing
Figure 99771DEST_PATH_IMAGE338
(ii) a Second auxiliary computing server
Figure 612792DEST_PATH_IMAGE184
Multiple invocation of secure multiplication protocol, computing
Figure 886779DEST_PATH_IMAGE339
；
(4-6) for
Figure 877868DEST_PATH_IMAGE340
First auxiliary computing server
Figure 920911DEST_PATH_IMAGE276
Computing
Figure 339254DEST_PATH_IMAGE341
(ii) a Second auxiliary computing server
Figure 834957DEST_PATH_IMAGE057
Computing
Figure 895317DEST_PATH_IMAGE342
；
(4-7) for
Figure 527287DEST_PATH_IMAGE343
First auxiliary computing server
Figure 382110DEST_PATH_IMAGE302
To be provided with
Figure 630689DEST_PATH_IMAGE344
Invoking
Figure 963581DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 715637DEST_PATH_IMAGE238
(ii) a Second auxiliary computing server
Figure 6941DEST_PATH_IMAGE093
To be provided with
Figure 211657DEST_PATH_IMAGE345
Invoking
Figure 348240DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 220381DEST_PATH_IMAGE346
；
(4-8) for
Figure 682587DEST_PATH_IMAGE347
First auxiliary computing server
Figure 109020DEST_PATH_IMAGE150
To be provided with
Figure 314873DEST_PATH_IMAGE238
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 775942DEST_PATH_IMAGE348
(ii) a Second auxiliary computing server
Figure 143469DEST_PATH_IMAGE184
To be provided with
Figure 588357DEST_PATH_IMAGE349
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 332322DEST_PATH_IMAGE350
；
(4-9) use
Figure 913476DEST_PATH_IMAGE351
To represent
Figure 451905DEST_PATH_IMAGE352
A set of corresponding values for the middle element; main participant client
Figure 118510DEST_PATH_IMAGE353
Will be provided with
Figure 666166DEST_PATH_IMAGE354
The arithmetic sharing is as
Figure 367405DEST_PATH_IMAGE355
And
Figure 811156DEST_PATH_IMAGE356
；
main participant client
Figure 965057DEST_PATH_IMAGE357
Sending
Figure 395032DEST_PATH_IMAGE358
To the first auxiliary computing server
Figure 685199DEST_PATH_IMAGE302
The main participant client
Figure 299852DEST_PATH_IMAGE250
Sending
Figure 675469DEST_PATH_IMAGE359
To a second auxiliary computing server
Figure 564928DEST_PATH_IMAGE360
；
(4-10) for
Figure 709601DEST_PATH_IMAGE361
First auxiliary computing server
Figure 26313DEST_PATH_IMAGE362
To be provided with
Figure 154806DEST_PATH_IMAGE363
For input, a second auxiliary computing server
Figure 582376DEST_PATH_IMAGE293
To be provided with
Figure 112715DEST_PATH_IMAGE364
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 334749DEST_PATH_IMAGE276
Obtain an output
Figure 419380DEST_PATH_IMAGE365
Second auxiliary computing server
Figure 650641DEST_PATH_IMAGE366
Obtain an output
Figure 769906DEST_PATH_IMAGE367
；
(4-11) first auxiliary computing Server
Figure 162842DEST_PATH_IMAGE266
Computing
Figure 265927DEST_PATH_IMAGE368
And
Figure 793158DEST_PATH_IMAGE369
second auxiliary computing server
Figure 32510DEST_PATH_IMAGE293
Computing
Figure 861925DEST_PATH_IMAGE370
And
Figure 186727DEST_PATH_IMAGE371
；
(4-12) first auxiliary computing Server
Figure 494212DEST_PATH_IMAGE372
To be provided with
Figure 853649DEST_PATH_IMAGE373
For input, a second auxiliary computing server
Figure 588387DEST_PATH_IMAGE112
To be provided with
Figure 400485DEST_PATH_IMAGE374
For input, both parties call
Figure 511661DEST_PATH_IMAGE375
Protocol, first auxiliary computing server
Figure 725604DEST_PATH_IMAGE376
Obtaining the corresponding YaoShare of
Figure 631243DEST_PATH_IMAGE377
Second auxiliary computing server
Figure 930638DEST_PATH_IMAGE293
Obtaining the corresponding share of Yao
Figure 314346DEST_PATH_IMAGE378
；
(4-13) first auxiliary computing Server
Figure 382796DEST_PATH_IMAGE379
To be provided with
Figure 724915DEST_PATH_IMAGE380
For input, a second auxiliary computing server
Figure 246027DEST_PATH_IMAGE184
To be provided with
Figure 699005DEST_PATH_IMAGE381
Calling the calculation function of the Yao's chaotic circuit protocol for input
Figure 887541DEST_PATH_IMAGE382
First auxiliary computing server
Figure 134982DEST_PATH_IMAGE379
To obtain
Figure 143390DEST_PATH_IMAGE383
Is/are as follows
Figure 400059DEST_PATH_IMAGE384
Portion(s) of
Figure 443101DEST_PATH_IMAGE385
Second auxiliary computing server
Figure 861444DEST_PATH_IMAGE288
To obtain
Figure 622727DEST_PATH_IMAGE383
Is/are as follows
Figure 417507DEST_PATH_IMAGE384
Portion(s) of
Figure 315056DEST_PATH_IMAGE386
；
(4-14) first auxiliary computing Server
Figure 169880DEST_PATH_IMAGE279
And a second auxiliary computing server
Figure 152879DEST_PATH_IMAGE268
Will be provided with
Figure 220192DEST_PATH_IMAGE387
And
Figure 237827DEST_PATH_IMAGE388
send to the Main participant client
Figure 997972DEST_PATH_IMAGE313
，
Figure 937110DEST_PATH_IMAGE389
Can recover
Figure 73693DEST_PATH_IMAGE390
。
Note: if necessary, simultaneously calculating
Figure 945834DEST_PATH_IMAGE391
And
Figure 142460DEST_PATH_IMAGE392
then calculate in
Figure 834472DEST_PATH_IMAGE393
Then, use directly
Figure 774747DEST_PATH_IMAGE393
Instead of its share participating in the operation, obtain
Figure 501394DEST_PATH_IMAGE383
But at this time, if the main participant client end
Figure 868922DEST_PATH_IMAGE189
At the same time obtain
Figure 313809DEST_PATH_IMAGE393
And
Figure 57775DEST_PATH_IMAGE383
then the intersection size is exposed.
Further, in S102, when the calculation requirement is to calculate the variance of the intersection set related data, the executed security statistic calculation protocol includes the following steps:
(5-1) Main participant client
Figure 638929DEST_PATH_IMAGE394
Set its private index
Figure 177357DEST_PATH_IMAGE395
Performing hash to obtain
Figure 843962DEST_PATH_IMAGE254
；
（5-2）
Figure 126039DEST_PATH_IMAGE396
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain
Figure 561699DEST_PATH_IMAGE397
Each box
Figure 536609DEST_PATH_IMAGE398
The elements in (A) are represented by
Figure 424930DEST_PATH_IMAGE399
(wherein
Figure 979539DEST_PATH_IMAGE400
，
Figure 269706DEST_PATH_IMAGE260
Hash the size of each box for simplicity);
(5-3) Main participant client
Figure 415517DEST_PATH_IMAGE250
Will be provided with
Figure 56714DEST_PATH_IMAGE401
The arithmetic sharing is as
Figure 946172DEST_PATH_IMAGE402
And
Figure 90846DEST_PATH_IMAGE403
will be
Figure 407558DEST_PATH_IMAGE404
Sending to the first auxiliary computing server
Figure 270472DEST_PATH_IMAGE405
Will be
Figure 432463DEST_PATH_IMAGE406
Sending to a second auxiliary computing server
Figure 962801DEST_PATH_IMAGE184
；
(5-4) for
Figure 184835DEST_PATH_IMAGE407
From the participant client
Figure 535045DEST_PATH_IMAGE408
Calculating a polynomial:
Figure 31885DEST_PATH_IMAGE409
，
from the master participant client to
Figure 151151DEST_PATH_IMAGE410
The arithmetic sharing is as
Figure 544086DEST_PATH_IMAGE411
And
Figure 381592DEST_PATH_IMAGE336
；
will be provided with
Figure 150965DEST_PATH_IMAGE412
Sending to the first auxiliary computing server
Figure 390317DEST_PATH_IMAGE150
(ii) a Will be provided with
Figure 219732DEST_PATH_IMAGE413
Sending to a second auxiliary computing server
Figure 544535DEST_PATH_IMAGE112
；
(5-5) for
Figure 852019DEST_PATH_IMAGE414
First auxiliary computing server
Figure 211456DEST_PATH_IMAGE362
Multiple invocation of secure multiplication protocol, computing
Figure 211773DEST_PATH_IMAGE415
(ii) a Second auxiliary computing server
Figure 758292DEST_PATH_IMAGE366
Multiple invocation secure multiplication protocolCalculating
Figure 869468DEST_PATH_IMAGE416
；
(5-6) for
Figure 83411DEST_PATH_IMAGE417
First auxiliary computing server
Figure 965613DEST_PATH_IMAGE418
Computing
Figure 265007DEST_PATH_IMAGE419
(ii) a Second auxiliary computing server
Figure 179874DEST_PATH_IMAGE112
Computing
Figure 248324DEST_PATH_IMAGE420
；
(5-7) for
Figure 324864DEST_PATH_IMAGE285
First auxiliary computing server
Figure 111555DEST_PATH_IMAGE150
To be provided with
Figure 564533DEST_PATH_IMAGE421
Invoking
Figure 753069DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 266090DEST_PATH_IMAGE422
(ii) a Second auxiliary computing server
Figure 274497DEST_PATH_IMAGE423
To be provided with
Figure 531166DEST_PATH_IMAGE424
Invoking
Figure 308629DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 992551DEST_PATH_IMAGE425
；
(5-8) for
Figure 488255DEST_PATH_IMAGE224
First auxiliary computing server
Figure 283035DEST_PATH_IMAGE426
To be provided with
Figure 180584DEST_PATH_IMAGE427
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 300987DEST_PATH_IMAGE428
(ii) a Second auxiliary computing server
Figure 283986DEST_PATH_IMAGE429
To be provided with
Figure 616879DEST_PATH_IMAGE430
The Boolean fraction of
Figure 634513DEST_PATH_IMAGE235
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 660238DEST_PATH_IMAGE431
；
(5-9) use
Figure 864955DEST_PATH_IMAGE432
To represent
Figure 267117DEST_PATH_IMAGE433
A set of corresponding values for the middle element; main participant client
Figure 139258DEST_PATH_IMAGE148
Will be provided with
Figure 335884DEST_PATH_IMAGE434
The arithmetic sharing is as
Figure 293476DEST_PATH_IMAGE435
And
Figure 968171DEST_PATH_IMAGE436
the master participant client sends
Figure 694818DEST_PATH_IMAGE437
To the first auxiliary computing server
Figure 327925DEST_PATH_IMAGE074
The master participant client sends
Figure 772813DEST_PATH_IMAGE438
To a second auxiliary computing server
Figure 985620DEST_PATH_IMAGE439
；
(5-10) for
Figure 832353DEST_PATH_IMAGE440
First auxiliary computing server
Figure 370782DEST_PATH_IMAGE282
To be provided with
Figure 37386DEST_PATH_IMAGE441
For input, a second auxiliary computing server
Figure 319463DEST_PATH_IMAGE184
To be provided with
Figure 20703DEST_PATH_IMAGE442
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 995612DEST_PATH_IMAGE150
Obtaining an output arithmetic quota
Figure 149513DEST_PATH_IMAGE443
Second auxiliary computing server
Figure 235281DEST_PATH_IMAGE221
Obtaining an output arithmetic quota
Figure 525448DEST_PATH_IMAGE444
；
(5-11) first auxiliary computing Server
Figure 671258DEST_PATH_IMAGE426
Calculating the arithmetic fraction of the size of the intersection
Figure 312455DEST_PATH_IMAGE445
And
Figure 670755DEST_PATH_IMAGE446
second auxiliary computing server
Figure 346587DEST_PATH_IMAGE033
Calculating the arithmetic fraction of the size of the intersection
Figure 663299DEST_PATH_IMAGE447
And
Figure 791792DEST_PATH_IMAGE448
；
(5-12) first auxiliary computing Server
Figure 953783DEST_PATH_IMAGE282
To be provided with
Figure 218542DEST_PATH_IMAGE449
For input, a second auxiliary computing server
Figure 706155DEST_PATH_IMAGE240
To be provided with
Figure 321945DEST_PATH_IMAGE450
For input, both parties call
Figure 553206DEST_PATH_IMAGE375
The protocol is such that the protocol is,
Figure 672471DEST_PATH_IMAGE379
obtaining the corresponding share of Yao
Figure 65407DEST_PATH_IMAGE451
Second auxiliary computing server
Figure 168492DEST_PATH_IMAGE452
Obtaining the corresponding share of Yao
Figure 672286DEST_PATH_IMAGE453
；
(5-13) first auxiliary computing Server
Figure 177216DEST_PATH_IMAGE454
To be provided with
Figure 741053DEST_PATH_IMAGE455
For input, a second auxiliary computing server
Figure 331434DEST_PATH_IMAGE456
To be provided with
Figure 904498DEST_PATH_IMAGE457
For input, calling the Yao's chaotic circuit protocol to calculate the average
Figure 732777DEST_PATH_IMAGE458
Both parties respectively get the average
Figure 733094DEST_PATH_IMAGE459
Share of Yao
Figure 545192DEST_PATH_IMAGE460
And
Figure 125209DEST_PATH_IMAGE461
；
Figure 73573DEST_PATH_IMAGE462
representing the size of the intersection;
(5-14) first auxiliary computing Server
Figure 979212DEST_PATH_IMAGE237
To be provided with
Figure 278607DEST_PATH_IMAGE463
For input, a second auxiliary computing server
Figure 193473DEST_PATH_IMAGE366
To be provided with
Figure 261923DEST_PATH_IMAGE464
Calling for input
Figure 338464DEST_PATH_IMAGE465
Protocol, first auxiliary computing server
Figure 125154DEST_PATH_IMAGE379
Obtain an output
Figure 578132DEST_PATH_IMAGE466
Second auxiliary computing server
Figure 501089DEST_PATH_IMAGE439
Share of Yao to get average output
Figure 14110DEST_PATH_IMAGE467
；
(5-15) first auxiliary computing Server
Figure 288096DEST_PATH_IMAGE276
To be provided with
Figure 279186DEST_PATH_IMAGE468
For input, a second auxiliary computing server
Figure 322228DEST_PATH_IMAGE240
To be provided with
Figure 6151DEST_PATH_IMAGE469
Invoking secure multiplication protocol computations for input
Figure 72212DEST_PATH_IMAGE470
Of the first auxiliary computing server
Figure 132572DEST_PATH_IMAGE379
Obtaining the arithmetic contribution of the square of the output mean
Figure 30121DEST_PATH_IMAGE471
Second auxiliary computing server
Figure 884945DEST_PATH_IMAGE240
Obtaining the arithmetic contribution of the square of the output mean
Figure 133523DEST_PATH_IMAGE472
；
(5-16) for
Figure 731995DEST_PATH_IMAGE473
First auxiliary computing server
Figure 218471DEST_PATH_IMAGE282
To be provided with
Figure 509775DEST_PATH_IMAGE474
For input, a second auxiliary computing server
Figure 980071DEST_PATH_IMAGE328
To be provided with
Figure 116654DEST_PATH_IMAGE475
Invoking secure multiplication protocol computations for input
Figure 723216DEST_PATH_IMAGE476
Of the first auxiliary computing server
Figure 185421DEST_PATH_IMAGE266
Obtaining an output arithmetic quota
Figure 877434DEST_PATH_IMAGE477
Second auxiliary computing server
Figure 817708DEST_PATH_IMAGE429
Obtaining an output arithmetic quota
Figure 544355DEST_PATH_IMAGE478
；
(5-17) first auxiliary computing Server
Figure 911883DEST_PATH_IMAGE454
Computing
Figure 91191DEST_PATH_IMAGE479
Second auxiliary computing server
Figure 569577DEST_PATH_IMAGE240
Computing
Figure 416310DEST_PATH_IMAGE480
；
First auxiliary computing server
Figure 954739DEST_PATH_IMAGE481
To be provided with
Figure 886923DEST_PATH_IMAGE482
For input, a second auxiliary computing server
Figure 903421DEST_PATH_IMAGE483
To be provided with
Figure 604660DEST_PATH_IMAGE484
To input, call
Figure 313990DEST_PATH_IMAGE375
Protocol, first auxiliary computing server
Figure 733470DEST_PATH_IMAGE150
Obtain an output
Figure 819238DEST_PATH_IMAGE485
Second auxiliary computing server
Figure 109405DEST_PATH_IMAGE486
Obtain an output
Figure 255216DEST_PATH_IMAGE487
；
(5-18) first auxiliary computing Server
Figure 896413DEST_PATH_IMAGE081
To be provided with
Figure 520292DEST_PATH_IMAGE488
For input, a second auxiliary computing server
Figure 930545DEST_PATH_IMAGE293
To be provided with
Figure 981677DEST_PATH_IMAGE489
Calling the calculation function of the Yao's chaotic circuit protocol for input
Figure 110170DEST_PATH_IMAGE490
Both parties respectively obtain
Figure 272161DEST_PATH_IMAGE491
Fraction of Yao
Figure 802500DEST_PATH_IMAGE492
And
Figure 290113DEST_PATH_IMAGE493
；
(5-19) first auxiliary computing Server
Figure 905902DEST_PATH_IMAGE379
To be provided with
Figure 871584DEST_PATH_IMAGE494
For input, a second auxiliary computing server
Figure 256429DEST_PATH_IMAGE184
To be provided with
Figure 649364DEST_PATH_IMAGE495
Calling for input
Figure 752450DEST_PATH_IMAGE375
Protocol, first auxiliary computing server
Figure 521822DEST_PATH_IMAGE242
Obtain an output
Figure 495595DEST_PATH_IMAGE496
Second auxiliary computing server
Figure 325010DEST_PATH_IMAGE360
Obtain an output
Figure 915392DEST_PATH_IMAGE497
；
(5-20) first auxiliary computing Server
Figure 222876DEST_PATH_IMAGE302
Calculating an arithmetic contribution to the variance
Figure 316734DEST_PATH_IMAGE498
；
Second auxiliary computing server
Figure 317051DEST_PATH_IMAGE499
Calculating an arithmetic contribution to the variance
Figure 129149DEST_PATH_IMAGE500
；
First auxiliary computing server
Figure 974746DEST_PATH_IMAGE379
Arithmetic share of variance
Figure 923110DEST_PATH_IMAGE501
Send to the Main participant client
Figure 828749DEST_PATH_IMAGE502
Second auxiliary computing server
Figure 862564DEST_PATH_IMAGE184
Arithmetic share of variance
Figure 511852DEST_PATH_IMAGE503
Send to the Main participant client
Figure 845881DEST_PATH_IMAGE504
The main participant client
Figure 188001DEST_PATH_IMAGE505
Calculating variance
Figure 709112DEST_PATH_IMAGE506
。
Further, in S102, when the calculation requirement is to calculate the maximum value and the minimum value of the intersection set related data, the executed secure statistical calculation protocol includes the following steps:
(6-1) Main participant client
Figure 162090DEST_PATH_IMAGE507
Set its private index
Figure 85046DEST_PATH_IMAGE508
Performing hash to obtain
Figure 332488DEST_PATH_IMAGE509
；
（6-2）
Figure 606475DEST_PATH_IMAGE255
Respectively carrying out simple hashing on the private index set (the valley hash and the 3 hash functions used by the simple hashing are the same) to obtain
Figure 863144DEST_PATH_IMAGE510
Each box
Figure 640607DEST_PATH_IMAGE511
The elements in (A) are represented by
Figure 324529DEST_PATH_IMAGE512
(wherein
Figure 554653DEST_PATH_IMAGE513
，
Figure 615013DEST_PATH_IMAGE321
Hash the size of each box for simplicity);
(6-3) Main participant client
Figure 512562DEST_PATH_IMAGE514
Will be provided with
Figure 101806DEST_PATH_IMAGE515
The arithmetic sharing is as
Figure 350385DEST_PATH_IMAGE516
And
Figure 948857DEST_PATH_IMAGE517
will be
Figure 169753DEST_PATH_IMAGE518
Sending to the first auxiliary computing server
Figure 461058DEST_PATH_IMAGE310
Will be
Figure 931353DEST_PATH_IMAGE519
Sending to a second auxiliary computing server
Figure 802357DEST_PATH_IMAGE152
；
(6-4) for
Figure 674498DEST_PATH_IMAGE520
From the participant client
Figure 136704DEST_PATH_IMAGE521
Calculating a polynomial:
Figure 828716DEST_PATH_IMAGE522
，
and will be
Figure 745553DEST_PATH_IMAGE523
The arithmetic sharing is as
Figure 472200DEST_PATH_IMAGE524
And
Figure 839728DEST_PATH_IMAGE525
；
from the participant client to the client
Figure 19036DEST_PATH_IMAGE526
Sending to the first auxiliary computing server
Figure 763001DEST_PATH_IMAGE186
(ii) a Will be provided with
Figure 344155DEST_PATH_IMAGE527
Sending to a second auxiliary computing server
Figure 882584DEST_PATH_IMAGE528
；
(6-5) for
Figure 549189DEST_PATH_IMAGE529
First auxiliary computing server
Figure 96845DEST_PATH_IMAGE279
Multiple invocation of secure multiplication protocol, computing
Figure 532505DEST_PATH_IMAGE530
(ii) a Second auxiliary computing server
Figure 241835DEST_PATH_IMAGE531
Multiple invocation of secure multiplication protocol, computing
Figure 661316DEST_PATH_IMAGE532
；
(6-6) for
Figure 747083DEST_PATH_IMAGE533
First auxiliary computing server
Figure 37250DEST_PATH_IMAGE150
Computing
Figure 917482DEST_PATH_IMAGE534
(ii) a Second auxiliary computing server
Figure 558678DEST_PATH_IMAGE033
Computing
Figure 448137DEST_PATH_IMAGE535
；
(6-7) for
Figure 858390DEST_PATH_IMAGE536
First auxiliary computing server
Figure 909522DEST_PATH_IMAGE426
To be provided with
Figure 38015DEST_PATH_IMAGE286
Invoking
Figure 668848DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 933607DEST_PATH_IMAGE537
(ii) a Second auxiliary computing server
Figure 421220DEST_PATH_IMAGE499
To be provided with
Figure 505851DEST_PATH_IMAGE538
Invoking
Figure 737112DEST_PATH_IMAGE231
Agreement to get a corresponding Boolean fraction
Figure 121957DEST_PATH_IMAGE235
；
(6-8) for
Figure 514892DEST_PATH_IMAGE539
First auxiliary computing server
Figure 617978DEST_PATH_IMAGE186
To be provided with
Figure 387351DEST_PATH_IMAGE540
Calling an arithmetic sharing equivalence test protocol to obtain
Figure 626702DEST_PATH_IMAGE541
(ii) a Second auxiliary computing server
Figure 456118DEST_PATH_IMAGE360
To be provided with
Figure 515341DEST_PATH_IMAGE542
Invoking arithmetic sharing equivalence testingProtocol, get
Figure 88404DEST_PATH_IMAGE543
；
(6-9) use
Figure 447842DEST_PATH_IMAGE544
To represent
Figure 182579DEST_PATH_IMAGE545
The corresponding set of values for the element in (a).
Figure 994678DEST_PATH_IMAGE353
Will be provided with
Figure 105853DEST_PATH_IMAGE546
The arithmetic sharing is as
Figure 319797DEST_PATH_IMAGE547
And
Figure 225436DEST_PATH_IMAGE548
sending out
Figure 524830DEST_PATH_IMAGE549
To the first auxiliary computing server
Figure 439697DEST_PATH_IMAGE266
Sending out
Figure 508147DEST_PATH_IMAGE550
To give
Figure 850266DEST_PATH_IMAGE308
；
(6-10) for
Figure 371378DEST_PATH_IMAGE304
First auxiliary computing server
Figure 824356DEST_PATH_IMAGE279
To be provided with
Figure 12891DEST_PATH_IMAGE551
For input, a second auxiliary computing server
Figure 525912DEST_PATH_IMAGE429
To be provided with
Figure 268740DEST_PATH_IMAGE552
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 525409DEST_PATH_IMAGE405
Obtain an output
Figure 568452DEST_PATH_IMAGE553
Second auxiliary computing server
Figure 252374DEST_PATH_IMAGE288
Obtain an output
Figure 13657DEST_PATH_IMAGE554
；
(6-11) for
Figure 808437DEST_PATH_IMAGE555
First auxiliary computing server
Figure 705986DEST_PATH_IMAGE405
To be provided with
Figure 560810DEST_PATH_IMAGE556
To input, call
Figure 543809DEST_PATH_IMAGE557
Protocol, first auxiliary computing server
Figure 142281DEST_PATH_IMAGE558
Obtain an output
Figure 894336DEST_PATH_IMAGE559
(ii) a Second auxiliary computing server
Figure 920061DEST_PATH_IMAGE560
To be provided with
Figure 124777DEST_PATH_IMAGE561
To input, call
Figure 261361DEST_PATH_IMAGE557
Protocol, second helper computing server
Figure 133502DEST_PATH_IMAGE562
Obtain an output
Figure 64549DEST_PATH_IMAGE563
；
(6-12) first auxiliary computing Server
Figure 756561DEST_PATH_IMAGE564
To be provided with
Figure 962415DEST_PATH_IMAGE565
For input, a second auxiliary computing server
Figure 689062DEST_PATH_IMAGE566
To be provided with
Figure 56589DEST_PATH_IMAGE567
For input, both use to find the maximum value
Figure 501477DEST_PATH_IMAGE568
And minimum value
Figure 979863DEST_PATH_IMAGE569
The Yao's chaotic circuit protocol is respectively obtained
Figure 561017DEST_PATH_IMAGE570
The fraction of yao pin of the maximum and minimum values (non-zero);
(6-13) first helper computing server
Figure 365025DEST_PATH_IMAGE564
And a second auxiliary computing server
Figure 766051DEST_PATH_IMAGE075
Sending the Yao quota to the client of the main participant
Figure 313707DEST_PATH_IMAGE571
，
Figure 749367DEST_PATH_IMAGE313
The main participant client can reconstruct the minimum value
Figure 724276DEST_PATH_IMAGE569
And maximum value
Figure 878177DEST_PATH_IMAGE568
。
In the end of this process,
Figure 721803DEST_PATH_IMAGE572
、
Figure 746391DEST_PATH_IMAGE237
and
Figure 892202DEST_PATH_IMAGE328
there is no output, and the output is not,
Figure 2240DEST_PATH_IMAGE133
can output (1)
Figure 891699DEST_PATH_IMAGE573
；（2）
Figure 301951DEST_PATH_IMAGE574
；（3）
Figure 353084DEST_PATH_IMAGE575
；（4）
Figure 481577DEST_PATH_IMAGE576
；（5）
Figure 643568DEST_PATH_IMAGE577
；（6）
Figure 173907DEST_PATH_IMAGE578
，
Figure 395940DEST_PATH_IMAGE579
。
By using the method described in this patent, two collusion-free helper computing servers can be used to enable
Figure 11730DEST_PATH_IMAGE580
Figure 977412DEST_PATH_IMAGE581
The participants respectively holding the private data sets obtain set intersection and the statistical calculation result of the intersection related data, including the size of the intersection, the sum of the intersection related data, the mean of the intersection related data, the variance of the intersection related data, the maximum and the minimum of the intersection related data and the like. This calculation process does not reveal any information other than the result.
All angle brackets in this example indicate the share of a parameter in brackets, e.g.
Figure 362256DEST_PATH_IMAGE582
To represent
Figure 20771DEST_PATH_IMAGE583
The portion of (1), superscript
Figure 592698DEST_PATH_IMAGE584
Indicates that this is an arithmetic fraction (
Figure 362071DEST_PATH_IMAGE585
The number of the Boolean fractions is expressed,
Figure 867001DEST_PATH_IMAGE586
representing the share of yao); subscript 0 indicates that this is the first minorHelp the server
Figure 430838DEST_PATH_IMAGE081
Is held (or is to be sent to)
Figure 490061DEST_PATH_IMAGE276
Has a share (subscript 1 denotes the second auxiliary server)
Figure 63124DEST_PATH_IMAGE221
）。
The embodiment provides a privacy protection system in a multi-client intersection data calculation process;
privacy protection system in many client intersection data computational process includes:
a random assignment module configured to: randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
an acquisition module configured to: acquiring a calculation demand;
a privacy protection module configured to: according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
a feedback module configured to: and the main participant client sends the statistical calculation result to the slave participant client.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. The privacy protection method in the multi-client intersection data calculation process is characterized by comprising the following steps:
assuming that there are several participant clients and two helper computing servers; each participant client is provided with a private index set; randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
acquiring a calculation demand; according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
the main participant client sends the statistical calculation result to the slave participant client;
when the computational requirement is to compute the set of intersections itself, the secure statistical computation protocol implemented includes the steps of:
(1-1) Main participant client
Figure DEST_PATH_IMAGE001
Set its private index
Figure DEST_PATH_IMAGE002
Performing hash of the grains to obtain
Figure DEST_PATH_IMAGE003
One box
Figure DEST_PATH_IMAGE004
；
Figure DEST_PATH_IMAGE005
Representing the total number of bins;
(1-2) slave participant client
Figure DEST_PATH_IMAGE006
Respectively carrying out simple hash on the private index sets to obtain the first
Figure DEST_PATH_IMAGE007
A slave client
Figure DEST_PATH_IMAGE008
One box
Figure DEST_PATH_IMAGE009
Of 1 at
Figure DEST_PATH_IMAGE010
A slave client
Figure DEST_PATH_IMAGE011
One box
Figure DEST_PATH_IMAGE012
The elements in (A) are represented by
Figure DEST_PATH_IMAGE013
Wherein, in the step (A),
Figure DEST_PATH_IMAGE014
，
Figure DEST_PATH_IMAGE015
the size of each box is simply hashed;
(1-3) Main participant client
Figure DEST_PATH_IMAGE016
Will be provided with
Figure DEST_PATH_IMAGE017
Arithmetic sharing as being sent to a first helper computing server
Figure DEST_PATH_IMAGE018
Is an arithmetic portion of
Figure DEST_PATH_IMAGE019
And to be sent to a second auxiliary computing server
Figure DEST_PATH_IMAGE020
Is an arithmetic portion of
Figure DEST_PATH_IMAGE021
Respectively sent to the first auxiliary computing server
Figure DEST_PATH_IMAGE022
And a second auxiliary computing server
Figure DEST_PATH_IMAGE023
；
(1-4) for
Figure DEST_PATH_IMAGE024
From the participant client
Figure DEST_PATH_IMAGE025
Calculating a polynomial:
Figure DEST_PATH_IMAGE026
，
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE027
representing secondary participant clients
Figure DEST_PATH_IMAGE028
Corresponds to
Figure DEST_PATH_IMAGE029
A polynomial of the data in the individual bins;
Figure DEST_PATH_IMAGE030
the expression of the independent variable is shown,
Figure DEST_PATH_IMAGE031
show that
Figure DEST_PATH_IMAGE032
And
Figure DEST_PATH_IMAGE033
then the difference result is multiplied together,
Figure DEST_PATH_IMAGE034
coefficients representing a polynomial; if and only if handle
Figure DEST_PATH_IMAGE035
When the data is substituted into the polynomial, the value of the polynomial is 0;
will be provided with
Figure DEST_PATH_IMAGE036
The arithmetic sharing is as
Figure DEST_PATH_IMAGE037
And
Figure DEST_PATH_IMAGE038
；
Figure DEST_PATH_IMAGE039
to represent
Figure DEST_PATH_IMAGE040
A constituent set of all coefficients of (a);
dividing the polynomial coefficient fraction
Figure DEST_PATH_IMAGE041
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE042
(ii) a Dividing the polynomial coefficient fraction
Figure DEST_PATH_IMAGE043
Sending to a second auxiliary computing server
Figure DEST_PATH_IMAGE044
；
(1-5) for
Figure DEST_PATH_IMAGE045
First auxiliary computing server
Figure DEST_PATH_IMAGE046
According to the data received in the step (1-3) and the step (1-4), calling a safe multiplication protocol for multiple times, and calculating an arithmetic share
Figure DEST_PATH_IMAGE047
(ii) a The second auxiliary computing server calls the safe multiplication protocol for multiple times according to the data received in the step (1-3) and the step (1-4) to compute the arithmetic share
Figure DEST_PATH_IMAGE048
；
(1-6) for
Figure DEST_PATH_IMAGE049
First auxiliary computing server
Figure 840695DEST_PATH_IMAGE046
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure DEST_PATH_IMAGE050
Second auxiliary computing server
Figure DEST_PATH_IMAGE051
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure DEST_PATH_IMAGE052
；
(1-7) first auxiliary computing Server
Figure DEST_PATH_IMAGE053
And a second auxiliary computing server
Figure 383934DEST_PATH_IMAGE023
Will be provided with
Figure DEST_PATH_IMAGE054
And
Figure DEST_PATH_IMAGE055
send to the Main participant client
Figure DEST_PATH_IMAGE056
；
Main participant client
Figure DEST_PATH_IMAGE057
Computing
Figure DEST_PATH_IMAGE058
，
Figure DEST_PATH_IMAGE059
Is shown if
Figure DEST_PATH_IMAGE060
Then, then
Figure DEST_PATH_IMAGE061
Is an intersection element;
Figure DEST_PATH_IMAGE062
representing the final sought set intersection;
introducing two collusion-free helper computing servers in a protocol
Figure DEST_PATH_IMAGE063
And
Figure DEST_PATH_IMAGE064
the auxiliary computing server has no input; in actual deployment, the auxiliary computing server selects two different public cloud platforms; the collusion means that both parties do not share their private data with each other, thereby protecting the private data.
2. The method of claim 1, wherein the computing requirements comprise: calculating the intersection set, the size of the intersection set, the sum of the intersection set, the mean of the intersection set, the variance of the intersection set, the maximum of the intersection set and the minimum of the intersection set.
3. The privacy protection method in the process of computing the intersection set of multiple clients according to claim 1, wherein when the computing requirement is the size of the computing intersection set, the security statistic computing protocol is executed including the following steps:
(2-1) Main participant client
Figure DEST_PATH_IMAGE065
Set its private index
Figure DEST_PATH_IMAGE066
Performing hash to obtain
Figure DEST_PATH_IMAGE067
；
（2-2）
Figure DEST_PATH_IMAGE068
Respectively carrying out simple hash on the private index sets to obtain
Figure DEST_PATH_IMAGE069
Each box
Figure DEST_PATH_IMAGE070
The elements in (A) are represented by
Figure DEST_PATH_IMAGE071
Wherein
Figure DEST_PATH_IMAGE072
，
Figure DEST_PATH_IMAGE073
The size of each box is simply hashed;
(2-3) Main participant client
Figure DEST_PATH_IMAGE074
Will be provided with
Figure DEST_PATH_IMAGE075
The arithmetic sharing is as
Figure DEST_PATH_IMAGE076
And
Figure DEST_PATH_IMAGE077
will be
Figure DEST_PATH_IMAGE078
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE079
Will be
Figure DEST_PATH_IMAGE080
Sending to a second auxiliary computing server
Figure 478185DEST_PATH_IMAGE023
；
(2-4) for
Figure DEST_PATH_IMAGE081
，
Figure DEST_PATH_IMAGE082
Calculating polynomial
Figure DEST_PATH_IMAGE083
And will be
Figure DEST_PATH_IMAGE084
The arithmetic sharing is as
Figure DEST_PATH_IMAGE085
And
Figure DEST_PATH_IMAGE086
will be
Figure DEST_PATH_IMAGE087
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE088
Will be
Figure DEST_PATH_IMAGE089
Sending to a second auxiliary computing server
Figure 324261DEST_PATH_IMAGE020
；
(2-5) for
Figure DEST_PATH_IMAGE090
First auxiliary computing server
Figure 528846DEST_PATH_IMAGE018
And a second auxiliary computing server
Figure DEST_PATH_IMAGE091
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE092
And
Figure DEST_PATH_IMAGE093
；
(2-6) for
Figure DEST_PATH_IMAGE094
Based on
Figure DEST_PATH_IMAGE095
First auxiliary computing server
Figure DEST_PATH_IMAGE096
Calculate out
Figure DEST_PATH_IMAGE097
(ii) a Based on
Figure DEST_PATH_IMAGE098
Second auxiliary computing server
Figure DEST_PATH_IMAGE099
Calculate out
Figure DEST_PATH_IMAGE100
；
(2-7) for
Figure DEST_PATH_IMAGE101
First auxiliary computing server
Figure 462561DEST_PATH_IMAGE063
To be provided with
Figure DEST_PATH_IMAGE102
Invoking
Figure DEST_PATH_IMAGE103
Converting the arithmetic quota into a Boolean quota to obtain a corresponding Boolean quota
Figure DEST_PATH_IMAGE104
(ii) a Second auxiliary computing server
Figure 57490DEST_PATH_IMAGE051
To be provided with
Figure DEST_PATH_IMAGE105
Invoking
Figure DEST_PATH_IMAGE106
Converting the arithmetic quota into a Boolean quota to obtain a corresponding Boolean quota
Figure DEST_PATH_IMAGE107
；
(2-8) for
Figure DEST_PATH_IMAGE108
First auxiliary computing server
Figure DEST_PATH_IMAGE109
To be provided with
Figure DEST_PATH_IMAGE110
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE111
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE112
To be provided with
Figure 961117DEST_PATH_IMAGE107
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE113
；
(2-9) first auxiliary computing Server
Figure DEST_PATH_IMAGE114
Computing
Figure DEST_PATH_IMAGE115
(ii) a Second helper computing server computing
Figure DEST_PATH_IMAGE116
(ii) a First auxiliary computing server
Figure DEST_PATH_IMAGE117
Will be provided with
Figure DEST_PATH_IMAGE118
Send to the Main participant client
Figure DEST_PATH_IMAGE119
The second auxiliary computing server will
Figure DEST_PATH_IMAGE120
Send to the Main participant client
Figure DEST_PATH_IMAGE121
The main participant client
Figure DEST_PATH_IMAGE122
Computing
Figure DEST_PATH_IMAGE123
。
4. The privacy protection method in the process of computing the intersection set of multiple clients according to claim 1, wherein when the computation requirement is to compute the sum of the intersection set, the security statistic computation protocol is executed including the following steps:
(3-1) Main participant client
Figure 230994DEST_PATH_IMAGE056
Set its private index
Figure DEST_PATH_IMAGE124
Performing hash to obtain
Figure DEST_PATH_IMAGE125
；
（3-2）
Figure DEST_PATH_IMAGE126
Respectively carrying out simple hash on the private index sets to obtain
Figure DEST_PATH_IMAGE127
Each box
Figure DEST_PATH_IMAGE128
The elements in (A) are represented by
Figure DEST_PATH_IMAGE129
Wherein
Figure DEST_PATH_IMAGE130
，
Figure DEST_PATH_IMAGE131
The size of each box is simply hashed;
(3-3) Main participant client
Figure DEST_PATH_IMAGE132
Will be provided with
Figure DEST_PATH_IMAGE133
The arithmetic sharing is as
Figure DEST_PATH_IMAGE134
And
Figure DEST_PATH_IMAGE135
will be
Figure DEST_PATH_IMAGE136
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE137
Will be
Figure DEST_PATH_IMAGE138
Sending to a second auxiliary computing server
Figure DEST_PATH_IMAGE139
；
(3-4) for
Figure DEST_PATH_IMAGE140
，
Figure DEST_PATH_IMAGE141
Calculating polynomial
Figure DEST_PATH_IMAGE142
And will be
Figure DEST_PATH_IMAGE143
The arithmetic sharing is as
Figure DEST_PATH_IMAGE144
And
Figure DEST_PATH_IMAGE145
and will be
Figure DEST_PATH_IMAGE146
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE147
(ii) a Will be provided with
Figure DEST_PATH_IMAGE148
Sending to a second auxiliary computing server
Figure 837074DEST_PATH_IMAGE139
；
(3-5) for
Figure DEST_PATH_IMAGE149
First auxiliary computing server
Figure DEST_PATH_IMAGE150
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE151
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE152
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE153
；
(3-6) for
Figure 184879DEST_PATH_IMAGE094
First auxiliary computing server
Figure 610307DEST_PATH_IMAGE117
Computing
Figure DEST_PATH_IMAGE154
(ii) a Second auxiliary computing server
Figure 71375DEST_PATH_IMAGE064
Computing
Figure DEST_PATH_IMAGE155
；
(3-7) for
Figure DEST_PATH_IMAGE156
First auxiliary computing server
Figure 625853DEST_PATH_IMAGE109
To be provided with
Figure DEST_PATH_IMAGE157
Invoking
Figure 567613DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE158
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE159
To be provided with
Figure DEST_PATH_IMAGE160
Invoking
Figure 967370DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE161
；
(3-8) for
Figure 548524DEST_PATH_IMAGE101
First auxiliary computing server
Figure 883690DEST_PATH_IMAGE109
To be provided with
Figure DEST_PATH_IMAGE162
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE163
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE164
To be provided with
Figure DEST_PATH_IMAGE165
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE166
；
(3-9) use
Figure DEST_PATH_IMAGE167
To represent
Figure DEST_PATH_IMAGE168
A set of corresponding values for the middle element; main participant client
Figure 51760DEST_PATH_IMAGE122
Will be provided with
Figure DEST_PATH_IMAGE169
The arithmetic sharing is as
Figure DEST_PATH_IMAGE170
And
Figure DEST_PATH_IMAGE171
sending out
Figure DEST_PATH_IMAGE172
For the first auxiliary calculationServer
Figure DEST_PATH_IMAGE173
Sending out
Figure DEST_PATH_IMAGE174
To a second auxiliary computing server
Figure 192891DEST_PATH_IMAGE164
；
(3-10) for
Figure DEST_PATH_IMAGE175
First auxiliary computing server
Figure 316967DEST_PATH_IMAGE109
To be provided with
Figure DEST_PATH_IMAGE176
For input, a second auxiliary computing server
Figure 275565DEST_PATH_IMAGE091
To be provided with
Figure DEST_PATH_IMAGE177
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure DEST_PATH_IMAGE178
Obtain an output
Figure DEST_PATH_IMAGE179
Second auxiliary computing server
Figure DEST_PATH_IMAGE180
Obtain an output
Figure DEST_PATH_IMAGE181
；
（3-11）First auxiliary computing server
Figure 789985DEST_PATH_IMAGE178
Computing
Figure DEST_PATH_IMAGE182
Second auxiliary computing server
Figure 859441DEST_PATH_IMAGE020
Computing
Figure DEST_PATH_IMAGE183
And sent to the client of the main participant
Figure DEST_PATH_IMAGE184
The main participant client
Figure DEST_PATH_IMAGE185
Computing
Figure DEST_PATH_IMAGE186
。
5. The privacy protection method in the process of computing the intersection data of multiple clients according to claim 1, wherein when the computing requirement is to compute the mean value of the intersection set, the executed security statistic computing protocol includes the following steps:
(4-1) Main participant client
Figure DEST_PATH_IMAGE187
Set its private index
Figure 775707DEST_PATH_IMAGE124
Performing hash to obtain
Figure DEST_PATH_IMAGE188
；
（4-2）
Figure DEST_PATH_IMAGE189
Respectively carrying out simple hash on the private index sets to obtain
Figure 842889DEST_PATH_IMAGE127
Each box
Figure DEST_PATH_IMAGE190
The elements in (A) are represented by
Figure DEST_PATH_IMAGE191
Wherein
Figure 641343DEST_PATH_IMAGE130
，
Figure DEST_PATH_IMAGE192
The size of each box is simply hashed;
(4-3) Main participant client
Figure DEST_PATH_IMAGE193
Will be provided with
Figure DEST_PATH_IMAGE194
The arithmetic sharing is as
Figure DEST_PATH_IMAGE195
And
Figure DEST_PATH_IMAGE196
，
will be provided with
Figure DEST_PATH_IMAGE197
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE198
Will be
Figure DEST_PATH_IMAGE199
Sending to a second auxiliary computing server
Figure DEST_PATH_IMAGE200
；
(4-4) for
Figure DEST_PATH_IMAGE201
From the participant client
Figure DEST_PATH_IMAGE202
Calculating a polynomial:
Figure DEST_PATH_IMAGE203
，
from the participant client to the client
Figure DEST_PATH_IMAGE204
The arithmetic sharing is as
Figure DEST_PATH_IMAGE205
And
Figure DEST_PATH_IMAGE206
(ii) a Will be provided with
Figure DEST_PATH_IMAGE207
Sending to the first auxiliary computing server
Figure 817285DEST_PATH_IMAGE147
(ii) a Will be provided with
Figure DEST_PATH_IMAGE208
Sending to a second auxiliary computing server
Figure 476806DEST_PATH_IMAGE064
；
(4-5) for
Figure DEST_PATH_IMAGE209
First auxiliary computing server
Figure 527938DEST_PATH_IMAGE109
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE210
(ii) a Second auxiliary computing server
Figure 141584DEST_PATH_IMAGE064
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE211
；
(4-6) for
Figure DEST_PATH_IMAGE212
First auxiliary computing server
Figure 490526DEST_PATH_IMAGE147
Computing
Figure DEST_PATH_IMAGE213
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE214
Computing
Figure DEST_PATH_IMAGE215
；
(4-7) for
Figure DEST_PATH_IMAGE216
First auxiliary computing server
Figure 115805DEST_PATH_IMAGE173
To be provided with
Figure DEST_PATH_IMAGE217
Invoking
Figure 587106DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE218
(ii) a Second auxiliary computing server
Figure 937316DEST_PATH_IMAGE152
To be provided with
Figure DEST_PATH_IMAGE219
Invoking
Figure 653731DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE220
；
(4-8) for
Figure DEST_PATH_IMAGE221
First auxiliary computing server
Figure 959947DEST_PATH_IMAGE018
To be provided with
Figure 87303DEST_PATH_IMAGE110
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE222
(ii) a Second auxiliary computing server
Figure 675541DEST_PATH_IMAGE051
To be provided with
Figure DEST_PATH_IMAGE223
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE224
；
(4-9) use
Figure DEST_PATH_IMAGE225
To represent
Figure DEST_PATH_IMAGE226
A set of corresponding values for the middle element; main participant client
Figure DEST_PATH_IMAGE227
Will be provided with
Figure DEST_PATH_IMAGE228
The arithmetic sharing is as
Figure DEST_PATH_IMAGE229
And
Figure DEST_PATH_IMAGE230
；
main participant client
Figure DEST_PATH_IMAGE231
Sending
Figure DEST_PATH_IMAGE232
To the first auxiliary computing server
Figure 117018DEST_PATH_IMAGE173
The main participant client
Figure 356370DEST_PATH_IMAGE122
Sending
Figure DEST_PATH_IMAGE233
To a second auxiliary computing server
Figure DEST_PATH_IMAGE234
；
(4-10) for
Figure 405359DEST_PATH_IMAGE175
First auxiliary computing server
Figure DEST_PATH_IMAGE235
To be provided with
Figure DEST_PATH_IMAGE236
For input, a second auxiliary computing server
Figure 651533DEST_PATH_IMAGE164
To be provided with
Figure DEST_PATH_IMAGE237
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 224597DEST_PATH_IMAGE147
Obtain an output
Figure DEST_PATH_IMAGE238
Second auxiliary computing server
Figure 538029DEST_PATH_IMAGE234
Obtain an output
Figure DEST_PATH_IMAGE239
；
(4-11) first auxiliary computing Server
Figure DEST_PATH_IMAGE240
Computing
Figure DEST_PATH_IMAGE241
And
Figure DEST_PATH_IMAGE242
second auxiliary computing server
Figure 928559DEST_PATH_IMAGE164
Computing
Figure DEST_PATH_IMAGE243
And
Figure DEST_PATH_IMAGE244
；
(4-12) first auxiliary computing Server
Figure DEST_PATH_IMAGE245
To be provided with
Figure DEST_PATH_IMAGE246
For input, a second auxiliary computing server
Figure 987712DEST_PATH_IMAGE051
To be provided with
Figure DEST_PATH_IMAGE247
For input, both parties call
Figure DEST_PATH_IMAGE248
Protocol, first auxiliary computing server
Figure DEST_PATH_IMAGE249
Obtaining the corresponding share of Yao
Figure DEST_PATH_IMAGE250
Second auxiliary computing server
Figure 223521DEST_PATH_IMAGE164
Obtaining the corresponding fractions of Yao's diseaseShare of
Figure DEST_PATH_IMAGE251
；
(4-13) first auxiliary computing Server
Figure DEST_PATH_IMAGE252
To be provided with
Figure DEST_PATH_IMAGE253
For input, a second auxiliary computing server
Figure 860301DEST_PATH_IMAGE051
To be provided with
Figure DEST_PATH_IMAGE254
Calling the calculation function of the Yao's chaotic circuit protocol for input
Figure DEST_PATH_IMAGE255
First auxiliary computing server
Figure 15208DEST_PATH_IMAGE252
To obtain
Figure DEST_PATH_IMAGE256
Is/are as follows
Figure DEST_PATH_IMAGE257
Portion(s) of
Figure DEST_PATH_IMAGE258
Second auxiliary computing server
Figure 737438DEST_PATH_IMAGE159
To obtain
Figure 386726DEST_PATH_IMAGE256
Is/are as follows
Figure 251913DEST_PATH_IMAGE257
Portion(s) of
Figure DEST_PATH_IMAGE259
；
(4-14) first auxiliary computing Server
Figure 374459DEST_PATH_IMAGE150
And a second auxiliary computing server
Figure DEST_PATH_IMAGE260
Will be provided with
Figure DEST_PATH_IMAGE261
And
Figure DEST_PATH_IMAGE262
send to the Main participant client
Figure DEST_PATH_IMAGE263
，
Figure DEST_PATH_IMAGE264
Can recover
Figure DEST_PATH_IMAGE265
。
6. The method of claim 1, wherein the privacy preserving method is applied to the computation process of multi-client intersection data,
when the computational requirement is to compute the variance of the set of intersections, the secure statistical computation protocol implemented comprises the steps of:
(5-1) Main participant client
Figure DEST_PATH_IMAGE266
Set its private index
Figure DEST_PATH_IMAGE267
Performing hash to obtain
Figure 911882DEST_PATH_IMAGE125
；
（5-2）
Figure DEST_PATH_IMAGE268
Respectively carrying out simple hash on the private index sets to obtain
Figure DEST_PATH_IMAGE269
Each box
Figure DEST_PATH_IMAGE270
The elements in (A) are represented by
Figure DEST_PATH_IMAGE271
Wherein
Figure DEST_PATH_IMAGE272
，
Figure DEST_PATH_IMAGE273
The size of each box is simply hashed;
(5-3) Main participant client
Figure 709068DEST_PATH_IMAGE122
Will be provided with
Figure DEST_PATH_IMAGE274
The arithmetic sharing is as
Figure DEST_PATH_IMAGE275
And
Figure DEST_PATH_IMAGE276
will be
Figure DEST_PATH_IMAGE277
Sent to the first auxiliary computingServer
Figure DEST_PATH_IMAGE278
Will be
Figure DEST_PATH_IMAGE279
Sending to a second auxiliary computing server
Figure 461385DEST_PATH_IMAGE064
；
(5-4) for
Figure DEST_PATH_IMAGE280
From the participant client
Figure DEST_PATH_IMAGE281
Calculating a polynomial:
Figure DEST_PATH_IMAGE282
，
from the master participant client to
Figure DEST_PATH_IMAGE283
The arithmetic sharing is as
Figure DEST_PATH_IMAGE284
And
Figure 584193DEST_PATH_IMAGE208
；
will be provided with
Figure DEST_PATH_IMAGE285
Sending to the first auxiliary computing server
Figure 592601DEST_PATH_IMAGE018
(ii) a Will be provided with
Figure DEST_PATH_IMAGE286
Sending to a second auxiliary computing server
Figure 770641DEST_PATH_IMAGE064
；
(5-5) for
Figure 829995DEST_PATH_IMAGE149
First auxiliary computing server
Figure 779497DEST_PATH_IMAGE235
Multiple invocation of secure multiplication protocol, computing
Figure 540779DEST_PATH_IMAGE092
(ii) a Second auxiliary computing server
Figure 866718DEST_PATH_IMAGE234
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE287
；
(5-6) for
Figure DEST_PATH_IMAGE288
First auxiliary computing server
Figure DEST_PATH_IMAGE289
Computing
Figure DEST_PATH_IMAGE290
(ii) a Second auxiliary computing server
Figure 685639DEST_PATH_IMAGE051
Computing
Figure DEST_PATH_IMAGE291
；
(5-7) for
Figure 13897DEST_PATH_IMAGE156
First auxiliary computing server
Figure 996896DEST_PATH_IMAGE018
To be provided with
Figure DEST_PATH_IMAGE292
Invoking
Figure 579056DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE293
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE294
To be provided with
Figure DEST_PATH_IMAGE295
Invoking
Figure 753948DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE296
；
(5-8) for
Figure 779673DEST_PATH_IMAGE094
First auxiliary computing server
Figure DEST_PATH_IMAGE297
To be provided with
Figure DEST_PATH_IMAGE298
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE299
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE300
To be provided with
Figure DEST_PATH_IMAGE301
The Boolean fraction of
Figure 859755DEST_PATH_IMAGE107
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE302
；
(5-9) use
Figure DEST_PATH_IMAGE303
To represent
Figure DEST_PATH_IMAGE304
A set of corresponding values for the middle element; main participant client
Figure 183289DEST_PATH_IMAGE016
Will be provided with
Figure DEST_PATH_IMAGE305
The arithmetic sharing is as
Figure DEST_PATH_IMAGE306
And
Figure DEST_PATH_IMAGE307
the master participant client sends
Figure DEST_PATH_IMAGE308
To the first auxiliary computing server
Figure 212687DEST_PATH_IMAGE178
The master participant client sends
Figure DEST_PATH_IMAGE309
To a second auxiliary computing server
Figure DEST_PATH_IMAGE310
；
(5-10) for
Figure DEST_PATH_IMAGE311
First auxiliary computing server
Figure 596264DEST_PATH_IMAGE117
To be provided with
Figure DEST_PATH_IMAGE312
For input, a second auxiliary computing server
Figure 288276DEST_PATH_IMAGE051
To be provided with
Figure 713704DEST_PATH_IMAGE177
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 237089DEST_PATH_IMAGE018
Obtaining an output arithmetic quota
Figure DEST_PATH_IMAGE313
Second auxiliary computing server
Figure DEST_PATH_IMAGE314
Obtaining an output arithmetic quota
Figure DEST_PATH_IMAGE315
；
(5-11) first auxiliary computing Server
Figure 791567DEST_PATH_IMAGE297
Calculating the arithmetic fraction of the size of the intersection
Figure DEST_PATH_IMAGE316
And
Figure DEST_PATH_IMAGE317
second auxiliary computing server
Figure DEST_PATH_IMAGE318
Calculating the arithmetic fraction of the size of the intersection
Figure DEST_PATH_IMAGE319
And
Figure DEST_PATH_IMAGE320
；
(5-12) first auxiliary computing Server
Figure 331395DEST_PATH_IMAGE117
To be provided with
Figure DEST_PATH_IMAGE321
For input, a second auxiliary computing server
Figure 59049DEST_PATH_IMAGE112
To be provided with
Figure DEST_PATH_IMAGE322
For input, both parties call
Figure 640203DEST_PATH_IMAGE248
The protocol is such that the protocol is,
Figure 663785DEST_PATH_IMAGE252
obtaining the corresponding share of Yao
Figure DEST_PATH_IMAGE323
Second assistanceComputing server
Figure DEST_PATH_IMAGE324
Obtaining the corresponding share of Yao
Figure DEST_PATH_IMAGE325
；
(5-13) first auxiliary computing Server
Figure DEST_PATH_IMAGE326
To be provided with
Figure DEST_PATH_IMAGE327
For input, a second auxiliary computing server
Figure DEST_PATH_IMAGE328
To be provided with
Figure DEST_PATH_IMAGE329
For input, calling the Yao's chaotic circuit protocol to calculate the average
Figure DEST_PATH_IMAGE330
Both parties respectively get the average
Figure DEST_PATH_IMAGE331
Share of Yao
Figure DEST_PATH_IMAGE332
And
Figure DEST_PATH_IMAGE333
；
Figure DEST_PATH_IMAGE334
representing the size of the intersection;
(5-14) first auxiliary computing Server
Figure 736914DEST_PATH_IMAGE109
To be provided with
Figure DEST_PATH_IMAGE335
For input, a second auxiliary computing server
Figure 515863DEST_PATH_IMAGE139
To be provided with
Figure DEST_PATH_IMAGE336
Calling for input
Figure DEST_PATH_IMAGE337
Protocol, first auxiliary computing server
Figure 748261DEST_PATH_IMAGE252
Obtain an output
Figure DEST_PATH_IMAGE338
Second auxiliary computing server
Figure 926432DEST_PATH_IMAGE310
Share of Yao to get average output
Figure DEST_PATH_IMAGE339
；
(5-15) first auxiliary computing Server
Figure 329601DEST_PATH_IMAGE147
To be provided with
Figure DEST_PATH_IMAGE340
For input, a second auxiliary computing server
Figure 415369DEST_PATH_IMAGE112
To be provided with
Figure DEST_PATH_IMAGE341
Invoking Security for inputMultiplication protocol calculation
Figure DEST_PATH_IMAGE342
Of the first auxiliary computing server
Figure 393951DEST_PATH_IMAGE252
Obtaining the arithmetic contribution of the square of the output mean
Figure DEST_PATH_IMAGE343
Second auxiliary computing server
Figure 523450DEST_PATH_IMAGE112
Obtaining the arithmetic contribution of the square of the output mean
Figure DEST_PATH_IMAGE344
；
(5-16) for
Figure DEST_PATH_IMAGE345
First auxiliary computing server
Figure 899068DEST_PATH_IMAGE117
To be provided with
Figure DEST_PATH_IMAGE346
For input, a second auxiliary computing server
Figure DEST_PATH_IMAGE347
To be provided with
Figure DEST_PATH_IMAGE348
Invoking secure multiplication protocol computations for input
Figure DEST_PATH_IMAGE349
Of the first auxiliary computing server
Figure 132734DEST_PATH_IMAGE240
Obtaining an output arithmetic quota
Figure DEST_PATH_IMAGE350
Second auxiliary computing server
Figure 542987DEST_PATH_IMAGE300
Obtaining an output arithmetic quota
Figure DEST_PATH_IMAGE351
；
(5-17) first auxiliary computing Server
Figure 79273DEST_PATH_IMAGE326
Computing
Figure DEST_PATH_IMAGE352
Second auxiliary computing server
Figure 942186DEST_PATH_IMAGE112
Computing
Figure DEST_PATH_IMAGE353
；
First auxiliary computing server
Figure DEST_PATH_IMAGE354
To be provided with
Figure DEST_PATH_IMAGE355
For input, a second auxiliary computing server
Figure 291128DEST_PATH_IMAGE152
To be provided with
Figure DEST_PATH_IMAGE356
To input, call
Figure 306620DEST_PATH_IMAGE248
Protocol, first auxiliary computing server
Figure 590971DEST_PATH_IMAGE018
Obtain an output
Figure DEST_PATH_IMAGE357
Second auxiliary computing server
Figure DEST_PATH_IMAGE358
Obtain an output
Figure DEST_PATH_IMAGE359
；
(5-18) first auxiliary computing Server
Figure 128131DEST_PATH_IMAGE063
To be provided with
Figure DEST_PATH_IMAGE360
For input, a second auxiliary computing server
Figure 828234DEST_PATH_IMAGE164
To be provided with
Figure DEST_PATH_IMAGE361
Calling the calculation function of the Yao's chaotic circuit protocol for input
Figure DEST_PATH_IMAGE362
Both parties respectively obtain
Figure DEST_PATH_IMAGE363
Fraction of Yao
Figure DEST_PATH_IMAGE364
And
Figure DEST_PATH_IMAGE365
；
(5-19) first auxiliary computing Server
Figure 822866DEST_PATH_IMAGE252
To be provided with
Figure DEST_PATH_IMAGE366
For input, a second auxiliary computing server
Figure 215801DEST_PATH_IMAGE051
To be provided with
Figure DEST_PATH_IMAGE367
Calling for input
Figure 804040DEST_PATH_IMAGE248
Protocol, first auxiliary computing server
Figure 307833DEST_PATH_IMAGE114
Obtain an output
Figure DEST_PATH_IMAGE368
Second auxiliary computing server
Figure 530873DEST_PATH_IMAGE260
Obtain an output
Figure DEST_PATH_IMAGE369
；
(5-20) first auxiliary computing Server
Figure DEST_PATH_IMAGE370
Calculating an arithmetic contribution to the variance
Figure DEST_PATH_IMAGE371
；
Second auxiliary computing server
Figure DEST_PATH_IMAGE372
Calculating an arithmetic contribution to the variance
Figure DEST_PATH_IMAGE373
；
First auxiliary computing server
Figure 783125DEST_PATH_IMAGE252
Arithmetic share of variance
Figure DEST_PATH_IMAGE374
Send to the Main participant client
Figure DEST_PATH_IMAGE375
Second auxiliary computing server
Figure 763719DEST_PATH_IMAGE051
Arithmetic share of variance
Figure DEST_PATH_IMAGE376
Send to the Main participant client
Figure DEST_PATH_IMAGE377
The main participant client
Figure DEST_PATH_IMAGE378
Calculating variance
Figure DEST_PATH_IMAGE379
。
7. The method of claim 1, wherein the privacy preserving method is applied to the computation process of multi-client intersection data,
when the calculation requirements are to calculate the maximum value of the intersection set and the minimum value of the intersection set, the executed safety statistic calculation protocol comprises the following steps:
(6-1) Main participant client
Figure DEST_PATH_IMAGE380
Set its private index
Figure DEST_PATH_IMAGE381
Performing hash to obtain
Figure DEST_PATH_IMAGE382
；
（6-2）
Figure DEST_PATH_IMAGE383
Respectively carrying out simple hash on the private index sets to obtain
Figure DEST_PATH_IMAGE384
Each box
Figure DEST_PATH_IMAGE385
The elements in (A) are represented by
Figure DEST_PATH_IMAGE386
Wherein
Figure DEST_PATH_IMAGE387
，
Figure 764212DEST_PATH_IMAGE192
The size of each box is simply hashed;
(6-3) Main participant client
Figure 858070DEST_PATH_IMAGE074
Will be provided with
Figure DEST_PATH_IMAGE388
The arithmetic sharing is as
Figure DEST_PATH_IMAGE389
And
Figure DEST_PATH_IMAGE390
will be
Figure 779759DEST_PATH_IMAGE277
Sending to the first auxiliary computing server
Figure DEST_PATH_IMAGE391
Will be
Figure DEST_PATH_IMAGE392
Sending to a second auxiliary computing server
Figure 77010DEST_PATH_IMAGE020
；
(6-4) for
Figure DEST_PATH_IMAGE393
From the participant client
Figure DEST_PATH_IMAGE394
Calculating a polynomial:
Figure DEST_PATH_IMAGE395
，
and will be
Figure DEST_PATH_IMAGE396
The arithmetic sharing is as
Figure DEST_PATH_IMAGE397
And
Figure DEST_PATH_IMAGE398
；
from the participant client to the client
Figure DEST_PATH_IMAGE399
Sending to the first auxiliary computing server
Figure 1235DEST_PATH_IMAGE042
(ii) a Will be provided with
Figure DEST_PATH_IMAGE400
Sending to a second auxiliary computing server
Figure DEST_PATH_IMAGE401
；
(6-5) for
Figure DEST_PATH_IMAGE402
First auxiliary computing server
Figure 136550DEST_PATH_IMAGE150
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE403
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE404
Multiple invocation of secure multiplication protocol, computing
Figure DEST_PATH_IMAGE405
；
(6-6) for
Figure DEST_PATH_IMAGE406
First auxiliary computing server
Figure 668288DEST_PATH_IMAGE018
Computing
Figure DEST_PATH_IMAGE407
(ii) a Second auxiliary computing server
Figure DEST_PATH_IMAGE408
Computing
Figure DEST_PATH_IMAGE409
；
(6-7) for
Figure DEST_PATH_IMAGE410
First auxiliary computing server
Figure 577469DEST_PATH_IMAGE297
To be provided with
Figure 23494DEST_PATH_IMAGE157
Invoking
Figure 91944DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure DEST_PATH_IMAGE411
(ii) a Second auxiliary computing server
Figure 417752DEST_PATH_IMAGE372
To be provided with
Figure DEST_PATH_IMAGE412
Invoking
Figure 938863DEST_PATH_IMAGE103
Agreement to get a corresponding Boolean fraction
Figure 188579DEST_PATH_IMAGE107
；
(6-8) for
Figure DEST_PATH_IMAGE413
First auxiliary computing server
Figure 862268DEST_PATH_IMAGE042
To be provided with
Figure DEST_PATH_IMAGE414
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE415
(ii) a Second auxiliary computing server
Figure 827819DEST_PATH_IMAGE234
To be provided with
Figure DEST_PATH_IMAGE416
Calling an arithmetic sharing equivalence test protocol to obtain
Figure DEST_PATH_IMAGE417
；
(6-9) use
Figure DEST_PATH_IMAGE418
To represent
Figure DEST_PATH_IMAGE419
A set of corresponding values for the middle element;
Figure 665587DEST_PATH_IMAGE121
will be provided with
Figure DEST_PATH_IMAGE420
The arithmetic sharing is as
Figure DEST_PATH_IMAGE421
And
Figure DEST_PATH_IMAGE422
sending out
Figure DEST_PATH_IMAGE423
To the first auxiliary computing server
Figure 340500DEST_PATH_IMAGE240
Sending out
Figure DEST_PATH_IMAGE424
To give
Figure DEST_PATH_IMAGE425
；
(6-10) for
Figure 586804DEST_PATH_IMAGE175
First auxiliary computing server
Figure 785573DEST_PATH_IMAGE150
To be provided with
Figure 546856DEST_PATH_IMAGE312
For input, a second auxiliary computing server
Figure 872795DEST_PATH_IMAGE300
To be provided with
Figure 35923DEST_PATH_IMAGE177
For input, both parties invoke a secure multiplication protocol, a first helper computing server
Figure 687484DEST_PATH_IMAGE278
Obtain an output
Figure DEST_PATH_IMAGE426
Second auxiliary computing server
Figure 421216DEST_PATH_IMAGE159
Obtain an output
Figure DEST_PATH_IMAGE427
；
(6-11) for
Figure DEST_PATH_IMAGE428
Of 1 atAn auxiliary computing server
Figure 754109DEST_PATH_IMAGE278
To be provided with
Figure DEST_PATH_IMAGE429
To input, call
Figure DEST_PATH_IMAGE430
Protocol, first auxiliary computing server
Figure DEST_PATH_IMAGE431
Obtain an output
Figure DEST_PATH_IMAGE432
(ii) a Second auxiliary computing server
Figure 115951DEST_PATH_IMAGE159
To be provided with
Figure DEST_PATH_IMAGE433
To input, call
Figure 141676DEST_PATH_IMAGE430
Protocol, second helper computing server
Figure 408709DEST_PATH_IMAGE044
Obtain an output
Figure DEST_PATH_IMAGE434
；
(6-12) first auxiliary computing Server
Figure 528981DEST_PATH_IMAGE370
To be provided with
Figure DEST_PATH_IMAGE435
For input, a second auxiliary computing server
Figure 135543DEST_PATH_IMAGE300
To be provided with
Figure DEST_PATH_IMAGE436
For input, both use to find the maximum value
Figure DEST_PATH_IMAGE437
And minimum value
Figure DEST_PATH_IMAGE438
The Yao's chaotic circuit protocol is respectively obtained
Figure DEST_PATH_IMAGE439
The fraction of yao with the maximum and minimum values of;
(6-13) first helper computing server
Figure 207535DEST_PATH_IMAGE173
And a second auxiliary computing server
Figure DEST_PATH_IMAGE440
Sending the Yao quota to the client of the main participant
Figure DEST_PATH_IMAGE441
，
Figure 633968DEST_PATH_IMAGE184
The main participant client can reconstruct the minimum value
Figure 324975DEST_PATH_IMAGE438
And maximum value
Figure 848360DEST_PATH_IMAGE437
。
8. Privacy protection system in many client intersection data computational process, characterized by includes:
a random assignment module configured to: randomly appointing one participant client as a main participant client, and other participant clients as auxiliary participant clients; setting an additional data set in the main participant client;
an acquisition module configured to: acquiring a calculation demand;
a privacy protection module configured to: according to the calculation requirement, a plurality of participant clients participating in the calculation of the intersection statistical data of the multi-party private index set initiate communication link requests to a main participant client and two auxiliary calculation servers, execute a safety statistical calculation protocol, and finally output the statistical calculation result of the intersection set of the plurality of participant clients corresponding to the calculation requirement by the main participant client;
a feedback module configured to: the main participant client sends the statistical calculation result to the slave participant client;
when the computational requirement is to compute the set of intersections itself, the secure statistical computation protocol implemented includes the steps of:
(1-1) Main participant client
Figure 12625DEST_PATH_IMAGE001
Set its private index
Figure 191934DEST_PATH_IMAGE002
Performing hash of the grains to obtain
Figure 732636DEST_PATH_IMAGE003
One box
Figure 297479DEST_PATH_IMAGE004
；
Figure 898224DEST_PATH_IMAGE005
Representing the total number of bins;
(1-2) slave participant client
Figure 299250DEST_PATH_IMAGE006
Respectively carrying out simple hash on the private index sets to obtain the first
Figure 643644DEST_PATH_IMAGE007
A slave client
Figure 830037DEST_PATH_IMAGE008
One box
Figure 336104DEST_PATH_IMAGE009
Of 1 at
Figure 490005DEST_PATH_IMAGE010
A slave client
Figure 372510DEST_PATH_IMAGE011
One box
Figure 911945DEST_PATH_IMAGE012
The elements in (A) are represented by
Figure 588914DEST_PATH_IMAGE013
Wherein, in the step (A),
Figure 964532DEST_PATH_IMAGE014
，
Figure 650728DEST_PATH_IMAGE015
the size of each box is simply hashed;
(1-3) Main participant client
Figure 546134DEST_PATH_IMAGE016
Will be provided with
Figure 659583DEST_PATH_IMAGE017
Arithmetic sharing as being sent to a first helper computing server
Figure 522497DEST_PATH_IMAGE018
Is an arithmetic portion of
Figure 746805DEST_PATH_IMAGE019
And to be sent to a second auxiliary computing server
Figure 464094DEST_PATH_IMAGE020
Is an arithmetic portion of
Figure 748445DEST_PATH_IMAGE021
Respectively sent to the first auxiliary computing server
Figure 583808DEST_PATH_IMAGE022
And a second auxiliary computing server
Figure 611807DEST_PATH_IMAGE023
；
(1-4) for
Figure 527811DEST_PATH_IMAGE024
From the participant client
Figure 983063DEST_PATH_IMAGE025
Calculating a polynomial:
Figure 273099DEST_PATH_IMAGE026
，
wherein the content of the first and second substances,
Figure 839209DEST_PATH_IMAGE027
representing secondary participant clients
Figure 609719DEST_PATH_IMAGE028
Corresponds to
Figure 235872DEST_PATH_IMAGE029
A polynomial of the data in the individual bins;
Figure 295095DEST_PATH_IMAGE030
the expression of the independent variable is shown,
Figure 664897DEST_PATH_IMAGE031
show that
Figure 701031DEST_PATH_IMAGE032
And
Figure 498085DEST_PATH_IMAGE033
then the difference result is multiplied together,
Figure 841342DEST_PATH_IMAGE034
coefficients representing a polynomial; if and only if handle
Figure 749255DEST_PATH_IMAGE035
When the data is substituted into the polynomial, the value of the polynomial is 0;
will be provided with
Figure 415729DEST_PATH_IMAGE036
The arithmetic sharing is as
Figure 852526DEST_PATH_IMAGE037
And
Figure 168232DEST_PATH_IMAGE038
；
Figure 348678DEST_PATH_IMAGE039
to represent
Figure 151549DEST_PATH_IMAGE040
A constituent set of all coefficients of (a);
dividing the polynomial coefficient fraction
Figure 8515DEST_PATH_IMAGE041
Sending to the first auxiliary computing server
Figure 326364DEST_PATH_IMAGE042
(ii) a Dividing the polynomial coefficient fraction
Figure 779342DEST_PATH_IMAGE043
Sending to a second auxiliary computing server
Figure 764616DEST_PATH_IMAGE044
；
(1-5) for
Figure 808795DEST_PATH_IMAGE045
First auxiliary computing server
Figure 613940DEST_PATH_IMAGE046
According to the data received in the step (1-3) and the step (1-4), calling a safe multiplication protocol for multiple times, and calculating an arithmetic share
Figure 355762DEST_PATH_IMAGE047
(ii) a The second auxiliary computing server calls the safe multiplication protocol for multiple times according to the data received in the step (1-3) and the step (1-4) to compute the arithmetic share
Figure 133225DEST_PATH_IMAGE048
；
(1-6) for
Figure 613885DEST_PATH_IMAGE049
First auxiliary computing server
Figure 358856DEST_PATH_IMAGE046
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure 950375DEST_PATH_IMAGE050
Second auxiliary computing server
Figure 847923DEST_PATH_IMAGE051
Calculating the sum of the judgment results of the first box of all the slave client sides
Figure 499485DEST_PATH_IMAGE052
；
(1-7) first auxiliary computing Server
Figure 279222DEST_PATH_IMAGE053
And a second auxiliary computing server
Figure 362847DEST_PATH_IMAGE023
Will be provided with
Figure 177219DEST_PATH_IMAGE054
And
Figure 937364DEST_PATH_IMAGE055
send to the Main participant client
Figure 204398DEST_PATH_IMAGE056
；
Main participant client
Figure 590249DEST_PATH_IMAGE057
Computing
Figure 259127DEST_PATH_IMAGE058
，
Figure 190174DEST_PATH_IMAGE059
Is shown if
Figure 944504DEST_PATH_IMAGE060
Then, then
Figure 635510DEST_PATH_IMAGE061
Is an intersection element;
Figure 158895DEST_PATH_IMAGE062
representing the final sought set intersection;
introducing two collusion-free helper computing servers in a protocol
Figure 260844DEST_PATH_IMAGE063
And
Figure 502469DEST_PATH_IMAGE064
the auxiliary computing server has no input; in actual deployment, the auxiliary computing server selects two different public cloud platforms; the collusion means that both parties do not share their private data with each other, thereby protecting the private data.
9. The privacy protection system in the multi-client intersection data computation process of claim 8, wherein the computation requirements include: calculating the intersection set, the size of the intersection set, the sum of the intersection set, the mean of the intersection set, the variance of the intersection set, the maximum of the intersection set and the minimum of the intersection set.
CN202110984789.9A 2021-08-26 2021-08-26 Privacy protection method and system in multi-client intersection data calculation process Active CN113438078B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110984789.9A CN113438078B (en) 2021-08-26 2021-08-26 Privacy protection method and system in multi-client intersection data calculation process

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110984789.9A CN113438078B (en) 2021-08-26 2021-08-26 Privacy protection method and system in multi-client intersection data calculation process

Publications (2)

Publication Number Publication Date
CN113438078A CN113438078A (en) 2021-09-24
CN113438078B true CN113438078B (en) 2021-11-23

Family

ID=77797883

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110984789.9A Active CN113438078B (en) 2021-08-26 2021-08-26 Privacy protection method and system in multi-client intersection data calculation process

Country Status (1)

Country Link
CN (1) CN113438078B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114239074B (en) * 2022-02-25 2022-05-31 蓝象智联(杭州)科技有限公司 Private data hiding intersection method without exposing intermediate result
CN114494803B (en) * 2022-04-18 2022-07-05 山东师范大学 Image data annotation method and system based on security calculation
CN116522402B (en) * 2023-07-04 2023-10-13 深圳前海环融联易信息科技服务有限公司 Customer identification method, device, equipment and medium based on privacy calculation
CN117692144B (en) * 2024-02-04 2024-05-07 确信信息股份有限公司 Privacy protection method and system for multi-party private set operation under threshold condition

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3419211A1 (en) * 2017-06-23 2018-12-26 Flytxt B.V. Privacy preserving computation protocol for data analytics
CN112910631A (en) * 2021-02-08 2021-06-04 上海海洋大学 Efficient privacy set intersection calculation method and system based on assistance of cloud server

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11250159B2 (en) * 2018-11-29 2022-02-15 International Business Machines Corporation Secure data monitoring utilizing secure private set intersection
CN110719159B (en) * 2019-09-24 2023-06-30 河南师范大学 Multi-party privacy set intersection method for resisting malicious adversaries
CN112906030B (en) * 2021-03-09 2023-05-16 浙江万里学院 Data sharing method and system based on multi-party homomorphic encryption

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3419211A1 (en) * 2017-06-23 2018-12-26 Flytxt B.V. Privacy preserving computation protocol for data analytics
CN112910631A (en) * 2021-02-08 2021-06-04 上海海洋大学 Efficient privacy set intersection calculation method and system based on assistance of cloud server

Also Published As

Publication number Publication date
CN113438078A (en) 2021-09-24

Similar Documents

Publication Publication Date Title
CN113438078B (en) Privacy protection method and system in multi-client intersection data calculation process
CN111512589B (en) Method for fast secure multiparty inner product with SPDZ
CN111133719B (en) Method for faster secure multiparty inner product computation with SPDZ
CN111064579A (en) Block chain-based secure multi-party computing method, system and storage medium
CN112737772B (en) Security statistical method, terminal device and system for private set intersection data
CN114175028B (en) Cryptographic pseudonym mapping method, computer system, computer program and computer-readable medium
CN113420335B (en) Block chain-based federal learning system
CN115688185B (en) Multiparty privacy summation method, multiparty privacy summation device, electronic equipment and storage medium
CN113922957B (en) Virtual cloud wallet system based on privacy protection calculation
CN113472513B (en) Parallel secure multiparty computing method based on block chain
CN114650134A (en) Longitudinal privacy protection logistic regression method based on secret sharing
CN108881449A (en) A kind of anonymous call method and system of block chain
CN114580012A (en) Federal grouping statistic calculation method based on privacy security intersection and secret sharing
CN105024821B (en) Voidable Identity based encryption method on lattice
CN112685793A (en) Data processing method, device and system based on block chain
US20220415455A1 (en) Systems and methods for virtual clinical trials
CN112865980A (en) Block chain encryption voting method, computer device and storage medium
CN106301791B (en) A kind of realization method and system of the unifying user authentication authorization based on big data platform
Cha et al. A blockchain-based privacy preserving ticketing service
JP4305049B2 (en) Secret sharing method, secret sharing system, and distributed computing device
CN117614618A (en) Cross-domain multi-authority collaborative attribute-based encryption access control method
CN112615838A (en) Extensible block chain cross-chain communication method
CN117134945A (en) Data processing method, system, device, computer equipment and storage medium
Feng et al. A new public remote integrity checking scheme with user and data privacy
CN116992480A (en) Method for providing publicly verifiable outsourcing computing service

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
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220402

Address after: 250102 floor 17, building 4, future entrepreneurship Plaza, north section of Gangxing Third Road, Jinan area, China (Shandong) pilot Free Trade Zone, Jinan City, Shandong Province

Patentee after: Confident Information Co.,Ltd.

Address before: 250014 No. 88, Wenhua East Road, Lixia District, Shandong, Ji'nan

Patentee before: SHANDONG NORMAL University