High-Throughput Three-Party DPFs with Applications to ORAM and Digital Currencies
Name
3658644.3670292.pdf
Size
1.22 MB
Format
Adobe PDF
Checksum (MD5)
79d1ac1d1f316e4eabaa8a0afdc89ac4
Author(s)
Zyskind, Guy
Yanai, Avishay
Pentland, Alex
Date Issued
December 2, 2024
Publisher
ACM|Proceedings of the 2024 ACM SIGSAC Conference on Computer and Communications Security
Citation
Zyskind, Guy, Yanai, Avishay and Pentland, Alex. 2024. "High-Throughput Three-Party DPFs with Applications to ORAM and Digital Currencies."
Version
Final published version
Abstract
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 216 -240, 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 {216, 218, 220}, 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.
Description
CCS ’24, October 14–18, 2024, Salt Lake City, UT, USA
MIT Department
Program in Media Arts and Sciences (Massachusetts Institute of Technology)
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3658644.3670292
