Authors:
Mahdieh Heidaripour
1
;
Ladan Kian
1
;
Maryam Rezapour
2
;
Mark Holcomb
1
;
Benjamin Fuller
2
;
Gagan Agrawal
3
and
Hoda Maleki
1
Affiliations:
1
School of Computer and Cyber Sciences, Augusta University, Augusta, U.S.A.
;
2
Department of Computer Science and Engineering, University of Connecticut, Connecticut, U.S.A.
;
3
School of Computing, University of Georgia, Athens, U.S.A.
Keyword(s):
System-Wide Security of Searchable Encryption, Multi-dimensional Databases, Range Queries.
Abstract:
Storage of sensitive multi-dimensional arrays must be secure and efficient in storage and processing time. Searchable encryption allows one to trade between security and efficiency. Searchable encryption design focuses on building indexes, overlooking the crucial aspect of record retrieval. Gui et al. (PoPETS 2023) showed that understanding the security and efficiency of record retrieval is critical to understand the overall system. A common technique for improving security is partitioning data tuples into parts. When a tuple is requested, the entire relevant part is retrieved, hiding the tuple of interest. This work assesses tuple partitioning strategies in the dense data setting, considering parts that are random, 1-dimensional, and multi-dimensional. We consider synthetic datasets of 2,3 and 4 dimensions, with sizes extending up to 2M tuples. We compare security and efficiency across a variety of record retrieval methods. Our findings are: is any size as long as the query is large
in all other dimensions. et al., USENIX Security 2020).
(More)