Cryptology ePrint Archive: Report 2017/661

MuSE: Multimodal Searchable Encryption for Cloud Applications

Bernardo Ferreira and João Leitão and Henrique Domingos

Abstract: In this paper we tackle the practical challenges of searching encrypted multimodal data (i.e. data containing multiple media formats simultaneously), stored in public cloud servers, with reduced information leakage. To this end we propose MuSE, a Multimodal Searchable Encryption scheme that, by combining only standard cryptographic primitives and symmetric-key block ciphers, allows cloud-backed applications to dynamically store, update, and search multimodal datasets with privacy and efficiency guarantees. As searching encrypted data requires a tradeoff between privacy and efficiency, we also propose a variant of MuSE that resorts to partially homomorphic encryption to further reduce information leakage, but at the cost of additional computational overhead. Both schemes are formally proven secure and experimentally evaluated regarding performance and search precision. Experiments with realistic datasets show that our contributions achieve interesting levels of efficiency and privacy, making them suitable for practical application scenarios.

Category / Keywords: Cloud Computing, Searchable Encryption, Multimodal Data

Date: received 4 Jul 2017, last revised 23 Apr 2018

Contact author: bf at fct unl pt

Available format(s): PDF | BibTeX Citation

Note: Revised and extended experimental results.

Version: 20180423:130009 (All versions of this report)

Short URL: ia.cr/2017/661

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]