SCC 2018, 6th International Workshop on Security in Cloud Computing, in conjunction with the 13th ACM Asia Conference on Computer and Communications Security (ASIACCS), June 4, 2018, Songdo, Incheon, Korea
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).
Type:
Conference
City:
Songdo
Date:
2018-06-04
Department:
Digital Security
Eurecom Ref:
5521
Copyright:
© ACM, 2018. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SCC 2018, 6th International Workshop on Security in Cloud Computing, in conjunction with the 13th ACM Asia Conference on Computer and Communications Security (ASIACCS), June 4, 2018, Songdo, Incheon, Korea
http://dx.doi.org/10.1145/3201595.3201597
http://dx.doi.org/10.1145/3201595.3201597
See also:
