Title :
ObliviStore: High Performance Oblivious Cloud Storage
Author :
Stefanov, E. ; Shi, Elaine
Author_Institution :
Univ. of California, Berkeley, Berkeley, CA, USA
Abstract :
We design and build ObliviStore, a high performance, distributed ORAM-based cloud data store secure in the malicious model. To the best of our knowledge, ObliviStore is the fastest ORAM implementation known to date, and is faster by 10X or more in comparison with the best known ORAM implementation. ObliviStore achieves high throughput by making I/O operations asynchronous. Asynchrony introduces security challenges, i.e., we must prevent information leakage not only through access patterns, but also through timing of I/O events. We propose various practical optimizations which are key to achieving high performance, as well as techniques for a data center to dynamically scale up a distributed ORAM. We show that with 11 trusted machines (each with a modern CPU), and 20 Solid State Drives, ObliviStore achieves a throughput of 31.5MB/s with a block size of 4KB.
Keywords :
cloud computing; input-output programs; parallel processing; security of data; storage allocation; CPU; I/O event timing; ObliviStore; access patterns; asynchronous I/O operations; block size; data center; high-performance distributed ORAM-based cloud data storage; high-performance oblivious cloud storage; information leakage prevention; malicious model; solid state drives; throughput; Cloud computing; Cryptography; Distributed databases; Hardware; Servers; Timing; file system; oblivious ram; oblivious storage; oblivistore; oram;
Conference_Titel :
Security and Privacy (SP), 2013 IEEE Symposium on
Conference_Location :
Berkeley, CA
Print_ISBN :
978-1-4673-6166-8
Electronic_ISBN :
1081-6011