Introducing Secure Multi Party Computation (MPC)

In this video, we explain what "secret-sharing" is in a simple, approachable way. We also show how you can add up secret-shared numbers.
Key learnings
1. If you only have 2 out of 3 secret-shares, you learn nothing about the secret number
2. With multiparty computation (MPC) we can add up secret-numbers to find the total, without learning what they are.
3. Actually, you can compute any function on secret-inputs, learning nothing but the answer.

[@cheolhwan-j5p]

Interesting!

[@ouriel]

good job explaining this in a simple and fun way

[@cecilechau7932]

Security, privacy. Is possible to do all kinds of computations without learning all the secret inputs

[@anilgracias]

why isn't this on some magic show? 😅

[@shivaparsarad4356]

How 9+8+1 will be 8!?

[@rabianaeem1333]

thats what I wanna know too. Isn't it 18?

[@rabianaeem1333]

Ooh I get it now they are not talking about the literal addition, they are adding them on biclock, which has only 0-9 numbers on it. 9+1=0 => 0+8=8. :)