Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding

Maxime Bombar, Geoffroy Couteau, Alain Couvreur +1

Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle $\text{et al.}$…