 |
The next talk is about the improved version of secagg, secagg plus. SecAgg+ reduces the computation and communication overhead by replacing the original SecAgg protocol of "one client communicates with the remaining n-1 clients" with "one client communicates with the surrounding log n clients". SecAgg+ also proposes two protocols for semi-honest attackers and malicious attackers. In semi-honest protocol, SecAgg+ builds an undirected graph suitable for the protocol by undirected graph building techniques using the user as the vertex, connecting each user with k = log n bits of other users, and when sharing the user only has to share with the user connected to him. users. k and the secret sharing threshold t are determined by ensuring security and user dropout robustness. In Semi-malicious protocol the overall idea is to first help the individual clients exchange keys, then generate a directed graph (both users are trusted unilaterally with each other), and finally execute the summation algorithm. When exchanging keys each client generates 2 pairs of keys, sends public key 1 and public key 2 to the server, and the server puts the received public key on top of the Merkle tree. |
IEEE/ICACT20220347 Slide.15
[Big Slide]
[YouTube]