Step 1. Choose number of parties (n) and hidden parties (k). You won't have access to the information of the hidden parties

2. Enter secrets for visible parties

Each secret s must be an integer with |s| < 55000. Hidden parties (🔒) get random secrets.

Step 3. Additive Secret Sharing

Secure computation protocols require a secret sharing scheme, it's like an "encryption". Each secret is encrypted by having its party generate n random numbers that sum to that secret (mod 2²⁰)

These random numbers are called the "shares" of the secret.

You can see how the shares generated by each party sum up to their secret.

Each party now sends one share to every party, including themselves.

Step 4. Share Exchange

In each column we have the shares that each player received from the others.

These shares are then added together in the next step.

Step 5. Each party adds the received shares

Step 6. Reveal the result

This is also called the reconstruction phase, it's like the "decryption" of the result.

Are you able to guess the secrets of the hidden parties? You can reveal the hidden information, scroll up and check if you were correct!

Try to simulate another experiment to see if you can infer something without the information of the hidden parties.

Contact me if you have questions about secure multi-party computation (MPC) or it's unlimited applications!