Oblivious RAM with Worst-Case Logarithmic Overhead.
Gilad AsharovIlan KomargodskiWei-Kai LinElaine ShiPublished in: CRYPTO (4) (2021)
Keyphrases
- worst case
- average case
- lower bound
- upper bound
- np hard
- memory access
- error bounds
- greedy algorithm
- approximation algorithms
- worst case analysis
- running times
- main memory
- computational complexity
- databases
- complexity bounds
- communication overhead
- bayesian networks
- multi dimensional
- low overhead
- case study
- real time
- worst case scenario