The simulation shows a small boolean circuit being garbled gate by gate, with truth tables encrypted and shuffled, followed by an evaluator decrypting exactly one row per gate to compute a result while every intermediate wire value stays hidden.
Pick input bits for each party, click through garbling to see randomized ciphertexts appear on every gate, then step through evaluation to watch labels propagate until the final output is decoded.
Input bit selectors, step-through buttons for garbling and evaluation, and toggles for optimization techniques like free-XOR.
The free-XOR optimization lets XOR gates be evaluated with zero encryption and zero communication, so real-world garbled circuits are often designed to push as much logic as possible into XOR gates and minimize the number of AND gates.
The simulation shows a small boolean circuit being garbled gate by gate, with truth tables encrypted and shuffled, followed by an evaluator decrypting exactly one row per gate to compute a result while every intermediate wire value stays hidden.
The simulation shows a small boolean circuit being garbled gate by gate, with truth tables encrypted and shuffled, followed by an evaluator decrypting exactly one row per gate to compute a result while every intermediate wire value stays hidden.
Pick input bits for each party, click through garbling to see randomized ciphertexts appear on every gate, then step through evaluation to watch labels propagate until the final output is decoded.
The free-XOR optimization lets XOR gates be evaluated with zero encryption and zero communication, so real-world garbled circuits are often designed to push as much logic as possible into XOR gates and minimize the number of AND gates.