Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns-Reference-Cited by-同舟云学术

Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns

Published:2023-12-08 Issue:4 Volume:1 Page:1-25
ISSN:2836-6573
Container-title:Proceedings of the ACM on Management of Data
language:en
Short-container-title:Proc. ACM Manag. Data

Author:

Maiyya Sujaya¹^ORCID,Vemula Sharath Chandra²^ORCID,Agrawal Divyakant²^ORCID,El Abbadi Amr²^ORCID,Kerschbaum Florian¹^ORCID

Affiliation:

1. University of Waterloo, Waterloo, ON, Canada

2. University of California, Santa Barbara, Santa Barbara, CA, USA

Abstract

We present Waffle, a datastore that protects an application's data access patterns from a passive persistent adversary. Waffle achieves this without prior knowledge of the input data access distribution, making it the first of its kind to adaptively handle input sequences under a passive persistent adversary. Waffle maintains a constant bandwidth and client-side storage overhead, which can be adjusted to suit the application owner's preferences. This flexibility allows the owner to fine-tune system parameters and strike a balance between security and performance. Our evaluation, utilizing the Yahoo! Cloud Serving Benchmark (YCSB) benchmark and Redis as the backend storage, demonstrates promising results. The insecure baseline outperforms Waffle by a mere 5-6x, whereas Waffle outperforms Pancake-a state-of-the-art oblivious datastore under passive persistent adversaries-by 45-57%, and a concurrent ORAM system, TaoStore, by 102x.

Funder

Natural Sciences and Engineering Research Council of Canada

NSERC

IRC

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3626760

Reference56 articles.

1. Workload analysis of a large-scale key-value store

2. Practicing Oblivious Access on Cloud Storage

3. Blackstone , L. , Kamara , S. , and Moataz , T . Revisiting leakage abuse attacks. Cryptology ePrint Archive ( 2019 ). Blackstone, L., Kamara, S., and Moataz, T. Revisiting leakage abuse attacks. Cryptology ePrint Archive (2019).

4. Is There an Oblivious RAM Lower Bound?

5. Bronson , N. , Amsden , Z. , Cabrera , G. , Chakka , P. , Dimov , P. , Ding , H. , Ferris , J. , Giardullo , A. , Kulkarni , S. , Li , H. , Tao : Facebook's distributed data store for the social graph . In 2013 USENIX Annual Technical Conference (USENIXATC 13) ( 2013 ), pp. 49 -- 60 . Bronson, N., Amsden, Z., Cabrera, G., Chakka, P., Dimov, P., Ding, H., Ferris, J., Giardullo, A., Kulkarni, S., Li, H., et al. Tao: Facebook's distributed data store for the social graph. In 2013 USENIX Annual Technical Conference (USENIXATC 13) (2013), pp. 49--60.