Title: Efficient and non-interactive ciphertext range query based on differential privacy

Authors: Peirou Feng; Qitian Sheng; Jianfeng Wang

Addresses: School of Cyber Engineering, Xidian University, Xi'an, China ' School of Cyber Engineering, Xidian University, Xi'an, China ' State Key Laboratory of Integrated Services Networks (ISN), Xidian University, Xi'an, China

Abstract: Differentially private range query schemes satisfy differential privacy by adding or deleting records during the process of creating index which suffers from the weakness of data loss in query results due to the negative noise. Recently, Sahin et al. (2018) proposed a differentially private index with overflow arrays in ICDE 2018, which ensures the integrity of query results. However, this scheme suffers from two drawbacks: 1) some private information (e.g., query requests or frequency) may be leaked because of querying over plaintext index; 2) the overflow arrays bring extra storage overhead. To this end, we present a non-interactive ciphertext range query based on differential privacy and comparable encryption. Our scheme can protect the query privacy since the query is performed over ciphertext based on comparable encryption. Besides, the experiment results show that our proposed scheme can save the storage overhead.

Keywords: range query; differential privacy; short comparable encryption.

DOI: 10.1504/IJCSE.2022.126252

International Journal of Computational Science and Engineering, 2022 Vol.25 No.5, pp.490 - 503

Received: 07 May 2021
Accepted: 10 Aug 2021

Published online: 18 Oct 2022 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article