Graduate School and Research Center in Digital Sciences

Secure and scalable multi-User searchable encryption

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

Cryptology ePrint Archive: Report 2018/090

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). 

Document Doi Bibtex

Title:Secure and scalable multi-User searchable encryption
Keywords:public-key cryptography, distributed cryptography, oblivious transfer, searchable encryption
Type:Report
Language:English
City:
Date:
Department:Digital Security
Eurecom ref:5441
Copyright: IACR
Bibtex: @techreport{EURECOM+5441, doi = {http://eprint.iacr.org/2018/090}, year = {2018}, title = {{S}ecure and scalable multi-{U}ser searchable encryption}, author = {{V}an {R}ompay, {C}{\'e}dric and {M}olva, {R}efik and {\"{O}}nen, {M}elek}, number = {EURECOM+5441}, month = {01}, institution = {Eurecom}, url = {http://www.eurecom.fr/publication/5441},, }
See also: