A geometric approach to information-theoretic private information retrieval
By David P. Woodruff, Sergey Yekhanin. 2005
129 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Martin Jaggi
- Peter Kairouz
- Qiang Yang
- Jakub Konecný
- Peter Richtárik
- Ananda Theertha Suresh
- Jianyu Wang
- Sebastian U. Stich
In Computational Theory and Mathematics
- Amit Sahai
- Brent Waters
- Mariana Raykova
- Salim el Rouayheb
- Adrià Gascón
- Srinath T. V. Setty
- Ran Canetti
- Rafail M. Ostrovsky
In Information Systems
- Amit Sahai
- Florian Tramèr
- Prateek Mittal
- Rafail M. Ostrovsky
- Amos Beimel
- Ran Canetti
- Daniel Wichs
- Rafael G. L. D'Oliveira
Citations in the corpus
- Advances and Open Problems in Federated Learning (2019, background): “Further work has explored the connection between PIR and secret sharing in the past [410] with recent connections to PIR on coded data [139] and communication efficient PIR [66] having been established.”
- Staircase-PIR: Universally Robust Private Information Retrieval (2018, background): “The early body of work measured the communication cost by the amount of information uploaded (queries) and downloaded (responses) by the user [13]–[16].”
- Private Anonymous Data Access (2019, methodology): “Our construction relies on Locally Decodable Codes (LDCs) [KT00], which have previously been used to construct multi-server PIR [CGKS95,WY05].”
- Theory of Cryptography (2014, methodology): “After these works a long line of research has focussed on constructing primitives resilient to leakage including public-key encryption and signatures [3,64,26,4,5,57,47,15,25,24,49,14,50], devices [30,2], and very recently interactive protocols [33,12].”
- Robust Information-Theoretic Private Information Retrieval (2002, methodology): “Using their approach, they obtain several improvements over previous protocols in the dependency in k. Their results are already surveyed in Section 1.1; our results do not rely on the results of [ 65 ].”