Cryptology ePrint Archive: Report 2021/1280

Snoopy: Surpassing the Scalability Bottleneck of Oblivious Storage

Emma Dauterman and Vivian Fang and Ioannis Demertzis and Natacha Crooks and Raluca Ada Popa

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.

Category / Keywords: cryptographic protocols / Oblivious RAM

Original Publication (with major differences): SOSP 21

Date: received 23 Sep 2021, last revised 12 Nov 2021

Contact author: edauterman at berkeley edu, v fang at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20211112:051247 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]