A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
Iftach HaitnerJonathan J. HochGil SegevPublished in: IACR Cryptol. ePrint Arch. (2007)
Keyphrases
- single server
- lower bound
- retrial queue
- worst case
- upper bound
- special case
- queueing networks
- private information retrieval
- state dependent
- branch and bound algorithm
- objective function
- priority scheduling
- heavy traffic
- parallel machines
- service times
- queue length
- markov chain
- computational complexity
- optimal solution
- queuing model
- neural network