Secure and Scalable Multi-User Searchable Encryption

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

Paper 2018/090

Secure and Scalable Multi-User Searchable Encryption

Cédric Van Rompay, 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).

Note: added missing authors in PDF

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: distributed cryptography oblivious transfer searchable encryption
Contact author(s): cedric van-rompay @ eurecom fr
History: 2018-01-28: received
Short URL: https://ia.cr/2018/090
License: CC BY

BibTeX

@misc{cryptoeprint:2018/090,
      author = {Cédric Van Rompay and Refik Molva and Melek Önen},
      title = {Secure and Scalable Multi-User Searchable Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/090},
      year = {2018},
      url = {https://eprint.iacr.org/2018/090}
}