Abstract
A Searchable Symmetric Encryption (SSE) scheme allows a server to search a user's data without having to decrypt the data. This provides the user with a high degree of privacy and is particularly useful when data is stored on Cloud. Numerous SSE schemes have already been proposed and while most have excellent security properties, few meet high performance requirements and most only support searching for a single keyword at a time. The SSE scheme of Cash et al. (CRYPTO 2013) is notable for its high efficiency on restricted forms of Boolean queries, but has low efficiency for, or does not support, other common forms of boolean queries. In this paper, we propose a generalization and optimization of the Cash et al. SSE scheme, which extends to support a much larger class of boolean queries, and performs no worse, and often with much higher efficiency than the Cash et al. scheme for the remaining queries.
Original language | English |
---|---|
Title of host publication | 2016 IEEE Trustcom/BigDataSE/ISPA |
Subtitle of host publication | Tianjin, China, 23-26 August, 2016, [Proceedings] |
Editors | Yang Xiang, Kui Ren, Dengguo Feng |
Place of Publication | Piscataway NJ USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 113-120 |
Number of pages | 8 |
ISBN (Electronic) | 9781509032051 |
ISBN (Print) | 9781509032068 |
DOIs | |
Publication status | Published - 2016 |
Event | IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) 2016 - Tianjin, China Duration: 23 Aug 2016 → 26 Aug 2016 Conference number: 15th https://ieeexplore.ieee.org/xpl/conhome/7845250/proceeding (Proceedings) |
Conference
Conference | IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) 2016 |
---|---|
Abbreviated title | TrustCom 2016 |
Country/Territory | China |
City | Tianjin |
Period | 23/08/16 → 26/08/16 |
Internet address |
Keywords
- Boolean query
- Cloud
- SSE