featuring Alice, Bob, and Eve
Caesar cipher
These Romans are crazy! (plaintext)
Qebpb Oljxkp xob zoxwv! (ciphertext)
PK
Caveat: If Eve figures out the public key, communication is compromised!
PK
Rivest-Shamir-Adleson (RSA)
MIT, 1978
SK
ὁμός (homo's) = "same" (watch the accent!)
+ μορφή (morphe') = "form", "shape"
f(x∗y)=f(x)∗f(y)
enc(⋅)
dec(⋅)
f(⋅)
"bored Yann Lecun"
1. Convolution = addition and multiplication
3. Non-linearity (ReLU, tanh)
Polynomial approximation:
ReLU(x)≈∑I=1NciPi(x) Slow for degree > 2
2. Max-pooling replaced by average pooling
4. Other operations?
Paillier encryption
Split into linear and non-linear components and distribute computations to non-colluding parties.
No approximation of ReLUs.
Privacy-preserving backpropagation.
enc(x1)
enc(x2)
enc(x3)
x1
x2
x3
w∗enc(x1)
ReLU(dec(w∗enc(x3))
w∗enc(x2)
w∗enc(x3)
ReLU(dec(w∗enc(x2))
ReLU(dec(w∗enc(x1))
Scheme | Communication | Crypto | Activation | Total |
---|---|---|---|---|
Square | 0 | 0 | 90.6 | 90.6 |
5-th order | 0 | 0 | 1619.6 | 1619.6 |
GELU-Net | 5 | 3.7 | 0.2 | 8.9 |
Computation time of activation (ms)
Architecture | Time (s) | Accuracy |
---|---|---|
GELU-Net | 126.7 (15ms/image) | 0.989 |
CryptoNets | 3009.6 (367ms/image) | 0.967 |
Computation time for LeNet on MNIST (8192 image batch)
Better encryption schemes.
Improve performance for single (non-batched) inputs.
Exploit advances on binary neural networks (BNNs) [1].
Optimize privacy-preserving training.