A tight lower bound for restricted pir protocols.
Richard BeigelLance FortnowWilliam I. GasarchPublished in: Comput. Complex. (2006)
Keyphrases
- lower bound
- upper bound
- private information retrieval
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- optimal solution
- lower and upper bounds
- objective function
- upper and lower bounds
- data sets
- multi party
- database
- lower bounding
- linear programming relaxation
- application level
- communication protocol
- cryptographic protocols
- communication protocols
- computational complexity