Paper 2018/090 Original: eprint.iacr.org/2018/090 ↗
Secure and Scalable Multi-User Searchable Encryption
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).
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2018-01-28: last updated
- 2018-01-28: published
- Short URL
- https://ia.cr/2018/090
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}