Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN

Download PDF
Open Webpage

Sebastian Hasler, Pascal Reisert

Published: 2025, Last Modified: 15 May 2026IACR Cryptol. ePrint Arch. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We construct a pseudorandom correlation function (PCF) for oblivious linear evaluation (OLE) from sparse LPN over any finite field. The programmability property of our PCF implies a PCF for any multiparty degree-two correlation, e.g., Beaver triples. Our PCF is the first PCF for degree-two correlations from a well-established cryptographic assumption, apart from (inefficient) generic PCFs based on homomorphic secret sharing or fully homomorphic encryption. Our PCF outperforms the previously fastest PCF for Beaver triples (Boyle et al., Crypto 2022) by 3.2-28x. We build on the recent pseudorandom correlation generator (PCG) by Miao et al. (Asiacrypt 2025) and extend it to a PCF using a recursive approach similar to Braun et al. (Asiacrypt 2025). Moreover, we extend these techniques to support authenticated degree-two correlations in the important two-party case.