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

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

doi:10.1109/srds47363.2019.00021

Cited by 4 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the companion technical report to the first version of BISEN [21], we provide a full security proof of these statements in the real/ideal standard cryptographic model [29]. The proof of this design is very similar, which we omit to avoid redundancy.…”

Section: Security Analysismentioning

confidence: 99%

See 1 more Smart Citation

Boolean Searchable Symmetric Encryption with Filters on Trusted Hardware

Ferreira

Portela

Oliveira

et al. 2020

IEEE Trans. Dependable and Secure Comput.

Self Cite

View full text Add to dashboard Cite

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. 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 by exploring 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 support multiple users and 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, BISEN extends the traditional SSE model to support filter functions on search results based on generic metadata created by the users. Experimental validation and comparison with the state of art shows that BISEN provides better performance with enriched search semantics and security properties.

show abstract

Section: Security Analysismentioning

confidence: 99%

“…The work presented in this paper was first introduced in [22]. In this version, we additionally propose to extend the traditional SSE model to support filter functions on conjunctive and disjunctive queries based on metadata created by the users.…”

Section: Introductionmentioning

confidence: 99%

Boolean Searchable Symmetric Encryption with Filters on Trusted Hardware

Ferreira

Portela

Oliveira

et al. 2020

IEEE Trans. Dependable and Secure Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Our scheme takes the advantages of both worlds and supports verifiability in dynamic settings. Recently, several papers have provided elegant solutions for verifiability and dynamism, with forward secrecy [27] and potentially via trusted hardware [28]. While the existing schemes perform modification as 'delete-then-add', our scheme supports it directly, thus more efficiently.…”

Section: Verifiable Ssementioning

confidence: 99%

Verifiable dynamic searchable encryption

Etemad¹,

Küpçü²

2019

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Using regular encryption schemes to protect the privacy of the outsourced data implies that the client should sacrifice functionality for security. Searchable symmetric encryption (SSE) schemes encrypt the data in a way that the client can later search and selectively retrieve the required data. Many SSE schemes have been proposed, starting with static constructions, and then dynamic and adaptively secure constructions but usually in the honest-but-curious model.We propose a verifiable dynamic SSE scheme that is adaptively secure against malicious adversaries. Our scheme supports file modification, which is essential for efficiently working with large files, in addition to the ability to add/delete files. While our main construction is proven secure in the random oracle model (ROM), we also present a solution secure in the standard model with full security proof. Our experiments show that our scheme in the ROM performs a search within a few milliseconds, verifies the result in another few milliseconds, and has a proof overhead of 0.01% only. Our standard model solution, while being asymptotically slower, is still practical, requiring only a small client memory (e.g., ≃ 488 KB) even for a large file collection (e.g., ≃ 10 GB), and necessitates small tokens (e.g., ≃ 156 KB for search and ≃ 362 KB for file operations).the token or the files), and the search pattern, which indicates whether two or more of the tokens were for the same query [1]. A secure SSE scheme leaks nothing more.Previous studies on cloud storage mainly considered efficient integrity verification [11][12][13][14][15][16][17][18]. Our goal in this paper is to achieve integrity and confidentiality simultaneously, while preserving the efficient search functionality in outsourced storage scenarios. We propose a verifiable dynamic SSE scheme that is secure against malicious servers, with the ability to efficiently add/delete/modify (parts of) encrypted files, and with security fully proven via simulation in both the random oracle model and the standard model. Related workThe oblivious RAM (ORAM) [19] supports search on the outsourced data while hiding the access pattern.However, as the usage of ORAM (one block per access) differs from that of the SSE (many blocks per access), it cannot fully prevent access or search pattern leakage in SSE [20]. Early works and definitionsGoh [21] introduced the secure index as an efficient data structure for keyword search. The scheme is secure against chosen-keyword attacks (CKA1). Chang and Mitzenmacher [22] proposed the simulation-based notion of security. Curtmola et al. [1] stated that both CKA1 [21] and simulation-based [22] definitions are not adequate, and gave a stronger definition (CKA2). Dynamic dataThe problem in the dynamic setting is that once an update operation is performed, the server gains extra information related to previous queries. The server can learn whether or not the newly added files contain the keywords that have already been queried for (even though the keyword is encrypted and the server d...

show abstract

“…However, it forces queries to be in Conjunctive Normal Form and not supporting negations. Bernardo's 11 method BISEN supports arbitrarily complex boolean queries, verifiability to malicious users, and minimal leakage. However, it uses the te chnology of trusted regions.…”

Section: Introductionmentioning

confidence: 99%

Efficient boolean SSE: A novel encrypted database (EDB) for biometric authentication

Zhu

et al. 2021

Int J of Intelligent Sys

View full text Add to dashboard Cite

Biometric authentication is up‐and‐coming to replace the traditional identity authentication method (e.g., passwords, PIN, identification cards) for its convenience and intelligence. With more and more users using this method, the database becomes more extensive, and the functions are seriously challenged. Data outsourcing has advantages in terms of convenience and cost savings, so it has attracted much research effort. However, due to the biometric's immutability of the whole life, it is extremely sensitive, and disclosing it to a third party is undesirable. In this paper, we address the issue of securely outsourcing biometric database. We propose a novel boolean searchable symmetric encryption (SSE) to construct a secure interactive protocol when outsourcing. A new encrypted database construction method was proposed, using the more efficient boolean vectors. Based on this, We suggest three kinds of expressive SSE, supporting disjunctive query, boolean query, and lightweight settings. We prove the schemes' correctness and security theoretically. Our constructions use simple cryptographic tools, such as symmetric cryptography and pseudo‐random functions. They are straightforward to understand and easy to implement. The experiments show that all our schemes are practical and more efficient than the existing methods.

show abstract

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

Cited by 4 publications

References 27 publications

Boolean Searchable Symmetric Encryption with Filters on Trusted Hardware

Boolean Searchable Symmetric Encryption with Filters on Trusted Hardware

Verifiable dynamic searchable encryption

Efficient boolean SSE: A novel encrypted database (EDB) for biometric authentication

Contact Info

Product

Resources

About