Multi-Party Computation

Cryptographic technique allowing multiple parties compute a function together jointly, without revealing individual inputs. It is used in privacy-preserving applications, private transactions, and secure key management.

Secret Sharing

🔹 Concept: A private input is split into multiple “shares” and distributed among participants. No single participant has full knowledge of the input.

🔹 Case: Shamir’s Secret Sharing splits a secret (e.g., a private key) into multiple parts, requiring a threshold (e.g., 3 out of 5 shares) to reconstruct it.

Garbled Circuits

🔹 Concept: A technique where a function is represented as an encrypted circuit. One party generates a "garbled" version of the circuit, and another evaluates it without knowing the original inputs.

Oblivious Transfer (OT)

🔹 Concept: A protocol where a sender has multiple pieces of data, and a receiver chooses one to receive, but the sender doesn’t know which one was chosen.

🔹 Case: A password manager allowing a user to retrieve a specific password without revealing all stored passwords.

Secure Function Evaluation (SFE)

🔹 Concept: The system allows parties to jointly compute a function over their inputs, without revealing those inputs to each other.