Efficient and non-interactive ciphertext range query based on differential privacy Online publication date: Tue, 18-Oct-2022
by Peirou Feng; Qitian Sheng; Jianfeng Wang
International Journal of Computational Science and Engineering (IJCSE), Vol. 25, No. 5, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook