Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes
Geoffroy Couteau, Peter Rindal, Srinivasan Raghuraman
摘要
We put forth new protocols for oblivious transfer extension and vector OLE, called Silver, for SILent Vole and oblivious transfER. Silver offers extremely high performances: generating 10 million random OTs on one core of a standard laptop requires only 300ms of computation and 122KB of communication. This represents 37% less computation and ∼ 1300× less communication than the standard IKNP protocol, as well as ∼ 4× less computation and ∼ 14× less communication than the recent protocol of Yang et al. (CCS 2020). Silver is silent: after a one-time cheap interaction, two parties can store small seeds, from which they can later locally generate a large number of OTs while remaining offline. Neither IKNP nor Yang et al. enjoys this feature; compared to the best known silent OT extension protocol of Boyle et al. (CCS 2019), upon which we build up, Silver has 19× less computation, and the same communication.
Due to its attractive efficiency features, Silver yields major efficiency improvements in numerous MPC protocols. Our approach is a radical departure from the standard paradigm for building MPC protocols, in that we do not attempt to base our constructions on a well-studied assumption. Rather, we follow an approach closer in spirit to the standard paradigm in the design of symmetric primitives: we identify a set of fundamental structural properties that allow us to withstand all known attacks, and put forth a candidate design, guided by our analysis. We also rely on extensive experimentations to analyze our candidate and experimentally validate their properties. In essence, our approach boils down to constructing new families of linear codes with (plausibly) high minimum distance and extremely low encoding time. While further analysis is of course welcomed in order to gain total confidence in the security of Silver, we hope and believe that initiating this approach to the design of MPC primitives will pave the way to new secure primitives with extremely attractive efficiency features.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper27
- Correlated Pseudorandomness from Expand-Accumulate CodesElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CRYPTO 2022 · 被引用 66 次
- SecFloat: Accurate Floating-Point meets Secure 2-Party ComputationDeevashwer Rathee, Anwesh Bhattacharya, Rahul Sharma, Divya Gupta 等S&P 2022 · 被引用 65 次
- SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt ModelLawrence RoyCRYPTO 2022 · 被引用 54 次
- Structure-Aware Private Set Intersection, with Applications to Fuzzy MatchingGayathri Garimella, Mike Rosulek, Jaspal SinghCRYPTO 2022 · 被引用 34 次
- Improving Line-Point Zero Knowledge: Two Multiplications for the Price of OneSamuel Dittmer, Yuval Ishai, Steve Lu, Rafail OstrovskyCCS 2022 · 被引用 30 次
它引用的顶会 Paper10
- Efficient Batched Oblivious PRF with Applications to Private Set IntersectionVladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni TrieuCCS 2016 · 被引用 429 次
- 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 次
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 被引用 205 次
- PSI from PaXoS: Fast, Malicious Private Set IntersectionBenny Pinkas, Mike Rosulek, Ni Trieu, Avishay YanaiEUROCRYPT 2020 · 被引用 198 次
相关 Paper
- Ferret: Fast Extension for Correlated OT with Small CommunicationKang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang 等CCS 2020 · 被引用 5 次
- Expand-Convolute Codes for Pseudorandom Correlation Generators from LPNSrinivasan Raghuraman, Peter Rindal, Titouan TanguyCRYPTO 2023 · 被引用 50 次
- Fast Actively Secure OT Extension for Short SecretsArpita Patra, Pratik Sarkar, Ajith SureshNDSS 2017 · 被引用 23 次
- Honest Majority MPC with Õ(|C|) Communication in MinicryptYifan Song, Xiaxi YeEUROCRYPT 2025 · 被引用 2 次
- Efficient Pseudorandom Correlation Generators from Ring-LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai 等CRYPTO 2020 · 被引用 113 次
