 |
The next one is fastsecagg. FastShare is a novel secret sharing scheme based on a finite domain version of the Fast Fourier Transform that aims to exploit the federation learning setting. Fastsecagg, on the other hand, is precisely a FastShare-based and scalable FL-secure aggregation protocol with low computational and communication costs and strong privacy guarantees. before introducing fastsecagg let's introduce fastshare. The first step of fastshare is Construct the signal: Find two numbers, n0 and n1 such that signal length N = n0n1, and n0 and n1 are mutually prime. Applying the Chinese remainder theorem to establish a two-dimensional mesh of nĄżn. Set four domains Z0, Z1, S, and T. A secret is placed at index S and T is used as privacy proof. Random masks are placed in the other regions; 0 is placed at Z0 and at the index of Z1 such that the sum of each row and column is satisfied to equal 0 (to subsequently recover lost shares). The second step is Generate the secret share: Use the (fast) Fourier transform to generate secret shares. the third step is Recover lost shares: Iteratively recover all lost shares using a linear relationship between shares. Recover the missing share by iteratively decoding the missing share in rows and columns. the fourth step is Inverse Fourier transform: the secret share is inverse Fourier transformed to extract the secret information at the appropriate location to recover the secret. An important feature is Linear characterization. |
IEEE/ICACT20220347 Slide.16
[Big Slide]
[YouTube]