High-Throughput Three-Party DPFs with Applications to ORAM and Digital Currencies
Guy Zyskind, Avishay Yanai, Alex 'Sandy' Pentland
摘要
Distributed point functions (DPF) are increasingly becoming a foundational tool with applications for application-specific and general secure computation. While two-party DPF constructions are readily available for those applications with satisfiable performance, the three-party ones are left behind in both security and efficiency. In this paper we close this gap and propose the first three-party DPF construction that matches the state-of-the-art two-party DPF on all metrics. Namely, it is secure against a malicious adversary corrupting both the dealer and one out of the three evaluators, its function's shares are of the same size and evaluation takes the same time as in the best two-party DPF. Compared to the state-of-the-art three-party DPF, our construction enjoys 40 -120× smaller function's share size and shorter evaluation time, for function domains of 2 16 -2 40 , respectively. Apart from DPFs as a stand-alone tool, our construction finds immediate applications to private information retrieval (PIR), writing (PIW) and oblivious RAM (ORAM). To further showcase its applicability, we design and implement an ORAM with access policy, an extension to ORAMs where a policy is being checked before accessing the underlying database. The policy we plug-in is the one suitable for account-based digital currencies, and in particular to central bank digital currencies (CBDCs). Our protocol offers the first design and implementation of a large scale privacy-preserving account-based digital currency. While previous works supported anonymity sets of 64-256 clients and less than 10 transactions per second (tps), our protocol supports anonymity sets in the millions, performing 500, 200, 58 tps for anonymity sets of 2 16 , 2 18 , 2 20 , respectively. Toward that application, we introduce a new primitive called updatable DPF, which enables a direct computation of a dot product between a DPF and a vector; we believe that updatable DPF and the new dot-product protocol will find interest in other applications.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper16
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 被引用 404 次
- ZEXE: Enabling Decentralized Private ComputationSean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers 等S&P 2020 · 被引用 257 次
- Scaling ORAM for Secure ComputationJack Doerner, Abhi ShelatCCS 2017 · 被引用 221 次
- Lightweight Techniques for Private Heavy HittersDan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa 等S&P 2021 · 被引用 134 次
- Solidus: Confidential Distributed Ledger Transactions via PVORMEthan Cecchetti, Fan Zhang, Yan Ji, Ahmed E. Kosba 等CCS 2017 · 被引用 128 次
相关 Paper
- Duoram: A Bandwidth-Efficient Distributed ORAM for 2- and 3-Party ComputationAdithya Vadapalli, Ryan Henry, Ian GoldbergUSENIX Security 2023
- Programmable Distributed Point FunctionsElette Boyle, Niv Gilboa, Yuval Ishai, Victor I. KolobovCRYPTO 2022 · 被引用 18 次
- Remise: Authorized Anonymous Communication SystemsRohan Ravi, Paritosh Shukla, Adithya VadapalliUSENIX Security 2026
- Improved Constructions for Distributed Multi-Point FunctionsElette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai 等S&P 2025
- High-throughput Verifiable Distributed OPRF from Gold PRFNan Cheng, Yohei Watanabe, Yugo Kasashima, Ioannis Katis 等CCS 2026
