This module provide some method of PSI(Private Set Intersection)
This mode implements algorithm based on [RSA Intersection]. This work is built on FATE, eggroll and federation API that construct the secure, distributed and parallel infrastructure.
Our Intersection module tries to solve Privacy-Preserving Entity Match problem. This module helps two and more parties to find common entry ids without leaking non-overlapping ids. The process is illustrated below in figure 1.
In figure 1 ,Party A has user id u1,u2,u3,u4, while Party B has u1,u2,u3,u5. After Intersection, party A and party B both learn their common user ids, which are u1,u2,u3, while neither party A nor B could decrypt each other's non-overlapping user ids. Transmission parties' processed id to the other party, like Y-A and Z-B, will not reveal raw ids. Processed Z-B is safe due to the privacy key of party B. Each Y-A includes different random value which binds to each value in X-A and will be safe as well.
Introduced in FATE version 1.6, split_calculation option is available for improved efficiency. Different from unified process described above, split_calculation process first splits hash-processed ids into even and odd groups; each group then runs through the RSA intersection process with either host or guest as the joining role. Note than with split_calculation, host(s) always know about their common even ids with guest since they are responsible for finding common even ids.
With RSA intersection, participants can get their intersection ids securely and efficiently.
This intersection mode implements the simple intersection method in which a participant sends all its ids to another participant, and the other participant finds their common ids. Finally, the joining role will send the intersection ids to the sender.
Both RSA and RAW intersection support multi-host scenario. It means a guest can perform intersection with more than one host simultaneously and get the common ids among all participants.
Refer to figure 2 for a demonstration of one guest running intersection with two hosts; the same process applies to cases with more than two hosts. First, guest will run intersection with each host and get respective overlapping ids. Then, guest will find common IDs from all intersection results. Optionally, guest will send common IDs to every host.
We support repeated id intersection for some applications. In this case, one should provide the mask id to be mapped to repeated ids. For instances, in Guest, your data is
mask_id, id, value alice_1, alice, 2 alice_2, alice, 3 bob, bob, 4
In Host, you data is
id, value alice, 5 bob, 6
After intersection, guest will get the intersection results:
mask_id, value alice_1, 2 alice_2, 3 bob, 4
And in host:
id, value alice_1, 5 alice_2, 5 bob, 4
Set parameter repeated_id_process to true if you wish to use this mapping function for repeated ids.
.. automodule:: federatedml.param.intersect_param :members:
Both RSA and RAW intersection support:
- Multi-host modeling task. The detailed configuration for multi-host modeling task is located here.
- Repeated ID intersection using ID expanding.
- Configurable hashing methods, including sha256, md5, and sm3; hash operators of RSA intersection can be configured separately, please refer here for more details.
RAW intersection supports the following extra feature:
- base64 encoding may be used for all hashing methods.