One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries

42 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, background): “[45, 46] and RAID-PIR [31] extend specific PIR protocols.”
XPIR : Private Information Retrieval for Everyone (2016, methodology): “Second, the NTT and Ring-LWE based private information retrieval scheme and implementation we describe in this paper offer multi-gigabit processing through-put on a commodity CPU, and an optimizer to automatically setup the system for a given setup (hardware/network/application/security).”
Polynomial Batch Codes for Efficient IT-PIR (2016, methodology): “The new techniques exploit the connection between ramp secret sharing schemes and efficient information-theoretically secure PIR (IT-PIR) protocols.”
Sublinear Scaling for Multi-Client Private Information Retrieval (2015, methodology): “Goldberg’s PIR scheme is most efficient when the number of blocks equals the number of field elements per block [11].”