Name
Abstract | ||
|---|---|---|
Searchable Symmetric Encryption (SSE) is a technique to securely outsource the data, which is encrypted using symmetric key primitives, while maintaining search functionality. While several solutions have been proposed to realize SSE over various data structures, the efficient solution using inverted index is due to Curtmola et.al. Hwang et.al. introduced a SSE scheme based on bitmaps in order to reduce the index size. In this paper, we consider Searchable Symmetric Encryption (SSE) in the presence of a Semi-Honest-But-Curious Cloud Service Provider (SHBC-CSP). We have defined a new security notion for SSE in presence of SHBC-CSP, contrived two new SSE schemes and proved their security formally in the proposed security notion. Dynamic Verifiable Encrypted Keyword Search (DVSSE), is the first SSE scheme to the best of our knowledge, which is both dynamic and verifiable. We have implemented our schemes, compared their performance and complexity with existing schemes. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/CSCloud.2017.47 | 2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud) |
Keywords | DocType | Volume |
Search on protected or encrypted data,En-crypted Keyword Search,Dynamic and Verifiable Encrypted Keyword Search,Homomorphic Tag,Searchable Encryption,Symmetric Searchable Encryption,Random Oracle Model | Conference | 2017 |
ISBN | Citations | PageRank |
978-1-5090-6645-2 | 1 | 0.35 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajkumar Ramasamy | 1 | 2 | 1.04 |
| Sree Vivek | 2 | 140 | 20.72 |
| Praveen George | 3 | 1 | 0.35 |
| Bharat S. Rawal Kshatriya | 4 | 2 | 0.73 |