Paper 2019/1240 Original: eprint.iacr.org/2019/1240 ↗

Forward and Backward Private DSSE for Range Queries

Cong Zuo
Shi-Feng Sun
Joseph K. Liu
Jun Shao
Josef Pieprzyk
Lei Xu
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 paper, 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2019-10-23: last updated
2019-10-23: published
Short URL
https://ia.cr/2019/1240
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2019/1240,
      author = {Cong Zuo and Shi-Feng Sun and Joseph K.  Liu and Jun Shao and Josef Pieprzyk and Lei Xu},
      title = {Forward and Backward Private DSSE for Range Queries},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1240},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1240}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.