Search papers, labs, and topics across Lattice.
2
0
2
4
This paper derives general lower and upper bounds on the PIR capacity for general graphs, under certain privacy requirements, that capture the essence of both LPIR and classical PIR.
Sharing randomness across all servers in a graph-based database system boosts private information retrieval capacity, outperforming schemes where randomness is tied to individual message replicas.
