Oblivious RAM with Worst-Case Logarithmic Overhead.
Gilad AsharovIlan KomargodskiWei-Kai LinElaine ShiPublished in: J. Cryptol. (2023)
Keyphrases
- worst case
- lower bound
- error bounds
- upper bound
- average case
- greedy algorithm
- np hard
- approximation algorithms
- computational complexity
- memory access
- running times
- low overhead
- design considerations
- random access memory
- real time
- bandwidth consumption
- complexity bounds
- higher throughput
- worst case analysis
- communication overhead
- sample size
- genetic algorithm
- data sets