PLRQ: Practical and less leakage range query over encrypted mobile cloud data
Publication Type
Journal Article
Publication Date
5-2025
Abstract
As a fundamental service in mobile cloud computing, range query has attracted extensive attention. But the existing secure range query schemes not only leak data privacy but also have low query efficiency. To address those issues, we first design a novel range-matched code to convert the range query into code set matching, which aims to hide the order relationship of outsourced data as well as the index of most significant different bit. Based on the designed range-matched code, we propose a Practical and Less Leakage Range Query scheme over encrypted mobile cloud data (PLRQ) by integrating XOR filter and multiset hash function. Security analysis shows that PLRQ achieves semantic security and avoids data privacy leakage. Extensive experiments using real datasets demonstrate that, compared with two state-of-the-art solutions-RngMatch and LSRQ, our proposed PLRQ improves the query efficiency both by 2 orders of magnitude, and reduces the storage cost on Cloud Service Provider by about 79.5% and 73.6% respectively.
Keywords
Mobile cloud computing, range query, data privacy, query privacy, range-matched code, less leakage
Discipline
Information Security
Publication
IEEE Transactions on Mobile Computing
Volume
24
Issue
5
First Page
4183
Last Page
4201
ISSN
1536-1233
Identifier
10.1109/TMC.2024.3521366
Publisher
Institute of Electrical and Electronics Engineers
Citation
WANG, Yunwei; LI, Xinghua; MIAO, Yinbin; TONG, Qiuyun; LIU, Ximeng; and DENG, Robert H..
PLRQ: Practical and less leakage range query over encrypted mobile cloud data. (2025). IEEE Transactions on Mobile Computing. 24, (5), 4183-4201.
Available at: https://ink.library.smu.edu.sg/sis_research/10455
Additional URL
https://doi.org/10.1109/TMC.2024.3521366