Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Partitioned Searchable Encryption
Barthel, Jim Jean-Pierre; Beunardeau, Marc; Rosie, Razvan et al.
2021In Qiong, Huang; Yu, Yu (Eds.) Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings
Peer reviewed
 

Files


Full Text
PSSE_ProvSec_AuthorPreprint.pdf
Author preprint (752.9 kB)
Download

Author preprint only. The peer-reviewed publisher postprint is available at https://link.springer.com


All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
SSE; functional encryption; partitioned search; Bloom filter
Abstract :
[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.
Disciplines :
Computer science
Author, co-author :
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)
External co-authors :
yes
Language :
English
Title :
Partitioned Searchable Encryption
Publication date :
02 November 2021
Event name :
THE 15TH INTERNATIONAL CONFERENCE ON PROVABLE AND PRACTICAL SECURITY
Event organizer :
Sha Ma, Ximing Li, Cai Zhang, Meiyan Xiao (South China Agricultural University)
Event place :
Guangzhou, China
Event date :
from 5-11-2021 to 8-11-2021
Audience :
International
Main work title :
Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings
Author, co-author :
Qiong, Huang
Yu, Yu
Publisher :
Springer, Cham, Switzerland
Edition :
1
ISBN/EAN :
978-3-030-90401-2
Pages :
63-79
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
FnR Project :
FNR10621687 - Security And Privacy For System Protection, 2015 (01/01/2017-30/06/2023) - Sjouke Mauw
Available on ORBilu :
since 09 September 2021

Statistics


Number of views
259 (13 by Unilu)
Number of downloads
46 (3 by Unilu)

Scopus citations®
 
0
Scopus citations®
without self-citations
0
OpenCitations
 
0
WoS citations
 
0

Bibliography


Similar publications



Contact ORBilu