Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

ePrint Report: Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros

Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle $\textit{et al.}$ (CCS 2018, Crypto 2019) showed how pseudorandom correlation generators (PCG) can be used to generate large amounts of useful forms of correlated (pseudo)randomness, using minimal interactions followed solely by local computations, yielding silent secure two-party computation protocols …

benefits computation correlation crypto decoding eprint report fast non paradigm protocols randomness report secure computation