Name
Abstract | ||
|---|---|---|
ORAM scheme is becoming a study hotspot to access data securely, whether ORAM is based on layer or tree structure, client cache always exists in different ORAM. Some smart devices for example, cel phone may be as a user with small capacity associated with cloud storage. The optimal client cache should be limited to small constant size or a strict small upper bound. The paper designs a novel client eviction mechanism. The eviction mechanism can support and optimize different kinds of evictions. It can merge with tree-based and also layer-based partition ORAMs, which are the most suitable to practical state so far. Comparing to original eviction cache which has a fuzzy upper bound of O(√N) (N is the number of real blocks in ORAM), the novel one can be strict to 2√N - 1. In general case, the reduction of eviction cache is achieved by the novel mechanism. In theory, the capacity of novel eviction cache is always a factor of O(log(√N)), comparing to O(√N) capacity in tradition. In our experiment, if the capacity of ORAM is 1TB and block size is 64KB, during twenty thousand real block reads from server, the client needs at most about 125MB of original eviction cache (0.01% of ORAM capacity) but about 73MB (0.007% of ORAM capacity) of novel eviction cache in random eviction. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/CSE-EUC.2017.98 | 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) |
Keywords | Field | DocType |
novel eviction mechanism,linkability attack,partition ORAM,eviction cache | Block size,Computer science,Cache,Upper and lower bounds,Server,Binary tree,Computer network,Tree structure,Eviction,Cloud storage,Operating system | Conference |
Volume | ISSN | ISBN |
1 | 1949-0828 | 978-1-5386-3222-2 |
Citations | PageRank | References |
1 | 0.35 | 9 |
Authors | ||
3 | ||