Lower Bounds for (Batch) PIR with Private Preprocessing.
Kevin YeoPublished in: IACR Cryptol. ePrint Arch. (2022)
Keyphrases
- lower bound
- preprocessing
- online algorithms
- private information retrieval
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- batch mode
- post processing
- vc dimension
- privacy preserving
- quadratic assignment problem
- np hard
- preprocessing step
- feature extraction
- upper and lower bounds
- lower and upper bounds
- optimal solution
- online learning
- optimal cost
- lower bounding
- private data
- worst case
- cryptographic protocols
- public private
- peer to peer
- preprocessing phase
- preprocessing steps
- digital libraries
- max sat
- linear programming
- batch processing
- preprocessing stage
- sample complexity
- learning algorithm