Document Open Access Logo

Information-Theoretic Single-Server PIR in the Shuffle Model

Authors Yuval Ishai, Mahimna Kelkar, Daniel Lee, Yiping Ma

PDF
Thumbnail PDF

File

LIPIcs.ITC.2024.6.pdf
  • Filesize: 0.81 MB
  • 23 pages

Document Identifiers

Author Details

Yuval Ishai
  • Technion, Haifa, Israel
Mahimna Kelkar
  • Cornell University, New York, NY, USA
Daniel Lee
  • MIT, Cambridge, MA, USA
Yiping Ma
  • University of Pennsylvania, Philadelphia, PA, USA

Funding

This research was supported by a Google faculty grant. Yuval Ishai was additionally supported by ERC Project NTSC (742754), BSF grants 2018393 and 2022370, ISF grant 2774/20, and ISF-NSFC grant 3127/23. Mahimna Kelkar and Yiping Ma were partially supported by a Technion research scholarship. Yiping Ma was also supported by a Microsoft Research PhD Fellowship.

Cite As Get BibTex

Yuval Ishai, Mahimna Kelkar, Daniel Lee, and Yiping Ma. Information-Theoretic Single-Server PIR in the Shuffle Model. In 5th Conference on Information-Theoretic Cryptography (ITC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 304, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ITC.2024.6

Abstract

We revisit the problem of private information retrieval (PIR) in the shuffle model, where queries can be made anonymously by multiple clients. We present the first single-server PIR protocol in this model that has sublinear per-client communication and information-theoretic security. Moreover, following one-time preprocessing on the server side, our protocol only requires sublinear per-client computation. Concretely, for every γ > 0, the protocol has O(n^{γ}) communication and computation costs per (stateless) client, with 1/poly(n) statistical security, assuming that a size-n database is simultaneously accessed by poly(n) clients. This should be contrasted with the recent breakthrough result of Lin, Mook, and Wichs (STOC 2023) on doubly efficient PIR in the standard model, which is (inherently) limited to computational security.

Subject Classification

ACM Subject Classification
  • Security and privacy → Information-theoretic techniques
Keywords
  • Private information retrieval
  • Shuffle model

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Ittai Abraham, Benny Pinkas, and Avishay Yanai. Blinder - scalable, robust anonymous committed broadcast. In CCS, pages 1233-1252, 2020. Google Scholar
  2. Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, and Alon Rosen. Secure computation from one-way noisy communication, or: Anti-correlation via anti-concentration. In CRYPTO, pages 124-154, 2021. Google Scholar
  3. Carlos Aguilar-Melchor, Joris Barrier, Laurent Fousse, and Marc-Olivier Killijian. XPIR: Private information retrieval for everyone. In PETS, 2016. Google Scholar
  4. Kinan Dak Albab, Rawane Issa, Mayank Varia, and Kalman Graffi. Batched differentially private information retrieval. In USENIX Security, pages 3327-3344, 2022. Google Scholar
  5. Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. Communication-computation trade-offs in PIR. In USENIX Security, pages 1811-1828, 2021. Google Scholar
  6. Sebastian Angel, Hao Chen, Kim Laine, and Srinath Setty. PIR with compressed queries and amortized query processing. In IEEE S&P, pages 962-979, 2018. Google Scholar
  7. Borja Balle, James Bell, and Adrià Gascón. Amplification by shuffling without shuffling. In CCS, pages 2292-2305, 2023. Google Scholar
  8. Borja Balle, James Bell, Adria Gascon, and Kobbi Nissim. Private summation in the multi-message shuffle model. In CCS, pages 657-676, 2020. Google Scholar
  9. Amos Beimel, Yuval Ishai, and Eyal Kushilevitz. General constructions for information-theoretic private information retrieval. In Journal of Computer and System Sciences, 2005. Google Scholar
  10. Andrea Bittau, Ulfar Erlingsson, Petros Maniatis, Ilya Mironov, Ananth Raghunathan, David Lie, Mitch Rudominer, Ushasree Kode, Julien Tinnes, and Bernhard Seefeld. PROCHLO: Strong privacy for analytics in the crowd. In SOSP, pages 441-459, 2017. Google Scholar
  11. Elette Boyle, Niv Gilboa, Yuval Ishai, and Victor I. Kolobov. Programmable distributed point functions. In CRYPTO, pages 121-151, 2022. Google Scholar
  12. David L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM (CACM), 1981. Google Scholar
  13. Albert Cheu, Adam D. Smith, Jonathan R. Ullman, David Zeber, and Maxim Zhilyaev. Distributed differential privacy via shuffling. In EUROCRYPT, pages 375-403, 2019. Google Scholar
  14. Albert Cheu and Jonathan R. Ullman. The limits of pan privacy and shuffle privacy for learning and estimation. In STOC, pages 1081-1094, 2021. Google Scholar
  15. Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. In FOCS, pages 41-50, 1995. Google Scholar
  16. Richard Cleve. Limits on the security of coin flips when half the processors are faulty. In STOC, pages 364-369, 1986. Google Scholar
  17. Alex Davidson, Gonçalo Pestana, and Sofía Celi. FrodoPIR: Simple, scalable, single-server private information retrieval. In PETS, 2023. Google Scholar
  18. Roger Dingledine, Nick Mathewson, and Paul Syverson. Tor: The second-generation onion router. In USENIX Security, 2004. Google Scholar
  19. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In PODS, 2003. Google Scholar
  20. Zeev Dvir and Sivakanth Gopi. 2-server pir with sub-polynomial communication. In STOC, 2015. Google Scholar
  21. Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006. Google Scholar
  22. Úlfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Shuang Song, Kunal Talwar, and Abhradeep Thakurta. Encode, shuffle, analyze privacy revisited: Formalizations and empirical evaluation. CoRR, abs/2001.03618, 2020. URL: https://arxiv.org/abs/2001.03618.
  23. Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, and Ameya Velingker. Private aggregation from fewer anonymous messages. In EUROCRYPT, 2020. Google Scholar
  24. Dov Gordon and Jonathan Katz. Partial fairness in secure two-party computation. In EUROCRYPT, 2010. Google Scholar
  25. Paul Grubbs, Marie-Sarah Lacharité, Brice Minaud, and Kenneth G Paterson. Learning to reconstruct: Statistical learning theory and encrypted database attacks. In IEEE S&P, 2019. Google Scholar
  26. Trinabh Gupta, Natacha Crooks, Whitney Mulhern, Srinath Setty, Lorenzo Alvisi, and Michael Walfish. Scalable and private media consumption with Popcorn. In NSDI, 2016. Google Scholar
  27. Daniel Günther, Maurice Heymann, Benny Pinkas, and Thomas Schneider. Gpu-accelerated pir with client-independent preprocessing for large-scale applications. In USENIX Security, 2022. Google Scholar
  28. Ryan Henry. Polynomial batch codes for efficient IT-PIR. In PETS, 2016. Google Scholar
  29. Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, and Vinod Vaikuntanathan. One server for the price of two: Simple and fast single-server private information retrieval. In USENIX Security, 2023. Google Scholar
  30. Kyle Hogan, Sacha Servan-Schreiber, Zachary Newman, Ben Weintraub, Cristina Nita-Rotaru, and Srinivas Devadas. Shortor: Improving tor network latency via multi-hop overlay routing. In IEEE S&P, 2022. Google Scholar
  31. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Batch codes and their applications. In STOC, 2004. Google Scholar
  32. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Cryptography from anonymity. In FOCS, 2006. Google Scholar
  33. Mitsuru Ito, Akira Saito, and Takao Nishizeki. Secret sharing schemes realizing general access structure. In IEEE Global Telecommunication Conference, 1987. Google Scholar
  34. Georgios Kellaris, George Kollios, Kobbi Nissim, and Adam O’Neill. Generic attacks on secure outsourced databases. In CCS, 2016. Google Scholar
  35. Dogan Kesdogan, Jan Egner, and Roland Büschkes. Stop-and-go-mixes providing probabilistic anonymity in an open system. In Information Hiding, 1998. Google Scholar
  36. Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In FOCS, 1997. Google Scholar
  37. Donghang Lu, Thomas Yurek, Samarth Kulshreshtha, Rahul Govind, Aniket Kate, and Andrew K. Miller. Honeybadgermpc and asynchromix: Practical asynchronous MPC and its application to anonymous communication. In CCS, pages 887-903, 2019. Google Scholar
  38. Samir Jordan Menon and David J. Wu. Spiral: Fast, high-rate single-server pir via fhe composition. In IEEE S&P, 2022. Google Scholar
  39. Tal Moran, Moni Naor, and Gil Segev. An optimally fair coin toss. In TCC, 2009. Google Scholar
  40. Raphael R. Toledo, George Danezis, and Ian Goldberg. Lower-cost ε-private information retrieval. In PETS, 2016. Google Scholar
  41. Jelle van den Hoof, David Lazar, Matei Zaharia, and Nickolai Zeldovich. Vuvuzela: Scalable private messaging resistant to traffic analysis. In SOSP, 2015. Google Scholar
  42. Yupeng Zhang, Jonathan Katz, and Charalampos Papamanthou. All your queries are belong to us: The power of file-injection attacks on searchable encryption. In USENIX Security, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact