In offline-online multi-party computation protocols, the offline phase often involves setting up of input-independent random variables and the online phase involves a fast computation of the function once the inputs arrive. Unfortunately, the offline phase can be slow and can involve a lot of communication between parties. Pseudo-random correlation generators (PCGs) partially solve this problem by letting the parties communicate small correlated seeds and then letting them expand them locally to generate long correlated strings for the online phase. In this talk, we will see the construction of a PCG by Boyle, Couteau, Gilboa, Ishai, Kohl and Scholl, CRYPTO-2019.
