Abstract
Multi-Server Private Information Retrieval (PIR) is a cryptographic protocol that allows a client to securely query a database entry from n = 2 servers of which less than t can collude, s.t. the servers learn no information about the query. Highly efficient PIR could be used for large-scale applications like Compromised Credential Checking (C3) (USENIX Security'19), which allows users to check whether their credentials have been leaked in a data breach. However, state-of-the art PIR schemes are not efficient enough for fast online responses at this scale. In this work, we introduce Client-Independent Preprocessing (CIP) PIR that moves (t - 1)/n of the online computation to a local, client independent, preprocessing phase suitable for efficient batch precomputations. The online performance of CIP-PIR improves linearly with the number of servers n. We show that large-scale applications like C3 with PIR are practical by implementing our CIP-PIR scheme using a parallelized CPU implementation. To the best of our knowledge, this is the first multi-server PIR scheme whose preprocessing phase is completely independent of the client, and where online performance simultaneously improves with the number of servers n. In addition, we accelerate for the first time the huge amount of XOR operations in multi-server PIR with GPUs. Our GPU-based CIP-PIR achieves an improvement up to factor 2.1× over our CPU-based implementation for n = 2 servers, and enables a client to query an entry in a 25 GB database within less than 1 second.
Original language | English |
---|---|
Title of host publication | Proceedings of the 31st USENIX Security Symposium, Security 2022 |
Publisher | USENIX Association |
Pages | 1759-1776 |
Number of pages | 18 |
ISBN (Electronic) | 9781939133311 |
State | Published - 2022 |
Event | 31st USENIX Security Symposium, Security 2022 - Boston, United States Duration: 10 Aug 2022 → 12 Aug 2022 |
Publication series
Name | Proceedings of the 31st USENIX Security Symposium, Security 2022 |
---|
Conference
Conference | 31st USENIX Security Symposium, Security 2022 |
---|---|
Country/Territory | United States |
City | Boston |
Period | 10/08/22 → 12/08/22 |
Bibliographical note
Publisher Copyright:© USENIX Security Symposium, Security 2022.All rights reserved.
Funding
We thank our shepherd Marina Blanton and the anonymous USENIX Security'22 reviewers for helping us to improve our paper. This project received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement No. 850990 PSOTI). It was co-funded by the Deutsche Forschungsgemeinschaft (DFG) - SFB 1119 CROSSING/236615297 and GRK 2050 Privacy & Trust/251805230, and by the German Federal Ministry of Education and Research and the Hessen State Ministry for Higher Education, Research and the Arts within ATHENE. This work was supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister's Office, and by the Alter Family Foundation. Acknowledgments. We thank our shepherd Marina Blan-ton and the anonymous USENIX Security’22 reviewers for helping us to improve our paper. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 850990 PSOTI). It was co-funded by the Deutsche Forschungsgemeinschaft (DFG) — SFB 1119 CROSSING/236615297 and GRK 2050 Privacy & Trust/251805230, and by the German Federal Ministry of Education and Research and the Hessen State Ministry for Higher Education, Research and the Arts within ATHENE. This work was supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office, and by the Alter Family Foundation.
Funders | Funder number |
---|---|
Boler Family Foundation | |
Horizon 2020 Framework Programme | |
European Commission | |
Deutsche Forschungsgemeinschaft | Trust/251805230, SFB 1119 CROSSING/236615297 |
Bundesministerium für Bildung und Forschung | |
Hessisches Ministerium für Wissenschaft und Kunst | |
Horizon 2020 | 850990 PSOTI |