Stanford Security Seminar

Yuval Ishai

Abstract:

Correlated secret randomness is a useful resource for secure multiparty computation and other cryptographic applications. A pseudorandom correlation generator (PCG) enables secure deterministic generation of long sources of correlated randomness from short, correlated seeds. The talk will cover recent constructions of PCGs for simple but useful target correlations under different flavors of the Learning Parity with Noise (LPN) assumption. Such PCGs give practical methods for generating a large number of oblivious transfers and multiplication triples with low communication cost. The talk is based mostly on joint works with Elette Boyle, Geoffroy Couteau, Niv Gilboa, Lisa Kohl, Peter Rindal, and Peter Scholl.

Time and Place