Abstract: Correlated secret randomness is a useful resource for threshold cryptography and secure multiparty computation. A pseudorandom correlation generator (PCG) enables secure deterministic generation of long sources of correlated randomness from short, correlated seeds. The talk will cover the definition of a PCG, constructions of multiparty PCGs for linear correlations using symmetric cryptography (also known as “pseudorandom secret sharing”), and a recent line of work on PCGs for useful nonlinear correlations from different flavors of the Learning Parity with Noise (LPN) assumption. The latter includes practical methods for “silent” OT extension that use much less communication than alternative OT extension techniques.