Cryptology ePrint Archive: Report 2018/588

BISEN: Efficient Boolean Searchable Symmetric Encryption with Verifiability and Minimal Leakage

Guilherme Borges and Henrique Domingos and Bernardo Ferreira and João Leitão and Tiago Oliveira and Bernardo Portela

Abstract: The prevalence and availability of cloud infrastructures has made them the de facto solution for storing and archiving data, both for organizations and individual users. Nonetheless, the cloud’s wide spread adoption is still hindered by dependability and security concerns, particularly in applications with large data collections where efficient search and retrieval services are also major requirements. This leads to an increased tension between security, efficiency, and search expressiveness, which current state of the art solutions try to balance through complex cryptographic protocols that tradeoff efficiency and expressiveness for near optimal security.

In this paper we tackle this tension by proposing BISEN, a new provably-secure boolean searchable symmetric encryption scheme that improves these three complementary dimensions byexploring the design space of isolation guarantees offered by novel commodity hardware such as Intel SGX, abstracted as Isolated Execution Environments (IEEs). BISEN is the first scheme to enable highly expressive and arbitrarily complex boolean queries, with minimal information leakage regarding performed queries and accessed data, and verifiability regarding fully malicious adversaries. Furthermore, by exploiting trusted hardware and the IEE abstraction, BISEN reduces communication costs between the client and the cloud, boosting query execution performance. Experimental validation and comparison with the state of art shows that BISEN provides better performance with enriched search semantics and security properties.

Category / Keywords: cryptographic protocols / Searchable Symmetric Encryption, Trusted Hardware, Cloud Computing, Provable Security

Original Publication (with minor differences): SRDS 2019

Date: received 7 Jun 2018, last revised 1 Aug 2019

Contact author: blfp at inesctec pt

Available format(s): PDF | BibTeX Citation

Version: 20190801:135519 (All versions of this report)

Short URL: ia.cr/2018/588


[ Cryptology ePrint archive ]