✳flâneur — a map of the web's best reading

Explaining Yao's Garbled Circuits - Cronokirby

cronokirby.com · 2 words · saved by 1 readers

Yao’s Garbled Circuits is a Cryptographic scheme that allows two parties with secret inputs to evaluate an arbitrary function on those inputs, without revealing them to each other. As far as I can tell, the protocol was first described orally by Andrew Yao in 1986, but the first written description was in the subsequent How to Play Any Mental Game paper, by Goldreich, Micali, and Wigderson. But, I’m not an academic historian, so take this with a grain of salt, and feel free to correct me on Twitter if you know better. I first heard about this scheme last summer, and like so many things in Cryptography, it seemed quite mysterious to me at the time. And just like so many of those things, it turned out to be a lot simpler than I expected; hopefully this post can impart a bit of that feeling to you as well. Garbled Circuits are a special case of a more general idea called (secure) Multi-Party Computation (MPC). The premise is that you have a group of parties 𝑃 1 , … , 𝑃 𝑛 P 1 ​ ,…,P

Redirecting... Redirecting...

Explore this link on the map →

related reading