Oblivious RAM with Worst-Case Logarithmic Overhead.
Gilad AsharovIlan KomargodskiWei-Kai LinElaine ShiPublished in: IACR Cryptol. ePrint Arch. (2021)
Keyphrases
- worst case
- upper bound
- average case
- np hard
- greedy algorithm
- lower bound
- approximation algorithms
- error bounds
- worst case analysis
- memory access
- sample size
- running times
- main memory
- computational complexity
- search engine
- low overhead
- complexity bounds
- data sets
- random access memory
- constant factor
- design considerations
- multi class
- database systems
- artificial intelligence