In Garbled Circuits, two parties agree on a Boolean circuit that they want to evaluate, where both parties have partial, disjoint inputs to the circuit, and neither party is willing to disclose to the other party anything but the output. In this talk, Professor Ostrovsky will survey the state of the art for garbling schemes, including computing with Garbled Random Access Memory, as well as more recent progress. He will also discuss Garbled Circuits in the malicious setting, where parties try to deviate arbitrarily from the prescribed protocol execution to gain additional information. The talk will be self-contained and accessible to the general audience.