Title | ||
---|---|---|
DF-ORAM: A Practical Dummy Free Oblivious RAM to Protect Outsourced Data Access Pattern. |
Abstract | ||
---|---|---|
Oblivious RAM (ORAM) is a security-provable model that can be used to protect a client's access pattern to remote storage. Existing ORAM constructions were designed mainly for communication efficiency, but the server-side storage efficiency was generally neglected. This paper proposes DF-ORAM, which has the following features when N blocks each of B bits are outsourced: (i) server-side storage overhead is 3N bits (i.e., no dummy blocks); (ii) no server-side computational cost; (iii) server-client communication cost is O(logN . B) bit per query; and (iv) client-side storage cost is O(lambda . B) bits where lambda is a security parameter. Asymptotical and implementation-based evaluation demonstrate DF-ORAM to be the most communication-efficient and storage-efficient one among the existing ORAMs that do not require server-side computation. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-46298-1_27 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Binary logarithm,Oblivious ram,Computer science,Computer security,Tree (data structure),Computer network,Block (data storage),Storage efficiency,Security parameter,Data access,Computation | Conference | 9955 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
16 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qiumao Ma | 1 | 12 | 3.33 |
Wensheng Zhang | 2 | 98 | 18.14 |
Jinsheng Zhang | 3 | 24 | 3.86 |