Post-quantum Public-Key Pseudorandom Correlation Functions for OT
Shweta Agrawal, Kaartik Bhushan, Geoffroy Couteau, Mahshid Riahinia
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper23
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 被引用 487 次
- Efficient Two-Round OT Extension and Silent Non-Interactive Secure ComputationElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CCS 2019 · 被引用 238 次
- Compressing Vector OLEElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval IshaiCCS 2018 · 被引用 220 次
- Efficient Pseudorandom Correlation Generators from Ring-LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CRYPTO 2020 · 被引用 113 次
- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC CodesGeoffroy Couteau, Peter Rindal, Srinivasan RaghuramanCRYPTO 2021 · 被引用 99 次
相关 Paper
- Fast Public-Key Silent OT and More from Constrained Naor-ReingoldDung Bui, Geoffroy Couteau, Pierre Meyer, Alain Passelègue 等EUROCRYPT 2024 · 被引用 22 次
- The 2Hash OPRF Framework and Efficient Post-quantum InstantiationsWard Beullens, Lucas Dodgson, Sebastian H. Faller, Julia HesseEUROCRYPT 2025 · 被引用 14 次
- Efficient Pseudorandom Correlation Generators for Any Finite FieldZhe Li, Chaoping Xing, Yizhou Yao, Chen YuanEUROCRYPT 2025 · 被引用 15 次
- 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 等EUROCRYPT 2025 · 被引用 9 次
