Veil: A Storage and Communication Efficient Volume-Hiding Algorithm-Reference-Cited by-同舟云学术

Veil: A Storage and Communication Efficient Volume-Hiding Algorithm

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

Author:

Han Shanshan¹^ORCID,Chakraborty Vishal¹^ORCID,Goodrich Michael T.¹^ORCID,Mehrotra Sharad¹^ORCID,Sharma Shantanu²^ORCID

Affiliation:

1. University of California, Irvine, Irvine, CA, USA

2. New Jersey Institute of Technology, Newark, NJ, USA

Abstract

This paper addresses volume leakage (i.e., leakage of the number of records in the answer set) when processing keyword queries in encrypted key-value (KV) datasets. Volume leakage, coupled with prior knowledge about data distribution and/or previously executed queries, can reveal both ciphertexts and current user queries. We develop a solution to prevent volume leakage, entitled Veil, that partitions the dataset by randomly mapping keys to a set of equi-sized buckets. Veil provides a tunable mechanism for data owners to explore a trade-off between storage and communication overheads. To make buckets indistinguishable to the adversary, Veil uses a novel padding strategy that allow buckets to overlap, reducing the need to add fake records. Both theoretical and experimental results show Veil to significantly outperform existing state-of-the-art.

Funder

HPI Research Center in Machine Learning and Data Science at UC Irvine

NSF Grants

Publisher

Association for Computing Machinery (ACM)

Link

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

Reference53 articles.

1. Ghous Amjad Sarvar Patel Giuseppe Persiano Kevin Yeo and Moti Yung. 2021. Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. (2021). Ghous Amjad Sarvar Patel Giuseppe Persiano Kevin Yeo and Moti Yung. 2021. Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. (2021).

2. Johes Bater , Gregory Elliott , Craig Eggen , Satyender Goel , Abel Kho , and Jennie Rogers . 2016. SMCQL: secure querying for federated databases. arXiv preprint arXiv:1606.06808 ( 2016 ). Johes Bater, Gregory Elliott, Craig Eggen, Satyender Goel, Abel Kho, and Jennie Rogers. 2016. SMCQL: secure querying for federated databases. arXiv preprint arXiv:1606.06808 (2016).

3. A comparative evaluation of order-revealing encryption schemes and secure range-query protocols

4. David Cash , Joseph Jaeger , Stanislaw Jarecki , Charanjit Jutla , Hugo Krawczyk , Marcel-Cua tua lin Rocs u, and Michael Steiner . 2014 . Dynamic searchable encryption in very-large databases: Data structures and implementation. Cryptology ePrint Archive ( 2014). David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-Cua tua lin Rocs u, and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. Cryptology ePrint Archive (2014).

5. Anrin Chakraborti and Radu Sion . 2017 . Sqoram: Read-optimized sequential write-only oblivious RAM. arXiv preprint arXiv:1707.01211 (2017). Anrin Chakraborti and Radu Sion. 2017. Sqoram: Read-optimized sequential write-only oblivious RAM. arXiv preprint arXiv:1707.01211 (2017).