ISecureAggregationPrg
Interfaces · AiDotNet.FederatedLearning.Cryptography
A cryptographic pseudorandom generator (PRG) that expands a short seed into a vector of ring elements, as used by
secure aggregation to turn the pairwise seeds s_{u,v} and the self-mask seed b_u into masks.
Known implementations: AesCtrSecureAggregationPrg
For Beginners
Two clients that share a secret seed can each compute the same long random-looking
vector from it without sending that vector anywhere. One adds it, the other subtracts it, so it cancels in the sum.
The library default is AesCtrSecureAggregationPrg.
How It Works
Bonawitz et al. (2017), “Practical Secure Aggregation for Privacy-Preserving Machine Learning”, section 4: the
masks are PRG(s_{u,v}) and PRG(b_u), vectors in Z_R^m. An implementation must be a secure PRG
(indistinguishable from uniform without the seed) and deterministic: the same seed and bit width must always produce
the same vector, because the server re-expands reconstructed seeds to remove masks.
Methods
| Method | Summary |
|---|---|
void Expand(byte[] seed, int bitWidth, ulong[] destination) |
Fills destination with elements of Z_R, R = 2^bitWidth, expanded from seed. |