| Reference : Partitioned Searchable Encryption |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| Security, Reliability and Trust | |||
| http://hdl.handle.net/10993/47997 | |||
| Partitioned Searchable Encryption | |
| English | |
Barthel, Jim Jean-Pierre  [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >] | |
| Beunardeau, Marc [Nomadic Labs, Paris] | |
| Rosie, Razvan [Jao Luxembourg] | |
| Sahu, Rajeev Anand [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >] | |
| 2-Nov-2021 | |
| 1 | |
| Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings | |
| Qiong, Huang | |
| Yu, Yu | |
| Springer | |
| 63-79 | |
| Yes | |
| International | |
| 978-3-030-90401-2 | |
| Cham | |
| Switzerland | |
| THE 15TH INTERNATIONAL CONFERENCE ON PROVABLE AND PRACTICAL SECURITY | |
| from 5-11-2021 to 8-11-2021 | |
| Sha Ma, Ximing Li, Cai Zhang, Meiyan Xiao (South China Agricultural University) | |
| Guangzhou | |
| China | |
| [en] SSE ; functional encryption ; partitioned search ; Bloom filter | |
| [en] Symmetric searchable encryption (SSE) allows to outsource encrypted data to an untrusted server and retain searching capabilities. This is done without impacting the privacy of both the data and the search/update queries. In this work we put forth a new flavour of symmetric searchable encryption (SSE): Partitioned SSE is meant to capture the cases where the search rights must be partitioned among multiple individuals. We motivate through compelling examples the practical need for such a notion and discuss instantiations based on functional encryption and trapdoor permutations.
First we leverage the power of functional encryption (FE). Our construction follows the general technique of encrypting the set of keywords and the presumably larger datafiles separately, a keyword acting as a ``pointer'' to datafiles it belongs to. To improve on the constraint factors (large ciphertext, slow encryption/decryption procedures) that are inherent in FE schemes, the keyword check is done with the help of a Bloom filter -- one per datafile: the crux idea is to split the filter into buckets, and encrypt each bucket separately under an FE scheme. Functional keys are given for binary \masks checking if relevant positions are set to 1 inside the underlying bit-vector of the Bloom filter. The second construction we present achieves forward security and stems from the scheme by Bost in CCS'16. We show that a simple tweak of the original construction gives rise to a scheme supporting updates in the partitioned setting. Moreover, the constructions take into account the possibility that some specific users are malicious while declaring their search results. | |
| Researchers ; Professionals | |
| http://hdl.handle.net/10993/47997 | |
| 10.1007/978-3-030-90402-9_4 | |
| https://link.springer.com/chapter/10.1007/978-3-030-90402-9_4 | |
| Author preprint only. The peer-reviewed publisher postprint is available at https://link.springer.com | |
| FnR ; FNR10621687 > Sjouke Mauw > SPsquared > Security And Privacy For System Protection > 01/01/2017 > 30/06/2023 > 2015 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
