SecureCrossClientEdgeDiscovery<T>
Models & Types · AiDotNet.FederatedLearning.Graph
PSI-based secure discovery of cross-client edges without revealing full adjacency lists.
Inheritance: FederatedLearningComponentBase<T> → SecureCrossClientEdgeDiscovery<T>
Implements: ICrossClientEdgeHandler<T>
For Beginners
When a graph is split across clients, some edges connect nodes on different clients. To discover these edges privately, we use a technique from Private Set Intersection (PSI): each client hashes their border node IDs, and we compare hashes to find matches. Only matching (shared) node IDs are revealed — each client’s non-shared nodes stay private.
How It Works
Protocol:
Privacy: Uses the Diffie-Hellman PSI approach from #538 when available. Falls back to hash-based comparison with randomized response for differential privacy.
Constructors
| Constructor | Summary |
|---|---|
SecureCrossClientEdgeDiscovery(double privacyEpsilon, int maxEdgesPerPair, bool cacheEnabled) |
Initializes a new instance of SecureCrossClientEdgeDiscovery. |
Properties
| Property | Summary |
|---|---|
int DiscoveredEdgeCount { get; } |
Methods
| Method | Summary |
|---|---|
IReadOnlyList<ValueTuple<int, int>> DiscoverEdges(IReadOnlyList<int> clientABorderNodes, IReadOnlyList<int> clientBBorderNodes) |
|
IReadOnlyList<ValueTuple<int, int>> GetEdges(int clientA, int clientB) |
|
void CacheEdges(int clientA, int clientB, IReadOnlyList<ValueTuple<int, int>> edges) |