DiffieHellmanPsi
Models & Types · AiDotNet.FederatedLearning.PSI
Implements Diffie-Hellman based Private Set Intersection using commutative encryption.
Inheritance: PsiBase → DiffieHellmanPsi
For Beginners
Think of this like two people mixing paint colors:
How It Works
This protocol exploits the commutative property of exponentiation in a prime-order group: H(x)^(a*b) = (H(x)^a)^b = (H(x)^b)^a. Both parties hash their elements, raise to their secret exponents, exchange and re-exponentiate, then compare the doubly-encrypted values.
Complexity: O(n+m) computation, O(n+m) communication where n and m are set sizes.
Security: Secure against semi-honest adversaries under the Decisional Diffie-Hellman assumption.
Reference: Meadows, “A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party”, IEEE S&P 1986.
Constructors
| Constructor | Summary |
|---|---|
DiffieHellmanPsi() |
Properties
| Property | Summary |
|---|---|
string ProtocolName { get; } |