Snoopy
Open Access
- 26 October 2021
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
Existing oblivious storage systems provide strong security by hiding access patterns, but do not scale to sustain high throughput as they rely on a central point of coordination. To overcome this scalability bottleneck, we present Snoopy, an object store that is both oblivious and scalable such that adding more machines increases system throughput. Snoopy contributes techniques tailored to the high-throughput regime to securely distribute and efficiently parallelize every system component without prohibitive coordination costs. These techniques enable Snoopy to scale similarly to a plaintext storage system. Snoopy achieves 13.7x higher throughput than Obladi, a state-of-the-art oblivious storage system. Specifically, Obladi reaches a throughput of 6.7K requests/s for two million 160-byte objects and cannot scale beyond a proxy and server machine. For the same data size, Snoopy uses 18 machines to scale to 92K requests/s with average latency under 500ms.Keywords
Funding Information
- Scotiabank
- Alfred P. Sloan Foundation
- Alibaba
- Futurewei Technologies
- VMware
- Amazon Web Services
- Splunk
- National Science Foundation (CCF-1730628, 194337)
- Intel Corporation
- Nvidia
- Bakar Fellows
- Ant Financial Services Group
- Microsoft
- Ericsson
This publication has 32 references indexed in Scilit:
- Leakage-Abuse Attacks Against Searchable EncryptionPublished by Association for Computing Machinery (ACM) ,2015
- GhostRiderPublished by Association for Computing Machinery (ACM) ,2015
- On the (In)security of Hash-based Oblivious RAM and a New Balancing SchemePublished by Society for Industrial & Applied Mathematics (SIAM) ,2012
- On the expected longest length probe sequence for hashing with separate chainingJournal of Discrete Algorithms, 2011
- Balanced allocationsPublished by Association for Computing Machinery (ACM) ,2000
- Private information retrievalJournal of the ACM, 1998
- “Balls into Bins” — A Simple and Tight AnalysisLecture Notes in Computer Science, 1998
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- Efficient computation on oblivious RAMsPublished by Association for Computing Machinery (ACM) ,1990
- Computing the probability of hash table/urn overflowCommunications in Statistics - Theory and Methods, 1987