An Efficient Non-Interactive Multi-Client Searchable Encryption with Support for Boolean Queries
Published in 21st European Symposium on Research in Computer Security (ESORICS 2016), Heraklion, Greece, 2016
Recommended citation: Shi-Feng Sun, Joseph K. Liu, Amin Sakzad, Ron Steinfeld, and Tsz Hon Yuen. “An Efficient Non-Interactive Multi-Client Searchable Encryption with Support for Boolean Queries.” In Computer Security – ESORICS 2016, Lecture Notes in Computer Science, vol. 9878, pp. 154–172, 2016. https://doi.org/10.1007/978-3-319-45744-4_8
This paper proposes a multi-client searchable-encryption protocol that removes the need for the data owner to interact for each client query. It supports Boolean queries, offers fine-grained access control through attribute-based encryption, and protects query privacy from the data owner to some extent.