Fast two-server multi-user searchable encryption with strict access pattern leakage

Van Rompay, Cédric; Molva, Refik; Önen, Melek
ICICS 2018, 20th International Conference on Information and Communications Security, 29-31 October 2018, Lille, France / Also published in LNCS, Vol. 11149

A recent paper showed that most Multi-User Searchable Encryption protocols do not provide any privacy without the assumption that all users can be trusted, an assumption too strong to be realistic for a MUSE system. As to the few MUSE protocols that are not affected, they all suffer from some scalability issues. We present the first MUSE protocol that does protect against user-server collusions, and yet scales very well. The protocol is also very simple. We prove that the leakage of the protocol is limited to the access pattern of queries and we report on performance measurements from a proof-of-concept implementation.

DOI
Type:
Conférence
City:
Lille
Date:
2018-10-29
Department:
Sécurité numérique
Eurecom Ref:
5627
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in ICICS 2018, 20th International Conference on Information and Communications Security, 29-31 October 2018, Lille, France / Also published in LNCS, Vol. 11149 and is available at : http://dx.doi.org/https://doi.org/10.1007/978-3-030-01950-1_23

PERMALINK : https://www.eurecom.fr/publication/5627