TY - GEN
T1 - MUSE: Multimodal searchable encryption for cloud applications
AU - Ferreira, Bernardo
AU - Leitão, João
AU - Domingos, Henrique
N1 - This work was supported by FCT/MCTES through project NOVA LINCS (UID/CEC/04516/2013) and the EU, through project LightKone (grant agreement no 732505).
PY - 2019/1/15
Y1 - 2019/1/15
N2 - 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 MuSE particularly suitable for practical application scenarios.
AB - 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 MuSE particularly suitable for practical application scenarios.
UR - http://www.scopus.com/inward/record.url?scp=85062086724&partnerID=8YFLogxK
U2 - 10.1109/SRDS.2018.00029
DO - 10.1109/SRDS.2018.00029
M3 - Conference contribution
AN - SCOPUS:85062086724
T3 - Symposium on Reliable Distributed Systems Proceedings
SP - 181
EP - 190
BT - Proceedings - 2018 IEEE 37th Symposium on Reliable Distributed Systems, SRDS 2018
PB - IEEE Computer Society
T2 - 37th Symposium on Reliable Distributed Systems, SRDS 2018
Y2 - 2 October 2018 through 5 October 2018
ER -