Cryptology ePrint Archive: Report 2021/1227

Efficient Boolean Search over Encrypted Data with Reduced Leakage

Sarvar Patel and Giuseppe Persiano and Joon Young Seo and Kevin Yeo

Abstract: Encrypted multi-maps enable outsourcing the storage of a multi-map to an untrusted server while maintaining the ability to query privately. We focus on encrypted Boolean multi-maps that support arbitrary Boolean queries over the multi-map. Kamara and Moataz [Eurocrypt’17] presented the first encrypted multi-map, BIEX, that supports CNF queries with optimal communication, worst-case sublinear search time and non-trivial leakage.

We improve on previous work by presenting a new construction CNFFilter for CNF queries with significantly less leakage than BIEX, while maintaining both optimal communication and worst-case sublinear search time. As a direct consequence our construction shows additional resistance to leakage-abuse attacks in comparison to prior works. For most CNF queries, CNFFilter avoids leaking the result sets for any singleton queries for labels appearing in the CNF query. As an example, for the CNF query of the form (l1 ∨ l2) ∧ l3, our scheme does not leak the result sizes of queries to l1, l2 or l3 individually. On the other hand, BIEX does leak some of this information. This is just an example of the reduced leakage obtained by CNFFilter. The core of CNFFilter is a new filtering algorithm that performs set intersections with significantly less leakage compared to prior works.

We implement CNFFilter and show that CNFFilter achieves faster search times and similar communication overhead compared to BIEX at the cost of a small increase in server storage.

Category / Keywords:

Original Publication (with minor differences): Asiacrypt 2021

Date: received 17 Sep 2021

Contact author: sarvar at google com, giuper at gmail com, jyseo at google com, kwlyeo at google com

Available format(s): PDF | BibTeX Citation

Version: 20210920:105654 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]