Name
Abstract | ||
|---|---|---|
This paper proposes TSKT-oblivious RAM (ORAM), an efficient multi-server ORAM construction, to protect a client's access pattern to outsourced data. TSKT-ORAM organizes each of the server storages as a k-ary tree and adopts XOR-based private information retrieval (PIR) and a novel delayed eviction technique to optimize both the data query and data eviction process. TSKT-ORAM is proven to protect the data access pattern privacy with a failure probability of 2(-80) when system parameter k >= 128. Meanwhile, given a constant-size local storage, when N (i.e., the total number of outsourced data blocks) ranges from 2(16)-2(34), the communication cost of TSKT-ORAM is only 22-46 data blocks. Asymptotic analysis and practical comparisons are conducted to show that TSKT-ORAM incurs lower communication cost, storage cost and access delay in practical scenarios than the compared state-of-the-art ORAM schemes. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.3390/fi9040057 | FUTURE INTERNET |
Keywords | Field | DocType |
cloud computing,storage,access pattern protection,oblivious RAM | Oblivious ram,Homomorphic encryption,Computer science,K-ary tree,Computer network,Private information retrieval,Data access,Asymptotic analysis,Operating system,Data query,Cloud computing | Journal |
Volume | Issue | ISSN |
9 | 4 | 1999-5903 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinsheng Zhang | 1 | 24 | 3.86 |
| Qiumao Ma | 2 | 12 | 3.33 |
| Wensheng Zhang | 3 | 98 | 18.14 |
| Daji Qiao | 4 | 1305 | 142.62 |