From OT to OLE with Subquadratic Communication
Jack Doerner, Iftach Haitner, Yuval Ishai, Nikolaos Makriyannis
Abstract
Oblivious Linear Evaluation (OLE) is an algebraic generalization of oblivious transfer (OT) that forms a critical part of a growing number of applications. An OLE protocol over a modulus q enables the receiver party to securely evaluate a line a⋅ X+b chosen by the sender party on a secret point x∈ ℤq. Motivated by the big efficiency gap between OLE and OT and by fast OT extension techniques, we revisit the question of reducing OLE to OT, aiming to improve the communication cost of known reductions.
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 9bd76d9e-c996-4e7f-9ece-15bef775522eCited by top-tier papers1
Ask how each one uses itBuilds on29
- GAZELLE: A Low Latency Framework for Secure Neural Network InferenceChiraag Juvekar, Vinod Vaikuntanathan, Anantha P. ChandrakasanUSENIX Security 2018 · 1,075 citations
- MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious TransferMarcel Keller, Emmanuela Orsini, Peter SchollCCS 2016 · 487 citations
- Fast Multiparty Threshold ECDSA with Fast Trustless SetupRosario Gennaro, Steven GoldfederCCS 2018 · 264 citations
- Compressing Vector OLEElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval IshaiCCS 2018 · 220 citations
- Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency CustodyYehuda Lindell, Ariel NofCCS 2018 · 220 citations
Related papers
- Gold OPRF: Post-Quantum Oblivious Power-Residue PRFYibin Yang, Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk et al.S&P 2025
- TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function EvaluationNico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges et al.CCS 2017 · 47 citations
- High-throughput Verifiable Distributed OPRF from Gold PRFNan Cheng, Yohei Watanabe, Yugo Kasashima, Ioannis Katis et al.CCS 2026
- Honest Majority MPC with Õ(|C|) Communication in MinicryptYifan Song, Xiaxi YeEUROCRYPT 2025 · 2 citations
- The 2Hash OPRF Framework and Efficient Post-quantum InstantiationsWard Beullens, Lucas Dodgson, Sebastian H. Faller, Julia HesseEUROCRYPT 2025 · 14 citations
