Post-quantum Public-Key Pseudorandom Correlation Functions for OT
Shweta Agrawal, Kaartik Bhushan, Geoffroy Couteau, Mahshid Riahinia
Abstract
Public-key pseudorandom correlation functions (PK-PCF) are an exciting recent primitive introduced to enable "non-interactive key exchange for secure computation". Despite significant advances in the group-based setting, success in the post-quantum regime has been much more limited. To the best of our knowledge, there does not exist even a single efficient candidate post-quantum PK-PCF for the standard string oblivious transfer (OT) correlation.
In this work, we address this gap by constructing the first efficient lattice-based public-key PCF for the string OT correlation. Our PK-PCF generates a few hundred OTs per second, and requires a large but manageable public key size (a few hundred megabytes). In contrast, the only previous lattice-based non-public-key PCF, proposed in the very recent work of Hasler, Reisert and Küsters (Asiacrypt 2025), can generate up to 9 OT/s and has key sizes of several gigabytes.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 49e25b7b-ad63-4fa7-b746-9e3629a4190aBuilds on23
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 487 citations
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai et al.CCS 2019 · 238 citations
- Compressing Vector OLEElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval IshaiCCS 2018 · 220 citations
- Efficient Pseudorandom Correlation Generators from Ring-LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai et al.CRYPTO 2020 · 113 citations
- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC CodesGeoffroy Couteau, Peter Rindal, Srinivasan RaghuramanCRYPTO 2021 · 99 citations
Related papers
- Fast Public-Key Silent OT and More from Constrained Naor-ReingoldDung Bui, Geoffroy Couteau, Pierre Meyer, Alain Passelègue et al.EUROCRYPT 2024 · 22 citations
- The 2Hash OPRF Framework and Efficient Post-quantum InstantiationsWard Beullens, Lucas Dodgson, Sebastian H. Faller, Julia HesseEUROCRYPT 2025 · 14 citations
- Efficient Pseudorandom Correlation Generators for Any Finite FieldZhe Li, Chaoping Xing, Yizhou Yao, Chen YuanEUROCRYPT 2025 · 15 citations
- Pool: A Practical OT-based OPRF from Learning with RoundingAlex Davidson, Amit Deo, Louis Tremblay ThibaultCCS 2025
- Leap: A Fast, Lattice-Based OPRF with Application to Private Set IntersectionLena Heimberger, Daniel Kales, Riccardo Lolato, Omid Mir et al.EUROCRYPT 2025 · 9 citations
