Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN

Sebastian Hasler; Pascal Reisert

Paper 2025/2002

Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN

Sebastian Hasler

, University of Stuttgart

Pascal Reisert

, University of Stuttgart

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Pseudorandom Correlation Functions Multiparty Computation Beaver Triples Oblivious Linear Evaluation Sparse LPN
Contact author(s): sebastian hasler @ sec uni-stuttgart de
pascal reisert @ sec uni-stuttgart de
History: 2025-10-30: revised; 2025-10-26: received; See all versions
Short URL: https://ia.cr/2025/2002
License: CC BY

BibTeX

@misc{cryptoeprint:2025/2002,
      author = {Sebastian Hasler and Pascal Reisert},
      title = {Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse {LPN}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/2002},
      year = {2025},
      url = {https://eprint.iacr.org/2025/2002}
}