In this chapter, we provide a step-by-step introduction to the notion of silent secure computation, a recent development in secure computation that aims to significantly mitigate its communication overhead. As the previous chapter made clear, or so we hope, secure computation a la GMW in the preprocessing model is one of the most promising paths toward truly efficient MPC protocols. With the combination of IKNP-style OT extensions and preprocessing of the OTs, it exhibits sufficient performances, from a computational point of view, in many real-world applications (including allowing our two lovebirds, Alice and Bob, to discover whether there is a mutual romantic interest—but also including, say, securely running statistical analyses on the joint private data of the patients of several hospitals to evaluate the efficiency of a new medication without compromising the patient’s privacy). However, its communication overhead—a few hundred bits per AND gate—is prohibitive for most applications, especially in a WAN setting.