Name
Abstract | ||
|---|---|---|
We construct a statistically secure ORAM with computational overhead of (O(log ^2Nlog log N)). Moreover, when accessing continuous blocks, our scheme can achieve an amortized complexity (O(log Nlog log N)), which almost matches the theoretical lower bound of the ORAM problem. Our construction is based on a tree-based construction [16]. The technical novelty comes from the idea of combining (O(log N)) blocks into a big block together with a more aggressive and efficient “flush” operation, which is the bottleneck of existing ORAM schemes. All in all, we can achieve better amortized overhead in our new scheme. |
Year | Venue | Field |
|---|---|---|
2015 | ICICS | Binary logarithm,Overhead (computing),Bottleneck,Discrete mathematics,Upper and lower bounds,Computer science,Amortized analysis,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nairen Cao | 1 | 0 | 1.01 |
| Xiaoqi Yu | 2 | 0 | 0.68 |
| Yufang Yang | 3 | 0 | 0.34 |
| Linru Zhang | 4 | 0 | 0.68 |
| Siu-Ming Yiu | 5 | 44 | 13.98 |