Organizing Records for Retrieval in Multi-Dimensional Range Searchable Encryption

Mahdieh Heidaripour, Ladan Kian, Maryam Rezapour, Mark Holcomb, Benjamin Fuller, Gagan Agrawal, Hoda Maleki

2024

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).

Paper Citation

in Harvard Style

Heidaripour M., Kian L., Rezapour M., Holcomb M., Fuller B., Agrawal G. and Maleki H. (2024). Organizing Records for Retrieval in Multi-Dimensional Range Searchable Encryption. In Proceedings of the 21st International Conference on Security and Cryptography - Volume 1: SECRYPT; ISBN 978-989-758-709-2, SciTePress, pages 459-466. DOI: 10.5220/0012765600003767

in Bibtex Style

@conference{secrypt24,
author={Mahdieh Heidaripour and Ladan Kian and Maryam Rezapour and Mark Holcomb and Benjamin Fuller and Gagan Agrawal and Hoda Maleki},
title={Organizing Records for Retrieval in Multi-Dimensional Range Searchable Encryption},
booktitle={Proceedings of the 21st International Conference on Security and Cryptography - Volume 1: SECRYPT},
year={2024},
pages={459-466},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012765600003767},
isbn={978-989-758-709-2},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 21st International Conference on Security and Cryptography - Volume 1: SECRYPT
TI - Organizing Records for Retrieval in Multi-Dimensional Range Searchable Encryption
SN - 978-989-758-709-2
AU - Heidaripour M.
AU - Kian L.
AU - Rezapour M.
AU - Holcomb M.
AU - Fuller B.
AU - Agrawal G.
AU - Maleki H.
PY - 2024
SP - 459
EP - 466
DO - 10.5220/0012765600003767
PB - SciTePress