A Simpler Rate-Optimal CPIR Protocol
By Helger Lipmaa, Kateryna Pavlyk. 2017
26 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
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
- Shai Halevi
- Kim Laine
- Hao Chen
- Srinath T. V. Setty
- Craig Gentry
- Mariana Raykova
- Sarvar Patel
- Tancrède Lepoint
In Computational Theory and Mathematics
- Shai Halevi
- Hao Chen
- Kim Laine
- Mariana Raykova
- Sarvar Patel
- Srinath T. V. Setty
- Tancrède Lepoint
- Brent Waters
Citations in the corpus
- PIR with Compressed Queries and Amortized Query Processing (2018, methodology): “On the other hand, CPIR protocols [4, 19, 22, 35, 40, 52, 53, 56, 57, 76] can be used with a database controlled by a single administrative domain (e.”
- Communication-Computation Trade-offs in PIR (2019, methodology): “SealPIR requires only slightly more computation than XPIR but uses almost 1000 times less communication than XPIR (but does not achieve the almost optimal rate of the works [43, 49]).”
- Compressible FHE with Applications to PIR (2019, methodology): “As noted in [KLL + 15,AMBFK16,LP17], maximizing the rate is crucial for modern applications of PIR, because individual files may be so huge – think streaming a gigabit movie file from among thousands of movies.”