Cryptology ePrint Archive: Report 2018/090

Secure and Scalable Multi-User Searchable Encryption

Cédric Van Rompay and Refik Molva and Melek Önen

Abstract: By allowing a large number of users to behave as readers or writers, Multi-User Searchable Encryption (MUSE) raises new security and performance challenges beyond the typical requirements of Symmetric Searchable Encryption (SSE). In this paper we identify two core mandatory requirements of MUSE protocols being privacy in face of users colluding with the CSP and low complexity for the users, pointing that no existing MUSE protocol satisfies these two requirements at the same time. We then come up with the first MUSE protocol that satisfies both of them. The design of the protocol also includes new constructions for a secure variant of Bloom Filters (BFs) and multi-query Oblivious Transfer (OT).

Category / Keywords: public-key cryptography / distributed cryptography, oblivious transfer, searchable encryption

Date: received 24 Jan 2018, last revised 26 Jan 2018

Contact author: cedric van-rompay at eurecom fr

Available format(s): PDF | BibTeX Citation

Note: added missing authors in PDF

Version: 20180128:213146 (All versions of this report)

Short URL: ia.cr/2018/090