publication . Other literature type . Part of book or chapter of book . 2013

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries

David Cash; Stanislaw Jarecki; Charanjit Jutla; Hugo Krawczyk; Marcel-Cătălin Roşu; Michael Steiner;
Open Access
  • Published: 01 Jan 2013
  • Publisher: Springer Berlin Heidelberg
This work presents the design and analysis of the first searchable symmetric encryption (SSE) protocol that supports conjunctive search and general Boolean queries on outsourced symmetrically- encrypted data and that scales to very large databases and arbitrarily-structured data including free text search. To date, work in this area has focused mainly on single-keyword search. For the case of conjunctive search, prior SSE constructions required work linear in the total number of documents in the database and provided good privacy only for structured attribute-value data, rendering these solutions too slow and inflexible for large practical databases.
Download fromView all 2 versions
Part of book or chapter of book
Provider: UnpayWall
Part of book or chapter of book . 2013
Provider: Crossref
Other literature type . 2013
Provider: Datacite
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue