Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient computation on oblivious RAMs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Practical server privacy with secure coprocessors
IBM Systems Journal - End-to-end security
Protecting Client Privacy with Trusted Computing at the Server
IEEE Security and Privacy
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage
Proceedings of the 15th ACM conference on Computer and communications security
Controlling data in the cloud: outsourcing computation without outsourcing control
Proceedings of the 2009 ACM workshop on Cloud computing security
The case for RAMClouds: scalable high-performance storage entirely in DRAM
ACM SIGOPS Operating Systems Review
Almost optimal private information retrieval
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Seeding clouds with trust anchors
Proceedings of the 2010 ACM workshop on Cloud computing security workshop
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Perfectly secure oblivious RAM without random oracles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Privacy-preserving access of outsourced data via oblivious RAM simulation
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Oblivious RAM simulation with efficient worst-case access overhead
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the second ACM conference on Data and Application Security and Privacy
Oblivious RAM with o((logn)3) worst-case cost
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
ObliviAd: Provably Secure and Practical Online Behavioral Advertising
SP '12 Proceedings of the 2012 IEEE Symposium on Security and Privacy
Single round access privacy on outsourced storage
Proceedings of the 2012 ACM conference on Computer and communications security
PrivateFS: a parallel oblivious file system
Proceedings of the 2012 ACM conference on Computer and communications security
ObliviStore: High Performance Oblivious Cloud Storage
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
| Hi-index | 0.00 |
We present a 2-cloud oblivious storage (ORAM) system that achieves 2.6X bandwidth cost between the client and the cloud. Splitting an ORAM across 2 or more non-colluding clouds allows us to reduce the client-cloud bandwidth cost by at least one order of magnitude, shifting the higher-bandwidth communication to in-between the clouds where bandwidth provisioning is abundant. Our approach makes ORAM practical for bandwidth-constrained clients such as home or mobile Internet connections. We provide a full-fledged implementation of our 2-cloud ORAM system, and report results from a real-world deployment over Amazon EC2 and Microsoft Azure.