Name
Abstract | ||
|---|---|---|
Due to its capabilities of searches and updates over the encrypted database, the dynamic searchable symmetric encryption (DSSE) has received considerable attention recently. To resist leakage abuse attacks, a secure DSSE scheme usually requires forward and backward privacy. However, the existing forward and backward private DSSE schemes either only support single keyword queries or require more interactions between the client and the server. In this article, we first give a new leakage function for range queries, which is more complicated than the one for single keyword queries. Furthermore, we propose a concrete forward and backward private DSSE scheme by using a refined binary tree data structure. Finally, the detailed security analysis and extensive experiments demonstrate that our proposal is secure and efficient, respectively. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TDSC.2020.2994377 | IEEE Transactions on Dependable and Secure Computing |
Keywords | DocType | Volume |
Dynamic searchable symmetric encryption,forward privacy,backward privacy,range queries | Journal | 19 |
Issue | ISSN | Citations |
1 | 1545-5971 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cong Zuo | 1 | 41 | 6.00 |
| Shifeng Sun | 2 | 59 | 15.53 |
| Joseph K. Liu | 3 | 1134 | 67.24 |
| Jun Shao | 4 | 165 | 25.53 |
| Josef Pieprzyk | 5 | 2004 | 323.16 |
| Lei Xu | 6 | 3590 | 387.32 |