Privacy-Preserving Federated Learning Framework with General Aggregation and Multiparty Entity Matching

Table 3

Definition of .

---

’s operation is as follows:
(1) On input (Init, ) from , generate random numbers for the corresponding , store (,…), and send (,…) to corrupted adversary .
(2) On input (Init, ) from CS, generate random numbers .
Once the IDs of the CS and are equal, there sets , .
For corrupted CS, send (,) to it. Store them.
(3) On input (signature, ) from , choose randomly, and compute .
Send them to CS and store ().
(4) On input (Bsignature, ) from CS, compute .
Send to , where are random numbers.
(5) On input (Open, ) from . Check whether there exists ().
If exiting, can be got, or abandon it. Generate random and store ().
(6) On input (Sign, ), compute (). Generate random for every .
If existing , setting and storing (). Send () to the corresponding .
(7) On input (Compare, ), generate the comparison matrix using 1 and random numbers, where there exist in (), 1 will be set, or a random number will be set.

---