Garbled Circuits: Basic Scheme and Applications
Too Long; Didn't Read
Garbled circuits are the simplest form of general-purpose "multi-party computation" (MPC) to wrap your head around. The scheme involves encrypting a circuit (meaning, a set of AND, OR... gates) which evaluates the function `f, which takes inputs from both parties. Also, Garbled circuits are potentially useful for many more things than just 2-of-2 computation. In this, we take example of two parties, Alice and Bob, who want to compute some function f(alice_inputs, bob_inputs), which takes inputs from both parties. Alice and Bob want to both learn the result of computing f, but Alice does not want Bob to learn her inputs, and Bob does not want Alice to learn his inputs.