EUVIMEDEUVIMED entdecken
Crossref

A multi-server oblivious dynamic searchable encryption framework

Thang Hoang, Attila A. Yavuz, F. Betül Durak, Jorge Guajardo

Journal of Computer Security · 11.10.2019 · 27 (6) · 649-676

DOI: 10.3233/jcs-191300 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer Security, online erschienen am 30.09.2019. Verfasst von Thang Hoang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 46 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Data privacy is one of the main concerns for data outsourcing on the cloud. Although standard encryption can provide confidentiality, it prevents the client from searching/retrieving meaningful information on the outsourced data thereby, degrading the benefits of using cloud services. To address this data utilization versus privacy dilemma, Dynamic Searchable Symmetric Encryption (DSSE) has been proposed. DSSE enables encrypted search and update functionality over the encrypted data via a secure index. However, the state-of-the-art DSSE constructions leak information from the access pattern, making them vulnerable against various attacks. While generic Oblivious Random Access Machine (ORAM) can hide the access pattern, it incurs a heavy communication overhead, which was shown costly to be directly used in the DSSE setting. In this article, by exploiting the multi-cloud infrastructure, we develop a comprehensive Oblivious Distributed DSSE (ODSE) framework that allows oblivious search and updates on the encrypted index with high security and improved efficiency over the use of generic ORAM. Our framework contains a series of [Formula: see text] schemes each featuring different levels of performance and security required by various types of real-life applications. ODSE offers desirable security guarantees such as information-theoretic security and robustness in the presence of a malicious adversary. We fully implemented [Formula: see text] framework and evaluated its performance in a real cloud environment (Amazon EC2). Our experiments showed that ODSE schemes are [Formula: see text]-[Formula: see text] faster than using generic ORAMs on a DSSE encrypted index under real network settings.

Zitieren

APA

Hoang, T., Yavuz, A. A., Durak, F. B., & Guajardo, J. (2019). A multi-server oblivious dynamic searchable encryption framework. Journal of Computer Security, 27(6), 649-676. https://doi.org/10.3233/jcs-191300

Vancouver

Hoang T, Yavuz AA, Durak FB, Guajardo J. A multi-server oblivious dynamic searchable encryption framework. Journal of Computer Security. 2019;27(6):649-676. doi:10.3233/jcs-191300

BibTeX
@article{Hoang2019,
  author = {Hoang, Thang and Yavuz, Attila A. and Durak, F. Betül and Guajardo, Jorge},
  title = {A multi-server oblivious dynamic searchable encryption framework},
  journal = {Journal of Computer Security},
  year = {2019},
  volume = {27},
  number = {6},
  pages = {649--676},
  doi = {10.3233/jcs-191300}
}
Kostenlos starten →