Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead   We demonstrate a simple, statistically secure, ORAM with computational
overhead $\tilde{O}(\log^2 n)$; previous ORAM protocols achieve only
computational security (under computational assumptions) or require
$\tilde{\Omega}(\log^3 n)$ overheard. An additional benefit of our ORAM is its
conceptual simplicity, which makes it easy to implement in both software and
(commercially available) hardware.
  Our construction is based on recent ORAM constructions due to Shi, Chan,
Stefanov, and Li (Asiacrypt 2011) and Stefanov and Shi (ArXiv 2012), but with
some crucial modifications in the algorithm that simplifies the ORAM and enable
our analysis. A central component in our analysis is reducing the analysis of
our algorithm to a "supermarket" problem; of independent interest (and of
importance to our analysis,) we provide an upper bound on the rate of "upset"
customers in the "supermarket" problem.

35
The categories of this paper are: mtrl-th
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
28
The categories of this paper are: alg-geom