Cryptology ePrint Archive: Report 2021/229

Fast Boolean Queries with Minimized Leakage for Encrypted Databases in Cloud Computing

Zhiqiang Wu and Kenli Li and Keqin Li and Jin Wang

Abstract: This research revisits the fundamental problem of processing privacy-preserving Boolean queries over outsourced databases on untrusted public clouds. Many current Searchable Encryption (SE) schemes try to seek an appropriate trade-off between security and efficiency, yet most of them suffer from an unacceptable query leakage due to their conjunctive/disjunctive terms that are processed individually. We show, however, this trade-off still can be deeply optimized for more security. We consider a Boolean formula as a set of deterministic finite automatons (DFAs) and propose a novel approach to running an encrypted DFA, which can be effectively and efficiently processed by the cloud. We give three constructions for conjunctive, disjunctive, and Boolean queries, respectively. Their notable advantages are single-round, highly-efficient, adaptively-secure, and leakage-minimized. A lot of experiments are made to evaluate overall efficiency. Testing results show that the schemes achieve enhanced security almost without sacrificing anything of search efficiency.

Category / Keywords: cryptographic protocols / Cloud Computing, Privacy Preserving, Searchable Encryption.

Original Publication (with minor differences): IEEE Access
DOI:
10.1109/ACCESS.2019.2910457

Date: received 28 Feb 2021

Contact author: wzq at csust edu cn

Available format(s): PDF | BibTeX Citation

Version: 20210302:203032 (All versions of this report)

Short URL: ia.cr/2021/229


[ Cryptology ePrint archive ]