A homomorphic range searching scheme for sensitive data in internet of things
by Baohua Huang; Sheng Liang; Dongdong Xu; Zhuohao Wan
International Journal of Embedded Systems (IJES), Vol. 13, No. 1, 2020

Abstract: With the popularisation and development of the internet of things, big data and cloud computing, the search of data in cloud-based internet of things becomes a hot research topic. However, the sensitive data, such as the medical data collected by wearable devices, is inevitable to be stored in the cloud server. Homomorphic encryption has the ability to calculate the ciphertext without decryption. We separate the calculating and the decryption into different security domains to preserve the privacy of sensitive data, so the original plaintext would not be exposed in the cloud. Hence, we can compare two ciphertexts to get the difference of them in a privacy preserving way. In order to accelerate the search process of range query, we build an encrypted self-balancing binary index tree. Based on oblivious RAM, the searching scheme can hide the access patterns of the node of tree. The actual nodes and logic relation of tree are stored on different servers. A sample implementation of the proposed scheme is given, and the experimental results and analysis are presented to illustrate the scheme's effectiveness and security.

Online publication date: Wed, 08-Jul-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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