Ecole d'ingénieur et centre de recherche en Sciences du numérique

Multi-user searchable encryption in the Cloud

Van Rompay, Cedric; Molva, Re fik; Önen, Melek

ISC 2015, 18th International Conference on Information Security, September 9-11, 2015, Trondheim, Norway

While Searchable Encryption (SE) has been widely studied, adapting it to the multi-user setting whereby many users can upload secret les or documents and delegate search operations to multiple other users still remains an interesting problem. In this paper we show that the adversarial models used in existing multi-user searchable encryption solutions are not realistic as they implicitly require that the cloud service provider cannot collude with some users. We then propose a stronger adversarial model, and propose a construction which is both practical and provably secure in this new model. The new solution combines the use of bilinear pairings with private information retrieval and introduces a new, non trusted entity called \proxy" to transform each user's search query into one instance per targeted le or document.

Document Doi Hal Bibtex

Titre:Multi-user searchable encryption in the Cloud
Type:Conférence
Langue:English
Ville:Trondheim
Pays:NORVÈGE
Date:
Département:Sécurité numérique
Eurecom ref:4633
Copyright: © Springer. Personal use of this material is permitted. The definitive version of this paper was published in ISC 2015, 18th International Conference on Information Security, September 9-11, 2015, Trondheim, Norway and is available at : http://dx.doi.org/10.1007/978-3-319-23318-5_17
Bibtex: @inproceedings{EURECOM+4633, doi = {http://dx.doi.org/10.1007/978-3-319-23318-5_17}, year = {2015}, title = {{M}ulti-user searchable encryption in the {C}loud}, author = {{V}an {R}ompay, {C}edric and {M}olva, {R}e fik and {\"{O}}nen, {M}elek}, booktitle = {{ISC} 2015, 18th {I}nternational {C}onference on {I}nformation {S}ecurity, {S}eptember 9-11, 2015, {T}rondheim, {N}orway}, address = {{T}rondheim, {NORV}{\`{E}}{GE}}, month = {09}, url = {http://www.eurecom.fr/publication/4633} }
Voir aussi: