Sublinear Scaling for Multi-Client Private Information Retrieval

85 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

PIR with Compressed Queries and Amortized Query Processing (2018, methodology): “This approach is further studied by Lueks and Goldberg [62] in the context of Goldberg’s IT-PIR scheme [46].”
Polynomial Batch Codes for Efficient IT-PIR (2016, background): “For u > 1, each u -ary bucket is an element of F ⌈r/u⌉ ×s and is therefore a factor u smaller than the 1-ary (i.e., unencoded) database, which itself resides in Fr ×s .”
This Paper Is Included in the Proceedings of the 12th Usenix Symposium on Operating Systems Design and Implementation (osdi '16). Unobservable Communication over Fully Untrusted Infrastructure Unobservable Communication over Fully Untrusted Infrastructure (unknown): “Pung then introduces a private multi-retrieval scheme that departs from most prior approaches (e.g., [18] [64] [67] [86]) in two ways.”
Scalable and Private Media Consumption with Popcorn (2016, background): “Goldberg's ITPIR protocol [48] has a similar protection property as [45], but it uses fewer servers.”